Cantitate/Preț
Produs
Total produse
Vezi coșul
Combinatorial Pattern Matching de Alberto Apostolico

Combinatorial Pattern Matching

Editat de Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
en Limba Engleză Paperback – 17 dec 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;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.
Citește tot Restrânge

Preț: 32237 lei

Preț vechi: 40296 lei
-20%

Puncte Express: 484
Paperback (2) de la 32237 lei

Carte tipărită la comandă

Livrare economică 27 iulie-10 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540560241
ISBN-10: 3540560246
Pagini: 304
Ilustrații: XI, 293 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.