Combinatorial Pattern Matching 11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Giancarlo, Raffaele (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sankoff, David (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
• Έκδοση: 1st ed. 2000.
• Σειρά: Lecture Notes in Computer Science, 1848
• Θέματα: Pattern recognition.; Computers.; Algorithms.; Natural language processing (Computer science).; Information storage and retrieval.; Combinatorics.; Pattern Recognition.; Theory of Computation.; Algorithm Analysis and Problem Complexity.; Natural Language Processing (NLP).; Information Storage and Retrieval.

Πίνακας περιεχομένων:

• Invited Lectures
• Identifying and Filtering Near-Duplicate Documents
• Machine Learning for Efficient Natural-Language Processing
• Browsing around a Digital Library: Today and Tomorrow
• Summer School Lectures
• Algorithmic Aspects of Speech Recognition: A Synopsis
• Some Results on Flexible-Pattern Discovery
• Contributed Papers
• 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
• A Lower Bound for the Breakpoint Phylogeny Problem
• Structural Properties and Tractability Results for Linear Synteny
• Shift Error Detection in Standardized Exams
• An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC)
• The Combinatorial Partitioning Method
• Compact Suffix Array
• Linear Bidirectional On-Line Construction of Affix Trees
• Using Suffix Trees for Gapped Motif Discovery
• Indexing Text with Approximate q-Grams
• Simple Optimal String Matching Algorithm
• Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts
• Periods and Quasiperiods Characterization
• Finding Maximal Quasiperiodicities in Strings
• On the Complexity of Determining the Period of a String.