| Author | Title |
| 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 |
