Del 644 - Lecture Notes in Computer Science

Combinatorial Pattern Matching

Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings

Häftad, Engelska, 1992

Av Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber

669 kr

Beställningsvara. Skickas inom 10-15 vardagar

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

This volume contains the 22 papers accepted for presentationat the Third Annual Symposium on Combinatorial PatternMatching held April 29 to May 1, 1992, in Tucson, Arizona;it constitutes the first conference proceedings entirelydevoted to combinatorial pattern matching (CPM).CPM deals withissues of searching and matching of stringsand other more complicated patterns such as trees, regularexpressions, extended expressions, etc. in order to derivecombinatorial properties for such structures. As aninterdisciplinary field of growing interest, CPM is relatedto research in information retrieval, pattern recognition,compilers, data compression, and program analysis as well asto results, problems and methods from combinatorialmathematics and molecular biology.

Produktinformation

Utgivningsdatum1992-12-17
Mått216 x 279 x 17 mm
Vikt464 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor293
Upplaga1992
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540560241

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Kombinatorik och grafteori inom Naturvetenskap och teknik
Referensverk och tvärvetenskap inom Samhalle och politik
Diskret matematik inom Naturvetenskap och teknik
Programmeringsböcker inom Data och it
Databaser inom Data och it

Probabilistic analysis of generalized suffix trees.- A language approach to string searching evaluation.- Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm.- Fast multiple keyword searching.- Heaviest increasing/common subsequence problems.- Approximate regular expression pattern matching with concave gap penalties.- Matrix longest common subsequence problem, duality and hilbert bases.- From regular expressions to DFA's using compressed NFA's.- Identifying periodic occurrences of a template with applications to protein structure.- Edit distance for genome comparison based on non-local operations.- 3-D substructure matching in protein Molecules.- Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract).- Grammatical tree matching.- Theoretical and empirical comparisons of approximate string matching algorithms.- Fast and practical approximate string matching.- DZ A text compression algorithm for natural languages.- Multiple alignment with guaranteed error bounds and communication cost.- Two algorithms for the longest common subsequence of three (or more) strings.- Color Set Size problem with applications to string matching.- Computing display conflicts in string and circular string visualization.- Efficient randomized dictionary matching algorithms.- Dynamic dictionary matching with failure functions.