PSC 2003 Photos

The Prague Stringology Conference 2003

The Prague Stringology Conference '03 was held at the Department of Computer Science and Engineering of Czech Technical University in Prague on September 22-24, 2003. Acting language was English. Papers of PSC 2003 were published in proceedings.

The following papers were accepted to the PSC 2003:

Published Regular Contributions
Behshad Behzadi and Jean-Marc Steyaert The Transformation Distance Problem Revisited
Bořivoj Melichar and Milan Šimánek Operation L-INSERT on Factor Automaton
Tetsuya Nakatoh, Kensuke Baba, Daisuke Ikeda, Yasuhiro Yamada and Sachio Hirokawa An Efficient Mapping for Score of String Matching
Domenico Cantone and Simone Faro Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm
Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park and Jeong Seop Sim Approximate Seeds of Strings
Loek Cleophas, Gerard Zwaan and Bruce W. Watson Constructing Factor Oracles
Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth and Lu Yang Computing the Minimum k-Cover of a String
Abolfazl Fatholahzadeh Learning the Morphological Features of a Large Set of Words
Richard Groult, Martine Léonard and Laurent Mouchard A Linear Algorithm for the Detection of Evolutive Tandem Repeats
Costas S. Iliopoulos, Laurent Mouchard, Katerina G. Perdikuri and Athanasios K. Tsakalidis Computing the Repetitions in a Weighted Sequence
Veli Makinen, Gonzalo Navarro and Esko Ukkonen Matching Numeric Strings under Noise

Download proceedings: PSC2003.pdf
 PostScript   PDF 

Organization of the PSC 2003

Chair: Bořivoj Melichar
Program Committee: Gabriela Andrejková, Jun-ichi Aoe, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Thierry Lecroq, Bořivoj Melichar, Bruce W. Watson and Geraint Wiggins
Organizing Committee: Miroslav Balík, Jan Holub, Bořivoj Melichar and Milan Šimánek