Combinatorial Pattern Matching

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Algorithms for Forest Pattern Matching
3. Altmetric Badge
   Chapter 2 Affine Image Matching Is Uniform ${\text{\rm TC}^0}$ -Complete
4. Altmetric Badge
   Chapter 3 Old and New in Stringology
5. Altmetric Badge
   Chapter 4 Small-Space 2D Compressed Dictionary Matching
6. Altmetric Badge
   Chapter 5 Bidirectional Search in a String with Wavelet Trees
7. Altmetric Badge
   Chapter 6 A Minimal Periods Algorithm with Applications
8. Altmetric Badge
   Chapter 7 The Property Suffix Tree with Dynamic Properties
9. Altmetric Badge
   Chapter 8 Approximate All-Pairs Suffix/Prefix Overlaps
10. Altmetric Badge
    Chapter 9 Succinct Dictionary Matching with No Slowdown
11. Altmetric Badge
    Chapter 10 Pseudo-realtime Pattern Matching: Closing the Gap
12. Altmetric Badge
    Chapter 11 Breakpoint Distance and PQ-Trees
13. Altmetric Badge
    Chapter 12 On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
14. Altmetric Badge
    Chapter 13 Succinct Representations of Separable Graphs
15. Altmetric Badge
    Chapter 14 Implicit Hitting Set Problems and Multi-genome Alignment
16. Altmetric Badge
    Chapter 15 Bounds on the Minimum Mosaic of Population Sequences under Recombination
17. Altmetric Badge
    Chapter 16 The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
18. Altmetric Badge
    Chapter 17 Phylogeny- and Parsimony-Based Haplotype Inference with Constraints
19. Altmetric Badge
    Chapter 18 Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
20. Altmetric Badge
    Chapter 19 Mod/Resc Parsimony Inference
21. Altmetric Badge
    Chapter 20 Extended Islands of Tractability for Parsimony Haplotyping
22. Altmetric Badge
    Chapter 21 Sampled Longest Common Prefix Array
23. Altmetric Badge
    Chapter 22 Verifying a Parameterized Border Array in O ( n 1.5 ) Time
24. Altmetric Badge
    Chapter 23 Cover Array String Reconstruction
25. Altmetric Badge
    Chapter 24 Compression, Indexing, and Retrieval for Massive String Data
26. Altmetric Badge
    Chapter 25 Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality
27. Altmetric Badge
    Chapter 26 A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
28. Altmetric Badge
    Chapter 27 Algorithms for Three Versions of the Shortest Common Superstring Problem
29. Altmetric Badge
    Chapter 28 Finding Optimal Alignment and Consensus of Circular Strings
30. Altmetric Badge
    Chapter 29 Optimizing Restriction Site Placement for Synthetic Genomes
31. Altmetric Badge
    Chapter 30 Extension and Faster Implementation of the GRP Transform for Lossless Compression
32. Altmetric Badge
    Chapter 31 Parallel and Distributed Compressed Indexes