product iamge

Combinatorial Pattern Matching: 9th Annual Symposium, CPM 98 Piscataway, New Jersey, USA, July 20–22 1998 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, CPM 98, held in Piscataway, NJ, USA, in July 1998. The 17 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers address all current issues in combinatorial pattern matching dealing with a variety of classical objects to be matched as well as with DNA coding.

Author(s): Gene Myers (auth.), Martin Farach-Colton (eds.)
Series: Lecture Notes in Computer Science 1448
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1998

Language: English
Pages: 259
Tags: Algorithm Analysis and Problem Complexity; Pattern Recognition; Discrete Mathematics in Computer Science; Combinatorics

A fast bit-vector algorithm for approximate string matching based on dynamic programming....Pages 1-13
A bit-parallel approach to suffix automata: Fast extended string matching....Pages 14-33
A dictionary matching algorithm fast on the average for terms of varying length....Pages 34-54
A very fast string matching algorithm for small alphabets and long patterns....Pages 55-64
Approximate word sequence matching over Sparse Suffix Trees....Pages 65-79
Efficient parallel algorithm for the editing distance between ordered trees....Pages 80-90
Reporting exact and approximate regular expression matches....Pages 91-103
An approximate oracle for distance in metric spaces....Pages 104-117
A rotation invariant filter for two-dimensional string matching....Pages 118-125
Constructing suffix arrays for multi-dimensional matrices....Pages 126-139
Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version....Pages 140-152
Comparison of coding DNA....Pages 153-173
Fixed topology alignment with recombination....Pages 174-188
Aligning alignments....Pages 189-208
Efficient special cases of pattern matching with swaps....Pages 209-220
Aligning DNA sequences to minimize the change in protein....Pages 221-234
Genome halving....Pages 235-250