Combinatorial Pattern Matching : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1 4, 2001 Proceedings
Uloženo v:
| Hlavní autor: | |
|---|---|
| Korporativní autor: | |
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
2089 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Combinatorial pattern matching, 12th annual symposium, CPM 2001, Jerusalem, Israel, July 1-4, 2001, proceedings, Amihood Amir, Gad M. Landau (eds.), 2001, Berlin, Springer, 1 vol. (VIII-271 p.), Lecture notes in computer science, 3-540-42271-4 • Combinatorial Pattern Matching, Texte imprimé, 9783540829430 |
Obsah:
- 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.