Average case analysis of algorithms on sequences

This is 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 molecular biology.

It describes methods employed in average case analysis of algorithms, combining both analytical and probabilistic tools in a single volume.

Tools are illustrated through problems on words with applications to molecular biology, data compression, security, and pattern matching.

The book includes chapters on algorithms and data structures on words, probabilistic and analytical models, inclusion-exclusion principles, first and second moment methods, subadditive ergodic theorem and large deviations, elements of information theory, generating functions, complex asymptotic methods, Mellin transform and its applications, and analytic poissonization and depoissonization.

It is written by an established researcher with a strong international reputation in the field.