Analytic Pattern Matching: From DNA to Twitter

How do you distinguish a cat from a dog by their DNA? Did Shakespeare really write all of his plays? Pattern matching techniques can offer answers to these questions and to many others, from molecular biology, to telecommunications, to classifying Twitter content. This book for researchers and graduate students demonstrates the probabilistic approach to pattern matching, which predicts the performance of pattern matching algorithms with very high precision using analytic combinatorics and analytic information theory. Part I compiles known results of pattern matching problems via analytic methods. Part II focuses on applications to various data structures on words, such as digital trees, suffix trees, string complexity and string-based data compression. The authors use results and techniques from Part I and also introduce new methodology such as the Mellin transform and analytic depoissonization. More than 100 end-of-chapter problems help the reader to make the link between theory and practice.

Table of Contents

Part I ANALYSIS
Chapter 1 Probabilistic Models
Chapter 2 Exact String Matching
Chapter 3 Constrained Exact String Matching
Chapter 4 Generalized String Matching
Chapter 5 Subsequence String Matching
Part II APPLICATIONS
Chapter 6 Algorithms and Data Structures
Chapter 7 Digital Trees
Chapter 8 Suffix Trees and Lempel–Ziv’77
Chapter 9 Lempel–Ziv’78 Compression Algorithm
Chapter 10 String Complexity