Book Volume 7922 2013

Combinatorial Pattern Matching

24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings

Editors:

ISBN: 978-3-642-38904-7 (Print) 978-3-642-38905-4 (Online)

Table of contents (24 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Chapter

    Pages 1-10

    Forty Years of Text Indexing

  3. No Access

    Chapter

    Pages 11-11

    LCP Magic

  4. No Access

    Chapter

    Pages 12-12

    Discrete Methods for Image Analysis Applied to Molecular Biology

  5. No Access

    Chapter

    Pages 13-27

    Locating All Maximal Approximate Runs in a String

  6. No Access

    Chapter

    Pages 28-37

    On Minimal and Maximal Suffixes of a Substring

  7. No Access

    Chapter

    Pages 38-49

    Converting SLP to LZ78 in almost Linear Time

  8. No Access

    Chapter

    Pages 50-61

    A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm

  9. No Access

    Chapter

    Pages 62-73

    Compact q-Gram Profiling of Compressed Strings

  10. No Access

    Chapter

    Pages 74-82

    A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform

  11. No Access

    Chapter

    Pages 83-94

    Pattern Matching with Variables: A Multivariate Complexity Analysis

  12. No Access

    Chapter

    Pages 95-106

    New Algorithms for Position Heaps

  13. No Access

    Chapter

    Pages 107-119

    Document Listing on Repetitive Collections

  14. No Access

    Chapter

    Pages 120-129

    Approximating Shortest Superstring Problem Using de Bruijn Graphs

  15. No Access

    Chapter

    Pages 130-141

    Local Search for String Problems: Brute Force Is Essentially Optimal

  16. No Access

    Chapter

    Pages 142-152

    Space-Efficient Construction Algorithm for the Circular Suffix Tree

  17. No Access

    Chapter

    Pages 153-164

    Efficient Lyndon Factorization of Grammar Compressed Text

  18. No Access

    Chapter

    Pages 165-176

    Approximation of Grammar-Based Compression via Recompression

  19. No Access

    Chapter

    Pages 177-188

    Fast Algorithm for Partial Covers in Words

  20. No Access

    Chapter

    Pages 189-200

    Linear Time Lempel-Ziv Factorization: Simple, Fast, Small

  21. No Access

    Chapter

    Pages 201-210

    External Memory Generalized Suffix and LCP Arrays Construction

previous Page of 2