Combinatorial Pattern Matching

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Gene Regulation, Protein Networks and Disease: A Computational Perspective
3. Altmetric Badge
   Chapter 2 Wavelet Trees for All
4. Altmetric Badge
   Chapter 3 The Maximum Number of Squares in a Tree
5. Altmetric Badge
   Chapter 4 Faster and Simpler Minimal Conflicting Set Identification
6. Altmetric Badge
   Chapter 5 Partitioning into Colorful Components by Minimum Edge Deletions
7. Altmetric Badge
   Chapter 6 Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations
8. Altmetric Badge
   Chapter 7 Constant-Time Word-Size String Matching
9. Altmetric Badge
   Chapter 8 Pattern Matching in Multiple Streams
10. Altmetric Badge
    Chapter 9 An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata
11. Altmetric Badge
    Chapter 10 Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation
12. Altmetric Badge
    Chapter 11 Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths
13. Altmetric Badge
    Chapter 12 Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
14. Altmetric Badge
    Chapter 13 The Complexity of String Partitioning
15. Altmetric Badge
    Chapter 14 Towards an Optimal Space-and-Query-Time Index for Top- k Document Retrieval
16. Altmetric Badge
    Chapter 15 Document Listing for Queries with Excluded Pattern
17. Altmetric Badge
    Chapter 16 Cross-Document Pattern Matching
18. Altmetric Badge
    Chapter 17 FEMTO: Fast Search of Large Sequence Collections
19. Altmetric Badge
    Chapter 18 Speeding-up $q$-gram mining on grammar-based compressed texts
20. Altmetric Badge
    Chapter 19 Simple and Efficient LZW-Compressed Multiple Pattern Matching
21. Altmetric Badge
    Chapter 20 Computing the Burrows-Wheeler Transform of a String and Its Reverse
22. Altmetric Badge
    Chapter 21 Efficient Algorithm for Circular Burrows-Wheeler Transform
23. Altmetric Badge
    Chapter 22 Least Random Suffix/Prefix Matches in Output-Sensitive Time
24. Altmetric Badge
    Chapter 23 Compressed String Dictionary Look-Up with Edit Distance One
25. Altmetric Badge
    Chapter 24 Time-Space Trade-Offs for Longest Common Extensions
26. Altmetric Badge
    Chapter 25 Local Exact Pattern Matching for Non-fixed RNA Structures
27. Altmetric Badge
    Chapter 26 Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots
28. Altmetric Badge
    Chapter 27 Finding Longest Common Segments in Protein Structures in Nearly Linear Time
29. Altmetric Badge
    Chapter 28 A Linear Kernel for the Complementary Maximal Strip Recovery Problem
30. Altmetric Badge
    Chapter 29 Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees
31. Altmetric Badge
    Chapter 30 Fixed-Parameter Algorithms for Finding Agreement Supertrees
32. Altmetric Badge
    Chapter 31 Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles
33. Altmetric Badge
    Chapter 32 Minimum Leaf Removal for Reconciliation: Complexity and Algorithms
34. Altmetric Badge
    Chapter 33 On the Closest String via Rank Distance
35. Altmetric Badge
    Chapter 34 On Approximating String Selection Problems with Outliers
36. Altmetric Badge
    Chapter 35 The Parameterized Complexity of the Shared Center Problem