Combinatorial Pattern Matching: 9th Annual Symposium, Cpm'98, Piscataway, New Jersey, Usa, July 20-22, 1998, Proceedings

ISBN-13: 9783540647393 / Angielski / Miękka / 1998 / 259 str.

M. Farach-Colton; Martin Farach-Colton; G. Goos

Opis

Taken from proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, held in New Jersey, July 1998 (CPM '98), this text includes issues in combinatorial pattern matching, dealing with a variety of classical objects to be matched as well as with DNA coding.

Spis treści

A fast bit-vector algorithm for approximate string matching based on dynamic programming.- A bit-parallel approach to suffix automata: Fast extended string matching.- A dictionary matching algorithm fast on the average for terms of varying length.- A very fast string matching algorithm for small alphabets and long patterns.- Approximate word sequence matching over Sparse Suffix Trees.- Efficient parallel algorithm for the editing distance between ordered trees.- Reporting exact and approximate regular expression matches.- An approximate oracle for distance in metric spaces.- A rotation invariant filter for two-dimensional string matching.- Constructing suffix arrays for multi-dimensional matrices.- Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version.- Comparison of coding DNA.- Fixed topology alignment with recombination.- Aligning alignments.- Efficient special cases of pattern matching with swaps.- Aligning DNA sequences to minimize the change in protein.- Genome halving.