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

• Identifying and filtering near-duplicate documents
  Andrei Z. Broder
  Lecture Notes in Computer Science 1848, 2000, pp. 1-10
• Machine learning for efficient natural-language processing
  Fernando Pereira
  Lecture Notes in Computer Science 1848, 2000, pp. 11-11
• Browsing around a digital library: Today and tomorrow
  Ian H. Witten
  Lecture Notes in Computer Science 1848, 2000, pp. 12-26
• Algorithmic aspects of speech recognition: A synopsis
  Adam L. Buchsbaum, Raffaele Giancarlo
  Lecture Notes in Computer Science 1848, 2000, pp. 27-32
• Some results on flexible-pattern discovery
  Laxmi Parida
  Lecture Notes in Computer Science 1848, 2000, pp. 33-45
• Explaining and controlling ambiguity in dynamic programming
  Robert Giegerich
  Lecture Notes in Computer Science 1848, 2000, pp. 46-59
• A dynamic edit distance table
  Sung-Ryul Kim, Kunsoo Park
  Lecture Notes in Computer Science 1848, 2000, pp. 60-68
• Parametric multiple sequence alignment and phylogeny construction
  David Fernández-Baca, Timo Seppäläinen, Giora Slutzki
  Lecture Notes in Computer Science 1848, 2000, pp. 69-83
• Tsukuba BB: A branch and bound algorithm for local multiple sequence alignment
  Paul Horton
  Lecture Notes in Computer Science 1848, 2000, pp. 84-98
• A polynomial time approximation scheme for the closest substring problem
  Bin Ma
  Lecture Notes in Computer Science 1848, 2000, pp. 99-107
• Approximation algorithms for Hamming clustering problems
  Leszek Ga̧sieniec, Jesper Jansson, Andrzej Lingas
  Lecture Notes in Computer Science 1848, 2000, pp. 108-118
• Approximating the maximum isomorphic agreement subtree is hard
  Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri
  Lecture Notes in Computer Science 1848, 2000, pp. 119-128
• A faster and unifying algorithm for comparing trees
  Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung, Hing-Fung Ting
  Lecture Notes in Computer Science 1848, 2000, pp. 129-142
• Incomplete directed perfect phylogeny
  Itsik Pe'er, Ron Shamir, Roded Sharan
  Lecture Notes in Computer Science 1848, 2000, pp. 143-153
• The longest common subsequence problem for arc-annotated sequences
  Tao Jiang, Guo-Hui Lin, Bin Ma, Kaizhong Zhang
  Lecture Notes in Computer Science 1848, 2000, pp. 154-165
• Boyer-Moore string matching over Ziv-Lempel compressed text
  Gonzalo Navarro, Jorma Tarhio
  Lecture Notes in Computer Science 1848, 2000, pp. 166-180
• A Boyer-Moore type algorithm for compressed pattern matching
  Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
  Lecture Notes in Computer Science 1848, 2000, pp. 181-194
• Approximate string matching over Ziv-Lempel compressed text
  Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen
  Lecture Notes in Computer Science 1848, 2000, pp. 195-209
• Improving static compression schemes by alphabet extension
  Shmuel T. Klein
  Lecture Notes in Computer Science 1848, 2000, pp. 210-221
• Genome rearrangement by reversals and insertions/deletions of contiguous segments
  Nadia El-Mabrouk
  Lecture Notes in Computer Science 1848, 2000, pp. 222-234
• A lower bound for the breakpoint phylogeny problem
  David Bryant
  Lecture Notes in Computer Science 1848, 2000, pp. 235-247
• Structural properties and tractability results for linear synteny
  David Liben-Nowell, Jon Kleinberg
  Lecture Notes in Computer Science 1848, 2000, pp. 248-263
• Shift error detection in standardized exams
  Steven Skiena, Pavel Sumazin
  Lecture Notes in Computer Science 1848, 2000, pp. 264-276
• An upper bound for number of contacts in the HP-model on the Face-Centered-Cubic lattice (FCC)
  Rolf Backofen
  Lecture Notes in Computer Science 1848, 2000, pp. 277-292
• The combinatorial partitioning method
  Matthew R. Nelson, Sharon L. Kardia, Charles F. Sing
  Lecture Notes in Computer Science 1848, 2000, pp. 293-304