Volume 56,
Numbers 1-2,
2003
Special Issue:
Computing Patterns in Strings
- Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq:
Occurrence and Substring Heuristics for i-Matching.
1-21
Electronic Edition (link) BibTeX
- Josué Kuri, Gonzalo Navarro, Ludovic Mé:
Fast Multipattern Search Algorithms for Intrusion Detection.
23-49
Electronic Edition (link) BibTeX
- Stefan Burkhardt, Juha Kärkkäinen:
Better Filtering with Gapped q-Grams.
51-70
Electronic Edition (link) BibTeX
- Pierre Nicodème:
Regexpcount, a symbolic package for counting problems on regular expressions and words.
71-88
Electronic Edition (link) BibTeX
- Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon:
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
89-103
Electronic Edition (link) BibTeX
- Jesper Jansson, Andrzej Lingas:
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.
105-120
Electronic Edition (link) BibTeX
- Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi:
Computing forbidden words of regular languages.
121-135
Electronic Edition (link) BibTeX
- Leszek Gasieniec, Igor Potapov:
Time/Space Efficient Compressed Pattern Matching.
137-154
Electronic Edition (link) BibTeX
- Foto N. Afrati, Hans Leiß, Michel de Rougemont:
Definability and Compression.
155-180
Electronic Edition (link) BibTeX
- Inbok Lee, Kunsoo Park, Yanghee Choi:
A Simple and Scalable Algorithm for the IP Address Lookup Problem.
181-190
Electronic Edition (link) BibTeX
- Veli Mäkinen:
Compact Suffix Array -- A Space-Efficient Full-Text Index.
191-210
Electronic Edition (link) BibTeX
Volume 56,
Number 3,
2003
Volume 56,
Number 4,
2003
Copyright © Sat May 16 23:59:25 2009
by Michael Ley (ley@uni-trier.de)
