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

• A simpler analysis of Burrows-Wheeler based compression
  Haim Kaplan, Shir Landau, Elad Verbin
  Lecture Notes in Computer Science 4009, 2006, pp. 282-293
• Statistical encoding of succinct data structures
  Rodrigo González, Gonzalo Navarro
  Lecture Notes in Computer Science 4009, 2006, pp. 294-305
• Dynamic entropy-compressed sequences and full-text indexes
  Veli Mäkinen, Gonzalo Navarro
  Lecture Notes in Computer Science 4009, 2006, pp. 306-317
• Reducing the space requirement of LZ-index
  Diego Arroyuelo, Gonzalo Navarro, Kunihiko Sadakane
  Lecture Notes in Computer Science 4009, 2006, pp. 318-329
• Faster algorithms for computing longest common increasing subsequences
  Gerth Stlting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz
  Lecture Notes in Computer Science 4009, 2006, pp. 330-341
• New algorithms for text fingerprinting
  Roman Kolpakov, Mathieu Raffinot
  Lecture Notes in Computer Science 4009, 2006, pp. 342-353
• Sublinear algorithms for parameterized matching
  Leena Salmela, Jorma Tarhio
  Lecture Notes in Computer Science 4009, 2006, pp. 354-364
• Approximate matching in weighted sequences
  Amihood Amir, Costas Iliopoulos, Oren Kapah, Ely Porat
  Lecture Notes in Computer Science 4009, 2006, pp. 365-376
• Algorithms for finding a most similar subforest
  Jesper Jansson, Zeshan Peng
  Lecture Notes in Computer Science 4009, 2006, pp. 377-388
• Efficient algorithms for regular expression constrained sequence alignment
  Yun-Sheng Chung, Chin Lung Lu, Chuan Yi Tang
  Lecture Notes in Computer Science 4009, 2006, pp. 389-400
• Large scale matching for position weight matrices
  Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré
  Lecture Notes in Computer Science 4009, 2006, pp. 401-412