Average Case Analysis of Algorithms on Sequences Tapa dura - 2001 - 1st Edición

Primera línea

In this book we choose one facet of the theory of algorithms, namely data structures and algorithms on sequences (strings, words) to illustrate probabilistic, combinatorial, and analytic techniques of analysis.

Descripción de contraportada

Comprehensive presentation of both analytic and probabilistic techniques

As a comprehensive survey of the major techniques of average case analysis, this work presents, in detail, both analytic methods used for well-structured algorithms and probabilistic methods used for more structurally complex algorithms. In particular, the applications in the book use algorithms that focus on data structures on sequences, also called strings, which are widely used in computer science, computational biology, and information theory. Specific techniques covered include the inclusion-exclusion principle, the first and second moment methods, the random coding technique, the subadditive ergodic theorem, large deviations, generating functions, complex asymptotic methods, the Mellin transform, and analytic poissonization and depoissonization. Each method is clearly explained and accompanied by related applications and problems involving algorithms on sequences.

Important features of the book include:
* A foreword by well-known expert Dr. Philippe Flajolet, INRIA, France
* Presentation of complex analysis used to solve discrete and probabilistic problems on sequences
* Discussions of Lempel-Ziv data compression-schemes, the string edit problem, pattern matching algorithms, many variations of digital trees, the leader election algorithm, and more
* A chapter devoted to tools used in information theory, particularly the random coding technique and pattern matching approach to data compression
* Application sections in each chapter that illustrate the methods covered
* An extensive bibliography

Reseñas en medios

Citas

• Scitech Book News, 09/01/2001, Page 36