Document retrieval is one of the best-established information retrieval activities since
the'60s, pervading all search engines. Its aim is to obtain, from a collection of text …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

A timely book on a topic that has witnessed a surge of interest over the last decade, owing in
part to several novel applications, most notably in data compression and computational …

The enormous complexity of biological systems at the molecular level must be answered
with powerful computational methods. Computational biology is a young field, but has seen …

We present algorithms for efficient searching of regular expressions on preprocessed text,
using a Patricia tree as a logical model for the index. We obtain searching algorithms that …

Partly motivated by entropy-estimation problems in neuroscience, we present a detailed and
extensive comparison between some of the most popular and effective entropy estimation …

Suffix trees are among the most important data structures in stringology, with a number of
applications in flourishing areas like bioinformatics. Their main problem is space usage …

The Lempel-Ziv parsing scheme finds a wide range of applications, most notably in data
compression and algorithms on words. It partitions a sequence of length n into variable …

We study the entropy rate of a hidden Markov process (HMP) defined by observing the
output of a binary symmetric channel whose input is a first-order binary Markov process …

A practical suboptimal (variable source coding) algorithm for lossy data compression is
presented. This scheme is based on approximate string matching, and it naturally extends …