Combinatorial Pattern Matching 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings /
| Συγγραφή απο Οργανισμό/Αρχή: | |
|---|---|
| Άλλοι συγγραφείς: | , |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2001.
|
| Έκδοση: | 1st ed. 2001. |
| Σειρά: | Lecture Notes in Computer Science,
2089 |
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.
