Combinatorial Pattern Matching

13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings

Häftad, Engelska, 2002

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2002-06-19
Mått155 x 235 x 17 mm
Vikt464 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor290
Upplaga2002
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540438625

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik
Diskret matematik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och it
Databaser inom Data och it
Kombinatorik och grafteori inom Naturvetenskap och teknik

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.