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 [1]	Hilfe

Suche: Series=LNCS AND Volume=1848

• Compact suffix array
  Veli Mäkinen
  Lecture Notes in Computer Science 1848, 2000, pp. 305-319
• Linear bidirectional on-line construction of affix trees
  Moritz G. Maaß
  Lecture Notes in Computer Science 1848, 2000, pp. 320-334
• Using suffix trees for gapped motif discovery
  Emily Rocke
  Lecture Notes in Computer Science 1848, 2000, pp. 335-349
• Indexing text with approximate q-grams
  Gonzalo Navarro, Erkki Sutinen, Jani Tanninen, Jorma Tarhio
  Lecture Notes in Computer Science 1848, 2000, pp. 350-363
• Simple optimal string matching algorithm
  Cyril Allauzen, Mathieu Raffinot
  Lecture Notes in Computer Science 1848, 2000, pp. 364-374
• Exact and efficient computation of the expected number of missing and common words in random texts
  Sven Rahmann, Eric Rivals
  Lecture Notes in Computer Science 1848, 2000, pp. 375-387
• Periods and quasiperiods characterization
  Mireille Régnier, Laurent Mouchard
  Lecture Notes in Computer Science 1848, 2000, pp. 388-396
• Finding maximal quasiperiodicities in strings
  Gerth Stlting Brodal, Christian N.S. Pedersen
  Lecture Notes in Computer Science 1848, 2000, pp. 397-411
• On the complexity of determining the period of a string
  Artur Czumaj, Leszek Ga̧sieniec
  Lecture Notes in Computer Science 1848, 2000, pp. 412-422