Combinatorial Pattern Matching: 11th Annual Symposium, CPM 2000 Montreal, Canada, June 21–23, 2000 ProceedingsAuthor: Raffaele Giancarlo, David Sankoff Published by Springer Berlin Heidelberg ISBN: 978-3-540-67633-1 DOI: 10.1007/3-540-45123-4Table of Contents:Identifying and Filtering Near-Duplicate Documents Machine Learning for Efficient Natural-Language Processing Browsing around a Digital Library: Today and Tomorrow Algorithmic Aspects of Speech Recognition: A Synopsis Some Results on Flexible-Pattern Discovery Explaining and Controlling Ambiguity in Dynamic Programming A Dynamic Edit Distance Table Parametric Multiple Sequence Alignment and Phylogeny Construction Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment A Polynomial Time Approximation Scheme for the Closest Substring Problem Approximation Algorithms for Hamming Clustering Problems Approximating the Maximum Isomorphic Agreement Subtree Is Hard A Faster and Unifying Algorithm for Comparing Trees Incomplete Directed Perfect Phylogeny The Longest Common Subsequence Problem for Arc-Annotated Sequences Boyer—Moore String Matching over Ziv-Lempel Compressed Text A Boyer—Moore Type Algorithm for Compressed Pattern Matching Approximate String Matching over Ziv—Lempel Compressed Text Improving Static Compression Schemes by Alphabet Extension Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments, Includes index, Includes bibliographical references and author index