The Prague Stringology Club Workshop 2000

The Prague Stringology Club Workshop 2000 was held in Bratislava, Slovak Republic, as the attached workshop of 25thInternational Symposium on Mathematical Foundations of Computer Science (MFCS) on September 2, 2000. Acting language was English. The papers of PSCW 2000 were published in proceedings.

The following papers were accepted to the PSCW 2000:

Published Regular Contributions
Gabriela Andrejková The Set-Set Closest Common Subsequence Problem
Miroslav Balík Condensation Principle
Jiří Dvorský and Václav Snášel Word-based Compression Method with Direct Access
Frantisek Franek, Weilin Lu and William F. Smyth Repetitions in two-pattern strings
Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard and Yoan Pinzón Computing Approximate Repetitions in Musical Sequences
Winfried Just and Gianluca Della Vedova Multiple Sequence Alignment as a Facility Location Problem
Bruce W. Watson A new family of Commentz-Walter-style multiple-keyword pattern matching algorithms

Organization of the PSCW 2000

Chair: Bořivoj Melichar
Program Committee: Gabriela Andrejková, 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