Combinatorial Pattern Matching

11th Annual Symposium, CPM 2000 Montreal, Canada, June 21–23, 2000 Proceedings

Editors:

ISBN: 978-3-540-67633-1 (Print) 978-3-540-45123-5 (Online)

Table of contents (34 chapters)

previous Page of 2
  1. Invited Lectures

    1. No Access

      Book Chapter

      Pages 1-10

      Identifying and Filtering Near-Duplicate Documents

    2. No Access

      Book Chapter

      Pages 11-11

      Machine Learning for Efficient Natural-Language Processing

    3. No Access

      Book Chapter

      Pages 12-26

      Browsing around a Digital Library: Today and Tomorrow

  2. Summer School Lectures

    1. No Access

      Book Chapter

      Pages 27-32

      Algorithmic Aspects of Speech Recognition: A Synopsis

    2. No Access

      Book Chapter

      Pages 33-45

      Some Results on Flexible-Pattern Discovery

  3. Contributed Papers

    1. No Access

      Book Chapter

      Pages 46-59

      Explaining and Controlling Ambiguity in Dynamic Programming

    2. No Access

      Book Chapter

      Pages 60-68

      A Dynamic Edit Distance Table

    3. No Access

      Book Chapter

      Pages 69-83

      Parametric Multiple Sequence Alignment and Phylogeny Construction

    4. No Access

      Book Chapter

      Pages 84-98

      Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment

    5. No Access

      Book Chapter

      Pages 99-107

      A Polynomial Time Approximation Scheme for the Closest Substring Problem

    6. No Access

      Book Chapter

      Pages 108-118

      Approximation Algorithms for Hamming Clustering Problems

    7. No Access

      Book Chapter

      Pages 119-128

      Approximating the Maximum Isomorphic Agreement Subtree Is Hard

    8. No Access

      Book Chapter

      Pages 129-142

      A Faster and Unifying Algorithm for Comparing Trees

    9. No Access

      Book Chapter

      Pages 143-153

      Incomplete Directed Perfect Phylogeny

    10. No Access

      Book Chapter

      Pages 154-165

      The Longest Common Subsequence Problem for Arc-Annotated Sequences

    11. No Access

      Book Chapter

      Pages 166-180

      Boyer—Moore String Matching over Ziv-Lempel Compressed Text

    12. No Access

      Book Chapter

      Pages 181-194

      A Boyer—Moore Type Algorithm for Compressed Pattern Matching

    13. No Access

      Book Chapter

      Pages 195-209

      Approximate String Matching over Ziv—Lempel Compressed Text

    14. No Access

      Book Chapter

      Pages 210-221

      Improving Static Compression Schemes by Alphabet Extension

    15. No Access

      Book Chapter

      Pages 222-234

      Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments

previous Page of 2