Del 937 - Lecture Notes in Computer Science

Combinatorial Pattern Matching

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

Häftad, Engelska, 1995

Av Zvi Galil, Esko Ukkonen

739 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1995-06-21
Mått216 x 279 x 23 mm
Vikt639 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor412
Upplaga1995
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540600442

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik
Databaser inom Data och it

Computing similarity between RNA strings.- Of chicken teeth and mouse eyes, or generalized character compatibility.- Efficient string matching on coded texts.- Fast approximate matching using suffix trees.- Common subsequences and supersequences and their expected length.- Pattern matching in directed graphs.- Constant-space string matching with smaller number of comparisons: sequential sampling.- Multi-dimensional pattern matching with dimensional wildcards.- Minimizing phylogenetic number to find good evolutionary trees.- Making the shortest-paths approach to sum-of-pairs multiple sequence alignment more space efficient in practice.- An efficient algorithm for developing topologically valid matchings.- Polynomial-time algorithm for computing translocation distance between genomes.- On the complexity of comparing evolutionary trees.- Suffix cactus: A cross between suffix tree and suffix array.- Pattern-matching for strings with short descriptions.- Pairwise alignment with scoring on tuples.- Matching a set of strings with variable length don't cares.- Three-dimensional pattern matching in protein structure analysis.- Genome analysis: Pattern search in biological macromolecules.- Matching patterns of an automaton.- New results and open problems related to non-standard stringology.- String matching in hypertext.- Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree.- A new flexible algorithm for the longest common subsequence problem.- Smaller representations for finite-state transducers and finite-state automata.- Multiple sequence comparison: A peptide matching approach.- On a technique for parsing a string.- Dictionary look-up with small errors.- On the editing distance between undirected acyclic graphs and related problems.