Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1448

• A fast bit-vector algorithm for approximate string matching based on dynamic programming
  Gene Myers
  Lecture Notes in Computer Science 1448, 1998, pp. 1-13
• A bit-parallel approach to suffix automata: Fast extended string matching
  Gonzalo Navarro, Mathieu Raffinot
  Lecture Notes in Computer Science 1448, 1998, pp. 14-33
• A dictionary matching algorithm fast on the average for terms of varying length
  Michal Ziv-Ukelson, Aaron Kershenbaum
  Lecture Notes in Computer Science 1448, 1998, pp. 34-54
• A very fast string matching algorithm for small alphabets and long patterns
  Christian Charras, Thierry Lecrog, Joseph Daniel Pehoushek
  Lecture Notes in Computer Science 1448, 1998, pp. 55-64
• Approximate word sequence matching over sparse suffix trees
  Knut Magne Risvik
  Lecture Notes in Computer Science 1448, 1998, pp. 65-79
• Efficient parallel algorithm for the editing distance between ordered trees
  Kaizhong Zhang
  Lecture Notes in Computer Science 1448, 1998, pp. 80-90
• Reporting exact and approximate regular expression matches
  Eugene W. Myers, Paulo Oliva, Katia Guimarães
  Lecture Notes in Computer Science 1448, 1998, pp. 91-103
• An approximate oracle for distance in metric spaces
  Yanling Yang, Kaizhong Zhang, Xiong Wang, Jason T.L. Wang, Dennis Shasha
  Lecture Notes in Computer Science 1448, 1998, pp. 104-117
• A rotation invariant filter for two-dimensional string matching
  Kimmo Fredriksson, Esko Ukkonen
  Lecture Notes in Computer Science 1448, 1998, pp. 118-125
• Constructing suffix arrays for multi-dimensional matrices
  Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park
  Lecture Notes in Computer Science 1448, 1998, pp. 126-139
• Simple and flexible detection of contiguous repeats using a suffix tree, preliminary version
  Jens Stoye, Dan Gusfield
  Lecture Notes in Computer Science 1448, 1998, pp. 140-152
• Comparison of coding DNA
  Christian N.S. Pedersen, Rune Lyngs, Jotun Hein
  Lecture Notes in Computer Science 1448, 1998, pp. 153-173
• Fixed topology alignment with recombination
  Bin Mal, Lusheng Wang, Ming Li
  Lecture Notes in Computer Science 1448, 1998, pp. 174-188
• Aligning alignments
  John D. Kececioglu, Weiqing Zhang
  Lecture Notes in Computer Science 1448, 1998, pp. 189-208
• Efficient special cases of pattern matching with swaps
  Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
  Lecture Notes in Computer Science 1448, 1998, pp. 209-220
• Aligning DNA sequences to minimize the change in protein
  Yufang Hua, Tao Jiang, Bin Wu
  Lecture Notes in Computer Science 1448, 1998, pp. 221-234
• Genome halving
  Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff
  Lecture Notes in Computer Science 1448, 1998, pp. 235-250