Volume 10,
Number 1,
2005
Volume 10,
Number 2/3,
2005
Selected Papers of the Workshop Weighted Automata:
Theory and Applications (Dresden,
Germany,
June 1-5,
2004)
Volume 10,
Number 4,
2005
Volume 10,
Number 5/6,
2005
Special Issue:
Selected Papers of the Prague Stringology Conference (Czech Technical University in Prague,
Czech Republic,
September 22-24,
2003)
- Behshad Behzadi, Jean-Marc Steyaert:
The Transformation Distance Problem Revisited.
577-587 BibTeX
- Domenico Cantone, Simone Faro:
Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm.
589-608 BibTeX
- Manolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim:
Approximate Seeds of Strings.
609-626 BibTeX
- Loek G. Cleophas, Gerard Zwaan, Bruce W. Watson:
Constructing Factor Oracles.
627-640 BibTeX
- Richard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, L. Yang:
The Complexity of the Minimum k-Cover Problem.
641-653 BibTeX
- Abolfazl Fatholahzadeh:
Learning the Morphological Features of a Large Set of Words.
655-669 BibTeX
- Richard Groult, Martine Léonard, Laurent Mouchard:
A Linear Algorithm for the Detection of Evolutive Tandem Repeats.
671-685 BibTeX
- Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis:
Computing the Repetitions in a Biological Weighted Sequence.
687-696 BibTeX
- Tetsuya Nakatoh, Kensuke Baba, Daisuke Ikeda, Yasuhiro Yamada, Sachio Hirokawa:
An Efficient Mapping for Computing the Score of String Matching.
697-704 BibTeX
Copyright © Sun May 17 00:06:14 2009
by Michael Ley (ley@uni-trier.de)