Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Combinatorial Pattern Matching

Third Annual Symposium, Tucson, Arizona, USA, April 29 - May 1, 1992. Proceedings
BuchKartoniert, Paperback
293 Seiten
Englisch
Springererschienen am17.12.1992
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;mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR50,28
BuchKartoniert, Paperback
EUR53,49

Produkt

KlappentextThis 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;
Details
ISBN/GTIN978-3-540-56024-1
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr1992
Erscheinungsdatum17.12.1992
ReiheLecture Notes in Computer Science
Seiten293 Seiten
SpracheEnglisch
Gewicht462 g
IllustrationenXI, 293 p.
Artikel-Nr.10744799

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr

Schlagworte