Format:
Online-Ressource (VIII, 273 pp, digital)
ISBN:
9783540481942
Series Statement:
Lecture Notes in Computer Science 2089
Content:
Regular Expression Searching over Ziv-Lempel Compressed Text -- Parallel Lempel Ziv Coding (Extended Abstract) -- Approximate Matching of Run-Length Compressed Strings -- What to Do with All this Hardware? (Invited Lecture) -- Efficient Experimental String Matching by Weak Factor Recognition* -- Better Filtering with Gapped q-Grams -- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) -- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) -- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory -- Tandem Cyclic Alignment -- An Output-Sensitive Flexible Pattern Discovery Algorithm -- Episode Matching* -- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music -- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) -- Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time -- On-Line Construction of Compact Directed Acyclic Word Graphs* -- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications -- Multiple Pattern Matching Algorithms on Collage System -- Finding All Common Intervals of k Permutations -- Generalized Pattern Matching and the Complexity of Unavoidability Testing -- Balanced Suffix Trees (Invited Lecture) -- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees -- Minimum Quartet Inconsistency Is Fixed Parameter Tractable -- Optimally Compact Finite Sphere Packings — Hydrophobic Cores in the FCC.
Note:
Includes bibliographical references and index
Additional Edition:
ISBN 9783540422716
Additional Edition:
Buchausg. u.d.T. Combinatorial pattern matching Berlin [u.a.] : Springer, 2001 ISBN 3540422714
Language:
English
Keywords:
Mustervergleich
;
Mustervergleich
;
Konferenzschrift
DOI:
10.1007/3-540-48194-X
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
