CPM 2001: Jerusalem, Israel
Amihood Amir, Gad M. Landau (Eds.): Lecture Notes in Computer Science 2089, Springer 2001.
- Gonzalo Navarro:
Regular Expression Searching over Ziv-Lempel Compressed Text.
1-17
download paper
- Shmuel T. Klein, Yair Wiseman:
Parallel Lempel Ziv Coding.
18-30
download paper
- Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen:
Approximate Matching of Run-Length Compressed Strings.
31-49
download paper download presentation (PPT)
- Uzi Vishkin:
What to Do with All this Hardware? (Invited Lecture).
50
download paper
- Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot:
Efficient Experimental String Matching by Weak Factor Recognition.
51-72
download paper
- Stefan Burkhardt, Juha Kärkkäinen:
Better Filtering with Gapped q-Grams.
73-85
download paper
- Abraham Bookstein, Shmuel T. Klein, Timo Raita:
Fuzzy Hamming Distance: A New Dissimilarity Measure.
86-97
download paper
- Aviezri S. Fraenkel, Jamie Simpson:
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture).
98-105
download paper
- Anne Bergeron:
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory.
106-117
download paper
- Gary Benson:
Tandem Cyclic Alignment.
118-130
download paper
- Laxmi Parida, Isidore Rigoutsos, Daniel E. Platt:
An Output-Sensitive Flexible Pattern Discovery Algorithm.
131-142
download paper
- Zdenek Tronícek:
Episode Matching.
143-146
download paper
- Masayuki Takeda:
String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music.
147-151
download paper
- Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa:
Efficient Discovery of Proximity Patterns with Suffix Arrays.
152-156
download paper
- Jean-Marc Champarnaud, Djelloul Ziadi:
Computing the Equation Automaton of a Regular Expression in Space and Time.
157-168
download paper
- Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi:
On-Line Construction of Compact Directed Acyclic Word Graphs.
169-180
download paper download presentation (PPT)
- Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park:
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications.
181-192
download paper
- Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Multiple Pattern Matching Algorithms on Collage System.
193-206
download paper
- Steffen Heber, Jens Stoye:
Finding All Common Intervals of k Permutations.
207-218
download paper
- Christine E. Heitsch:
Generalized Pattern Matching and the Complexity of Unavoidability Testing.
219-230
download paper
- S. Rao Kosaraju:
Balanced Suffix Trees (Invited Lecture).
231
download paper
- Jesper Jansson, Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.
232-240
download paper
- Jens Gramm, Rolf Niedermeier:
Minimum Quartet Inconsistency Is Fixed Parameter Tractable.
241-256
download paper
- Rolf Backofen, Sebastian Will:
Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC.
257-272
download paper