Abstract is missing.
- The Transformation Distance Problem RevisitedBehshad Behzadi, Jean-Marc Steyaert. 1-9 [doi]
- Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching AlgorithmDomenico Cantone, Simone Faro. 10-24 [doi]
- Approximate Seeds of StringsManolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim. 25-36 [doi]
- Constructing Factor OraclesLoek G. Cleophas, Gerard Zwaan, Bruce W. Watson. 37-50 [doi]
- Computing the Minimum k-Cover of a StringRichard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, Lu Yang. 51-64 [doi]
- Learning the Morphological Features of a Large Set of WordsAbolfazl Fatholahzadeh. 65-76 [doi]
- A Linear Algorithm for the Detection of Evolutive Tandem RepeatsRichard Groult, Martine Léonard, Laurent Mouchard. 77-90 [doi]
- Computing the Repetitions in a Weighted SequenceCostas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis. 91-98 [doi]
- Matching Numeric Strings under NoiseVeli Mäkinen, Gonzalo Navarro, Esko Ukkonen. 99-110 [doi]
- Operation L-INSERT on Factor AutomatonBorivoj Melichar, Milan Simánek. 111-126 [doi]
- An Efficient Mapping for Score of String MatchingTetsuya Nakatoh, Kensuke Baba, Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa. 127-136 [doi]