Abstract is missing.
- Regular Expression Searching over Ziv-Lempel Compressed TextGonzalo Navarro. 1-17 [doi]
- Parallel Lempel Ziv CodingShmuel Tomi Klein, Yair Wiseman. 18-30 [doi]
- Approximate Matching of Run-Length Compressed StringsVeli Mäkinen, Gonzalo Navarro, Esko Ukkonen. 31-49 [doi]
- What to Do with All this Hardware? (Invited Lecture)Uzi Vishkin. 50 [doi]
- Efficient Experimental String Matching by Weak Factor RecognitionCyril Allauzen, Maxime Crochemore, Mathieu Raffinot. 51-72 [doi]
- Better Filtering with Gapped q-GramsStefan Burkhardt, Juha Kärkkäinen. 73-85 [doi]
- Fuzzy Hamming Distance: A New Dissimilarity MeasureAbraham Bookstein, Shmuel T. Klein, Timo Raita. 86-97 [doi]
- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture)Aviezri S. Fraenkel, Jamie Simpson. 98-105 [doi]
- A Very Elementary Presentation of the Hannenhalli-Pevzner TheoryAnne Bergeron. 106-117 [doi]
- Tandem Cyclic AlignmentGary Benson. 118-130 [doi]
- An Output-Sensitive Flexible Pattern Discovery AlgorithmLaxmi Parida, Isidore Rigoutsos, Daniel E. Platt. 131-142 [doi]
- Episode MatchingZdenek Tronícek. 143-146 [doi]
- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and MusicMasayuki Takeda. 147-151 [doi]
- Efficient Discovery of Proximity Patterns with Suffix ArraysHiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa. 152-156 [doi]
- Computing the Equation Automaton of a Regular Expression in Space and TimeJean-Marc Champarnaud, Djelloul Ziadi. 157-168 [doi]
- On-Line Construction of Compact Directed Acyclic Word GraphsShunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi. 169-180 [doi]
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its ApplicationsToru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park. 181-192 [doi]
- Multiple Pattern Matching Algorithms on Collage SystemTakuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa. 193-206 [doi]
- Finding All Common Intervals of k PermutationsSteffen Heber, Jens Stoye. 207-218 [doi]
- Generalized Pattern Matching and the Complexity of Unavoidability TestingChristine E. Heitsch. 219-230 [doi]
- Balanced Suffix Trees (Invited Lecture)S. Rao Kosaraju. 231 [doi]
- A Fast Algorithm for Optimal Alignment between Similar Ordered TreesJesper Jansson, Andrzej Lingas. 232-240 [doi]
- Minimum Quartet Inconsistency Is Fixed Parameter TractableJens Gramm, Rolf Niedermeier. 241-256 [doi]
- Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCCRolf Backofen, Sebastian Will. 257-272 [doi]