+612 9045 4394
 
CHECKOUT
Combinatorial Pattern Matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings - Alberto Apostolico

Combinatorial Pattern Matching

8th Annual Symposium, CPM 97, Aarhus, Denmark, June/July 1997. Proceedings

By: Alberto Apostolico (Editor), Jotun Hein (Editor)

Paperback

Published: 18th June 1997
Ships: 15 business days
15 business days
$125.46
or 4 easy payments of $31.37 with Learn more

Other Available Formats (Hide)

  • Paperback View Product Published: 18th May 1993
    Ships: 15 business days
    15 business days
    $93.77
  • Paperback View Product Published: 1st July 2005
    Ships: 15 business days
    15 business days
    $160.80
  • Paperback View Product Published: 19th June 2002
    Ships: 15 business days
    15 business days
    $135.89

This book constitutes the refereed proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97, held in Aarhus, Denmark, in June/July 1997.
The volume presents 20 revised full papers carefully selected from 32 submissions received; also included are abstracts of two invited contributions. The volume is devoted to the issue of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays. The results presented are particularly relevant to molecular biology, but also to information retrieval, pattern recognition, compiling, data compression and program analysis.

An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programsp. 1
Episode Matchingp. 12
Efficient Algorithms for Approximate String Matching with Swapsp. 28
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Textsp. 40
Estimating the Probability of Approximate Matchesp. 52
Space- and Time-Efficient Decoding with Canonical Huffman Treesp. 65
On Weak Circular Squares in Binary Wordsp. 76
An Easy Case of Sorting by Reversalsp. 83
External Inverse Pattern Matchingp. 90
Distributed Generation of Suffix Arraysp. 102
Direct Construction of Compact Directed Acyclic Word Graphsp. 116
Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problemp. 130
A New Algorithm for the Ordered Tree Inclusion Problemp. 150
On Incremental Computation of Transitive Closure and Greedy Alignmentp. 167
Aligning Coding DNA in the Presence of Frame-Shift Errorsp. 180
A Filter Method for the Weighted Local Similarity Search Problemp. 191
Trie-Based Data Structures for Sequence Assemblyp. 206
Flexible Identification of Structural Objects in Nucleic Acid Sequences: Palindromes, Mirror Repeats, Pseudoknots and Triple Helicesp. 224
Banishing Bias from Consensus Sequencesp. 247
On the Nadeau-Taylor Theory of Conserved Chromosome Segmentsp. 262
Iterative versus Simultaneous Multiple Sequence Alignmentp. 275
Modern Comparative Lexicostatisticsp. 276
Author Indexp. 277
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540632207
ISBN-10: 3540632204
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 284
Published: 18th June 1997
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 1.55
Weight (kg): 0.41