Custom cover image
Custom cover image

Combinatorial Pattern Matching : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1–4, 2001 Proceedings / by Gad M. Landau; edited by Amihood Amir

Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: SpringerLink Bücher | Lecture notes in computer science ; 2089Publisher: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2006Description: Online-Ressource (VIII, 273 pp, digital)ISBN:
  • 9783540481942
Subject(s): Genre/Form: Additional physical formats: 9783540422716 | Buchausg. u.d.T.: Combinatorial pattern matching. Berlin [u.a.] : Springer, 2001. VIII, 271 S.DDC classification:
  • 005.1
  • 006.4015116
  • 006.4 23
MSC: MSC: *00B25 | 68-06LOC classification:
  • QA76.9.A43
DOI: DOI: 10.1007/3-540-48194-XOnline resources: Summary: 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.PPN: PPN: 1646448162Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-BAE | ZDB-2-LNC | ZDB-2-SCS | ZDB-2-SXCS | ZDB-2-SEB
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT