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

• Multiple genome alignment: Chaining algorithms revisited
  Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
  Lecture Notes in Computer Science 2676, 2003, pp. 1-16
• Two-dimensional pattern matching with rotations
  Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps
  Lecture Notes in Computer Science 2676, 2003, pp. 17-31
• An improved algorithm for generalized comparison of minisatellites
  Behshad Behzadi, Jean-Marc Steyaert
  Lecture Notes in Computer Science 2676, 2003, pp. 32-41
• Optimal spaced seeds for hidden Markov models, with application to homologous coding regions
  Bron̑a Brejová, Daniel G. Brown, Tomás̑ Vinaȓ
  Lecture Notes in Computer Science 2676, 2003, pp. 42-54
• Fast lightweight suffix array construction and checking
  Stefan Burkhardt, Juha Kärkkäinen
  Lecture Notes in Computer Science 2676, 2003, pp. 55-69
• Distributed and paged suffix trees for large genetic databases
  Raphaël Clifford, Marek Sergot
  Lecture Notes in Computer Science 2676, 2003, pp. 70-82
• Analysis of tree edit distance algorithms
  Serge Dulucq, Hélène Touzet
  Lecture Notes in Computer Science 2676, 2003, pp. 83-95
• An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees
  Olivier Elemento, Olivier Gascuel
  Lecture Notes in Computer Science 2676, 2003, pp. 96-108
• Average-optimal multiple approximate string matching
  Kimmo Fredriksson, Gonzalo Navarro
  Lecture Notes in Computer Science 2676, 2003, pp. 109-128
• Optimal partitions of strings: A new class of Burrows-Wheeler compression algorithms
  Raffaele Giancarlo, Marinella Sciortino
  Lecture Notes in Computer Science 2676, 2003, pp. 129-143
• Haplotype inference by pure parsimony
  Dan Gusfield
  Lecture Notes in Computer Science 2676, 2003, pp. 144-155
• A simpler 1.5-approximation algorithm for sorting by transpositions
  Tzvika Hartman
  Lecture Notes in Computer Science 2676, 2003, pp. 156-169
• Efficient data structures and a new randomized approach for sorting signed permutations by reversals
  Haim Kaplan, Elad Verbin
  Lecture Notes in Computer Science 2676, 2003, pp. 170-185
• Linear-time construction of suffix arrays
  Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park
  Lecture Notes in Computer Science 2676, 2003, pp. 186-199
• Space efficient linear time construction of suffix arrays
  Pang Ko, Srinivas Aluru
  Lecture Notes in Computer Science 2676, 2003, pp. 200-210
• Tuning string matching for huge pattern sets
  Jari Kytöjoki, Leena Salmela, Jorma Tarhio
  Lecture Notes in Computer Science 2676, 2003, pp. 211-224
• Sparse LCS common substring alignment
  Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson
  Lecture Notes in Computer Science 2676, 2003, pp. 225-236
• On minimizing pattern splitting in multi-track string matching
  Kjell Lemström, Veli Mäkinen
  Lecture Notes in Computer Science 2676, 2003, pp. 237-253
• Alignment between two multiple alignments
  Bin Ma, Zhuozhi Wang, Kaizhong Zhang
  Lecture Notes in Computer Science 2676, 2003, pp. 254-265
• An effective algorithm for the peptide De Novo sequencing from MS/MS spectrum
  Bin Ma, Kaizhong Zhang, Chengzhi Liang
  Lecture Notes in Computer Science 2676, 2003, pp. 266-277
• Pattern discovery in RNA secondary structure using affix trees
  Giancarlo Mauri, Giulio Pavesi
  Lecture Notes in Computer Science 2676, 2003, pp. 278-294
• More efficient left-to-right pattern matching in non-sequential equational programs
  Nadia Nedjah, Luiza de Macedo Mourelle
  Lecture Notes in Computer Science 2676, 2003, pp. 295-314
• Complexities of the centre and median string problems
  François Nicolas, Eric Rivals
  Lecture Notes in Computer Science 2676, 2003, pp. 315-327
• Extracting approximate patterns
  Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre
  Lecture Notes in Computer Science 2676, 2003, pp. 328-347
• A fully linear-time approximation algorithm for grammar-based compression
  Hiroshi Sakamoto
  Lecture Notes in Computer Science 2676, 2003, pp. 348-360