Combinatorial Pattern Matching (eBook, PDF)

12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings
Redaktion: Amir, Amihood; Landau, Gad M.

• Format: PDF

Produktbeschreibung

This book constitutes the refereed proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001, held in Jerusalem, Israel, in July 2001.The 21 revised papers presented together with one invited paper were carefully reviewed and selected from 35 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays as well as to advanced applications of CPM in areas such as the Internet, computational biology, multimedia systems, information retrieval, data compression, coding, computer vision, and pattern recognition.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 280
• Erscheinungstermin: 29. Juni 2003
• Englisch
• ISBN-13: 9783540481942
• Artikelnr.: 53105359

Inhaltsangabe

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.