Abstract is missing.
- A taxonomy of suffix array construction algorithmsSimon J. Puglisi, William F. Smyth, Andrew Turpin. 1-30
- Asynchronous pattern matching - MetricsAmihood Amir. 31-36
- From suffix trees to suffix vectorsÉlise Prieur, Thierry Lecroq. 37-53
- Reconstructing a suffix arrayFrantisek Franek, William F. Smyth. 54-68
- Reordering finite automata states for fast string recognitionErnest Ketcha Ngassam, Derrick G. Kourie, Bruce W. Watson. 69-80
- Backward pattern matching automatonJan Antos, Borivoj Melichar. 81-94
- Bit-parallel computation of local similarity score matrices with unitary weightsHeikki Hyyrö, Gonzalo Navarro. 95-108
- A space efficient bit-parallel algorithm for the multiple string matching problemDomenico Cantone, Simone Faro. 109-124
- Compressed pattern matching in JPEG imagesShmuel Tomi Klein, Dana Shapira. 125-134
- Bounded size dictionary compression: Relaxing the LRU deletion heuristicSergio De Agostino. 135-142
- Context-dependent stopper encodingJussi Rautio. 143-152
- General pattern matching on regular collage systemJan Lahoda, Borivoj Melichar. 153-162
- Alphabets in generic programmingJuha Kärkkäinen. 163-173
- Flexible music retrieval in sublinear timeKimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro. 174-189
- Approximation algorithm for the cyclic swap problemYoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed. 190-200
- Incremental string correction: Towards correction of XML documentsAhmed Cheriat, Agata Savary, Béatrice Bouchou, Mirian Halfeld Ferrari Alves. 201-215
- A missing link in root-to-frontier tree pattern matchingLoek G. Cleophas, Kees Hemerik, Gerard Zwaan. 216-230
- A simple alphabet-independent FM-indexSzymon Grabowski, Veli Mäkinen, Gonzalo Navarro, Alejandro Salinger. 231-245