This book constitutes the refereed proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002, held in Fukuoka, Japan, in July 2002.The 21 revised full papers presented together with two invited contributions were carefully reviewed and selected from 37 submissions. The papers are devoted to current theoretical and computational aspects of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. Among the application fields are the World Wide Web, computational biology, computer vision, multimedia, information retrieval, data compression, and pattern recognition.
作者簡介
暫缺《組合模式匹配(會議錄)》作者簡介
圖書目錄
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 SUBSEQUENCE Problem 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 5-Matching: 5-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 Author Index