Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=2089

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Regular expression searching over Ziv-Lempel compressed text
Gonzalo Navarro
Lecture Notes in Computer Science 2089, 2001, pp. 1-17
Parallel Lempel Ziv coding
Shmuel Tomi Klein, Yair Wiseman
Lecture Notes in Computer Science 2089, 2001, pp. 18-30
Approximate matching of run-length compressed strings
Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
Lecture Notes in Computer Science 2089, 2001, pp. 31-49
What to do with all this hardware?
Uzi Vishkin
Lecture Notes in Computer Science 2089, 2001, pp. 50-50
Efficient experimental string matching by weak factor recognition
Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot
Lecture Notes in Computer Science 2089, 2001, pp. 51-72
Better filtering with gapped q-grams
Stefan Burkhardt, Juha Kärkkäinen
Lecture Notes in Computer Science 2089, 2001, pp. 73-85
Fuzzy Hamming distance: A new dissimilarity measure
Abraham Bookstein, Shmuel Tomi Klein, Timo Raita
Lecture Notes in Computer Science 2089, 2001, pp. 86-97
An extension of the periodicity lemma to longer periods
Aviezri S. Fraenkel, Jamie Simpson
Lecture Notes in Computer Science 2089, 2001, pp. 98-105
A very elementary presentation of the Hannenhalli-Pevzner theory
Anne Bergeron
Lecture Notes in Computer Science 2089, 2001, pp. 106-117
Tandem cyclic alignment
Gary Benson
Lecture Notes in Computer Science 2089, 2001, pp. 118-130
An output-sensitive flexible pattern discovery algorithm
Laxmi Parida, Isidore Rigoutsos, Dan Platt
Lecture Notes in Computer Science 2089, 2001, pp. 131-142
Episode matching
Zdenȇk Troníc̑ek
Lecture Notes in Computer Science 2089, 2001, pp. 143-146
String resemblance systems: A unifying framework for string similarity with applications to literature and music
Masayuki Takeda
Lecture Notes in Computer Science 2089, 2001, pp. 147-151
Efficient discovery of proximity patterns with suffix arrays
Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa
Lecture Notes in Computer Science 2089, 2001, pp. 152-156
Computing the equation automaton of a regular expression in O(s^2) space and time
Jean-Marc Champarnaud, Djelloul Ziadi
Lecture Notes in Computer Science 2089, 2001, pp. 157-168
On-line construction of compact directed acyclic word graphs
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
Lecture Notes in Computer Science 2089, 2001, pp. 169-180
Linear-time longest-common-prefix computation in suffix arrays and its applications
Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park
Lecture Notes in Computer Science 2089, 2001, pp. 181-192
Multiple pattern matching algorithms on collage system
Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
Lecture Notes in Computer Science 2089, 2001, pp. 193-206
Finding all common intervals of k permutations
Steffen Heber, Jens Stoye
Lecture Notes in Computer Science 2089, 2001, pp. 207-218
Generalized pattern matching and the complexity of unavoidability testing
Christine E. Heitsch
Lecture Notes in Computer Science 2089, 2001, pp. 219-230
Balanced suffix trees
S. Rao Kosaraju
Lecture Notes in Computer Science 2089, 2001, pp. 231-231
A fast algorithm for optimal alignment between similar ordered trees
Jesper Jansson, Andrzej Lingas
Lecture Notes in Computer Science 2089, 2001, pp. 232-240
Minimum quartet inconsistency is fixed parameter tractable
Jens Gramm, Rolf Niedermeier
Lecture Notes in Computer Science 2089, 2001, pp. 241-256
Optimally compact finite sphere packings - Hydrophobic cores in the FCC
Rolf Backofen, Sebastian Will
Lecture Notes in Computer Science 2089, 2001, pp. 257-271