Combinatorial Pattern Matching

This book constitutes the refereed proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching, CPM 99, held in Warwick, UK in July 1999. The 21 revised papers presented were carefully reviewed and selected from 26 submissions. The papers address all current issues in combinatorial pattern matching dealing with a variety of classical objects like trees, regular expressions, graphs, point sets, and arrays as well as with DNA/RNA coding, WWW issues, information retrieval, data compression, and pattern recognition.

Inhalt

Shift-And Approach to Pattern Matching in LZW Compressed Text.- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text.- Pattern Matching in Text Compressed by Using Antidictionaries.- On the Structure of Syntenic Distance.- Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem.- Hybridization and Genome Rearrangement.- On the Complexity of Positional Sequencing by Hybridization.- GESTALT: Genomic Steiner Alignments.- Bounds on the Number of String Subsequences.- Approximate Periods of Strings.- Finding Maximal Pairs with Bounded Gap.- A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes.- A New Indexing Method for Approximate String Matching.- The Compression of Subsegments of Images Described by Finite Automata.- Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays.- Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions.- Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology.- Fast Multi-dimensional Approximate Pattern Matching.- Finding Common RNA Secondary Structures from RNA Sequences.- Finding Common Subsequences with Arcs and Pseudoknots.- Computing Similarity between RNA Structures.