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=3109

• Quadratic time algorithms for finding common intervals in two and more sequences
  Thomas Schmidt, Jens Stoye
  Lecture Notes in Computer Science 3109, 2004, pp. 347-358
• Maximal common connected sets of interval graphs
  Michel Habib, Christophe Paul, Mathieu Raffinot
  Lecture Notes in Computer Science 3109, 2004, pp. 359-372
• Performing local similarity searches with variable length seeds
  Miklós Csŭrös
  Lecture Notes in Computer Science 3109, 2004, pp. 373-387
• Reversal distance without hurdles and fortresses
  Anne Bergeron, Julia Mixtacki, Jens Stoye
  Lecture Notes in Computer Science 3109, 2004, pp. 388-399
• A fast set intersection algorithm for sorted sequences
  Ricardo Baeza-Yates
  Lecture Notes in Computer Science 3109, 2004, pp. 400-408
• Faster two dimensional pattern matching with rotations
  Amihood Amir, Oren Kapah, Dekel Tsur
  Lecture Notes in Computer Science 3109, 2004, pp. 409-419
• Compressed compact suffix arrays
  Veli Mäkinen, Gonzalo Navarro
  Lecture Notes in Computer Science 3109, 2004, pp. 420-433
• Approximate string matching using compressed suffix arrays
  Trinh N.D. Huynh, Wing-Kai Hon, Tak-Wah Lam, Wing-Kin Sung
  Lecture Notes in Computer Science 3109, 2004, pp. 434-444
• Compressed index for a dynamic collection of texts
  Ho-Leung Chan, Wing-Kai Hon, Tak-Wah Lam
  Lecture Notes in Computer Science 3109, 2004, pp. 445-456
• Improved single and multiple approximate string matching
  Kimmo Fredriksson, Gonzalo Navarro
  Lecture Notes in Computer Science 3109, 2004, pp. 457-471
• Average-case analysis of approximate trie search
  Moritz G. Maaß
  Lecture Notes in Computer Science 3109, 2004, pp. 472-483