Combinatorial pattern matching : 10th annual symposium, CPM 99, Warwick University, UK, July 22 24, 1999 : pro | CPM (Symposium) (10th : 1999 : Warwick University), Crochemore, Maxime, 1947-, Paterson, Michael S

Combinatorial Pattern Matching: 10th Annual Symposium, CPM 99 Warwick University, UK, July 22–24, 1999 Proceedings
Author: Maxime Crochemore, Mike Paterson
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66278-5
DOI: 10.1007/3-540-48452-3

Table of Contents:

• 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

Includes bibliographical references and index
Shift-and approach to pattern matching in LZW compressed text / Takuya Kida [and others] -- A general practical approach to pattern matching over Ziv-Lempel compressed text / Gonzalo Navarro and Mathieu Raffinot -- Pattern matching in text compressed by using antidictionaries / Yusuke Shibata [and others] -- On the structure of syntenic distance / David Liben-Nowell -- Physical mapping with repeated probes: the hypergraph superstring problem / Serafim Batzoglou and Sorin Istrail -- Hybridization and genome rearrangement / Nadia El-Mabrouk and David Sankoff -- On the complexity of positional sequencing by hybridization / Amir Ben-Dor [and others] -- GESTALT: genomic steiner alignments / Giuseppe Lancia and R. Ravi -- Bounds on the number of string subsequences / Daniel S. Hirschberg -- Approximate periods of strings / Jeong Seop Sim [and others] -- Finding maximal pairs with bounded gap / Gerth Stølting Brodal [and others] -- A dynamic data structure for reverse lexicographically sorted prefixes / Hidetoshi Yokoo -- A new indexing method for approximate string matching / Gonzalo Navarro and Ricardo Baeza-Yates -- The compression of subsegments of images described by finite automata / Juhani Karhumäki, Wojciech Plandowski, and Wojciech Rytter -- Ziv Lempel compression of huge natural language data tries using suffix arrays / Strahil Ristov and Eric Laporte -- Matching of spots in 2D electrophoresis images. Point matching under non-uniform distortions / Tatsuya Akutsu [and others] -- Applying an edit distance to the matching of tree ring sequences in dendrochronology / Carola Wenk -- Fast multi-dimensional approximate pattern matching / Gonzalo Navarro and Ricardo Baeza-Yates -- Finding common RNA secondary structures from RNA sequences / Zhuozhi Wang and Kaizhong Zhang -- Finding common subsequences with arcs and pseudoknots / Patricia A. Evans -- Computing similarity between RNA structures / Kaizhong Zhang, Lusheng Wang, and Bin Ma