VOLUME 10 |
2005 |
NUMBERS 5–6 |
Special Issues with Selected and Extended Papers of the Prague Stringology Conference 2003 (PSC 2003)
Jan Holub: | |
Editorial | 575–575 |
Behshad Behzadi, Jean-Marc Steyaert: | |
The Transformation Distance Problem Revisited | 577–587 |
Domenico Cantone, Simone Faro: | |
Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm | 589–608 |
Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim: | |
Approximate Seeds of Strings | 609–626 |
Loek Cleophas, Gerard Zwaan, Bruce W. Watson: | |
Constructing Factor Oracles | 627–640 |
Richard Cole, Costas S. Iliopoulos, Manal Mohamed, W. F. Smyth, Lu Yang: | |
The Complexity of the Minimum k-cover Problem | 641–653 |
Abolfazl Fatholahzadeh: | |
Learning the Morphological Features of a Large Set of Words | 655–669 |
Richard Groult, Martine Léonard, Laurent Mouchard: | |
A Linear Algorithm for the Detection of Evolutive Tandem Repeats | 671–685 |
Costas Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios Tsakalidis: | |
Computing the Repetitions in a Biological Weighted Sequence | 687–696 |
Tetsuya Nakatoh, Kensuke Baba, Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa: | |
An Efficient Mapping for Computing the Score of String Matching | 697–704 |