The Prague Stringology Club Workshop '99

The Prague Stringology Club Workshop '99 was held at Department of Computer Science and Engineering of Czech Technical University in Prague on July 8-9, 1999. Topics of the workshop were stringology (a computer science on strings and sequences) by finite automata, its applications in information retrieval, pattern matching, molecular biology, text searching and other related areas. Papers of PSCW'99 were published in proceedings.

The following papers were accepted to the PSCW '99:

Published Regular Contributions
Gabriela Andrejková The Closest Common Subsequence Problems
Thomas Berry and S. Ravindran A Fast String Matching Algorithm and Experimental Results
Weiler A. Finamore, Rafael D. de Azevedo and Marcelo da Silva Pinho On Procedures for Multiple-string Match with Respect to Two Sets
H. Goeman and M. Clausen A New Practical Linear Space Algorithm for the Longest Common Subsequence Problem
Fei Shi and Dong-Guk Shin Centroid Trees with Application to String Processing

Download proceedings: PSC1999.pdf
 PostScript   PDF 

Organization of the PSCW '99

Chair: Bořivoj Melichar
Program Committee: Gabriela Andrejková, Jun-ichi Aoe, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Thierry Lecroq, Bořivoj Melichar and Bruce W. Watson
Organizing Committee: Miroslav Balík, Martin Bloch, Jan Holub, Martin Rýzl, Milan Šimánek and Zdeněk Troníček