This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

The problem of inducing, learning or inferring grammars has been studied for decades, but
only in recent years has grammatical inference emerged as an independent field with …

With few exceptions, current methods for short read mapping make use of simple seed
heuristics to speed up the search. Most of the underlying matching models neglect the …

Power-law distributions are the main functional form for the distribution of repeat size and
repeat copy number in the human genome. When the genome is broken into fragments for …

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 …

The rapid growth of digital libraries, e-governance, and internet based applications has
caused an exponential escalation in the volume of 'Big-data'particularly due to texts, images …

The last two decades have witnessed a dramatic increase in the amount of highly repetitive
datasets consisting of sequential data (strings, texts). Processing these massive amounts of …

The two parts of this text are based on two series of lectures delivered by Jean Berstel and
Christophe Reutenauer in March 2007 at the Centre de Recherches Mathematiques …

We study quantum algorithms for several fundamental string problems, including Longest
Common Substring, Lexicographically Minimal String Rotation, and Longest Square …

The suffix array SA [1.. n] of a text T of length n is a permutation of {1,…, n} describing the
lexicographical ordering of suffixes of T and is considered to be one of the most important …