Average Case Analysis of Algorithms on Sequences (Wiley Series in Discrete Mathematics and Optimization, #50)

by Wojciech Szpankowski

0 ratings • 0 reviews • 0 shelved
Book cover for Average Case Analysis of Algorithms on Sequences

Bookhype may earn a small commission from qualifying purchases. Full disclosure.

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. 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. Written by an established researcher with a strong international reputation in the field.
  • ISBN10 047124063X
  • ISBN13 9780471240631
  • Publish Date 24 April 2001
  • Publish Status Active
  • Publish Country US
  • Imprint John Wiley & Sons Inc
  • Format Hardcover
  • Pages 576
  • Language English