+612 9045 4394
 
CHECKOUT
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Combinatorial Pattern Matching : 6th Annual Symposium, CPM 95, Espoo, Finland, July 5 - 7, 1995. Proceedings - Zvi Galil

Combinatorial Pattern Matching

6th Annual Symposium, CPM 95, Espoo, Finland, July 5 - 7, 1995. Proceedings

By: Zvi Galil (Editor), Esko Ukkonen (Editor)

Paperback Published: 21st June 1995
ISBN: 9783540600442
Number Of Pages: 412

Share This Book:

Paperback

$135.51
or 4 easy payments of $33.88 with Learn more
Ships in 10 to 15 business days

Earn 271 Qantas Points
on this Book

This volume presents the proceedings of the 6th International Symposium on Combinatorial Pattern Matching, CPM '95, held in Espoo, Finland in July 1995.
CPM addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, extended expressions, etc. The aim is to derive non-trivial combinatorial properties in order to improve the performance of the corresponding computational problems. This volume presents 27 selected refereed full research papers and two invited papers; it addresses all current aspects of CPM and its applications such as the design and analysis of algorithms for pattern matching problems in strings, graphs, and hypertexts, as well as in biological sequences and molecules.

Computing Similarity between RNA Stringsp. 1
Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibilityp. 17
Efficient String Matching on Coded Textsp. 27
Fast Approximate Matching using Suffix Treesp. 41
Common Subsequences and Supersequences and Their Expected Lengthp. 55
Pattern Matching in Directed Graphsp. 64
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Samplingp. 78
Multi-Dimensional Pattern Matching with Dimensional Wildcardsp. 90
Minimizing Phylogenetic Number to Find Good Evolutionary Treesp. 102
Making the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment More Space Efficient in Practicep. 128
An Efficient Algorithm for Developing Topologically Valid Matchingsp. 144
Polynomial-Time Algorithm for Computing Translocation Distance between Genomesp. 162
On the Complexity of Comparing Evolutionary Treesp. 177
Suffix Cactus: A Cross between Suffix Tree and Suffix Arrayp. 191
Pattern-Matching for Strings with Short Descriptionsp. 205
Pairwise Alignment with Scoring on Tuplesp. 215
Matching a Set of Strings with Variable Length Don't Caresp. 230
Three-Dimensional Pattern Matching in Protein Structure Analysisp. 248
Genome Analysis: Pattern Search in Biological Macromoleculesp. 261
Matching Patterns of an Automatonp. 286
New Results and Open Problems Related to Non-Standard Stringologyp. 298
String Matching in Hypertextp. 318
Approximation Algorithms for Multiple Sequence Alignment under a Fixed Evolutionary Treep. 330
A New Flexible Algorithm for the Longest Common Subsequence Problemp. 340
Smaller Representations for Finite-State Transducers and Finite-State Automatap. 352
Multiple Sequence Comparison - A Peptide Matching Approachp. 366
On a Technique for Parsing a Stringp. 386
Dictionary Look-Up with Small Errorsp. 387
On the Editing Distance between Undirected Acyclic Graphs and Related Problemsp. 395
Author Indexp. 409
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540600442
ISBN-10: 3540600442
Series: Lecture Notes in Computer Science : Book 937
Audience: General
Format: Paperback
Language: English
Number Of Pages: 412
Published: 21st June 1995
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.21
Weight (kg): 0.59

Earn 271 Qantas Points
on this Book