Combinatorial Pattern Matching 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings /

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

The papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3-5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited le...

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

• Practical Software for Aligning ESTs to Human Genome
• Efficient Text Mining with Optimized Pattern Discovery
• Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression
• Block Merging for Off-Line Compression
• String Matching with Stopper Encoding and Code Splitting
• Pattern Matching Problems over 2-Interval Sets
• The Problem of Context Sensitive String Matching
• Two-Pattern Strings
• Edit Distance with Move Operations
• Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time
• Local Similarity Based Point-Pattern Matching
• Identifying Occurrences of Maximal Pairs in Multiple Strings
• Space-Economical Algorithms for Finding Maximal Unique Matches
• The Minimum DAWG for All Suffixes of a String and Its Applications
• On the Complexity of Deriving Position Specific Score Matrices from Examples
• Three Heuristics for ?-Matching: ?-BM Algorithms
• A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding
• Faster Bit-Parallel Approximate String Matching
• One-Gapped q-Gram Filters for Levenshtein Distance
• Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations
• Statistical Identification of Uniformly Mutated Segments within Repeats
• Simple and Practical Sequence Nearest Neighbors with Block Operations
• Constructing NFAs by Optimal Use of Positions in Regular Expressions.