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

• Shift-and approach to pattern matching in LZW compressed text
  Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
  Lecture Notes in Computer Science 1645, 1999, pp. 1-13
• A general practical approach to pattern matching over Ziv-Lempel compressed text
  Gonzalo Navarro, Mathieu Raffinot
  Lecture Notes in Computer Science 1645, 1999, pp. 14-36
• Pattern matching in text compressed by using antidictionaries
  Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
  Lecture Notes in Computer Science 1645, 1999, pp. 37-49
• On the structure of syntenic distance
  David Liben-Nowell
  Lecture Notes in Computer Science 1645, 1999, pp. 50-65
• Physical mapping with repeated probes: The hypergraph superstring problem
  Serafim Batzoglou, Sorin Istrail
  Lecture Notes in Computer Science 1645, 1999, pp. 66-77
• Hybridization and genome rearrangement
  Nadia El-Mabrouk, David Sankoff
  Lecture Notes in Computer Science 1645, 1999, pp. 78-87
• On the complexity of positional sequencing by hybridization
  Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Sharan
  Lecture Notes in Computer Science 1645, 1999, pp. 88-100
• GESTALT: Genomic Steiner alignments
  Giuseppe Lancia, R. Ravi
  Lecture Notes in Computer Science 1645, 1999, pp. 101-114
• Bounds on the number of string subsequences
  Daniel S. Hirschberg
  Lecture Notes in Computer Science 1645, 1999, pp. 115-122
• Approximate periods of strings
  Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
  Lecture Notes in Computer Science 1645, 1999, pp. 123-133
• Finding maximal pairs with bounded gap
  Gerth Stlting Brodal, Rune B. Lyngs, Christian N.S. Pedersen, Jens Stoye
  Lecture Notes in Computer Science 1645, 1999, pp. 134-149
• A dynamic data structure for reverse lexicographically sorted prefixes
  Hidetoshi Yokoo
  Lecture Notes in Computer Science 1645, 1999, pp. 150-162
• A new indexing method for approximate string matching
  Gonzalo Navarro, Ricardo Baeza-Yates
  Lecture Notes in Computer Science 1645, 1999, pp. 163-185
• The compression of subsegments of images described by finite automata
  Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter
  Lecture Notes in Computer Science 1645, 1999, pp. 186-195
• Ziv Lempel compression of huge natural language data tries using suffix arrays
  Strahil Ristov, Eric Laporte
  Lecture Notes in Computer Science 1645, 1999, pp. 196-211
• Matching of spots in 2D electrophoresis images - Point matching under non-uniform distortions
  Tatsuya Akutsu, Kyotetsu Kanaya, Akira Ohyama, Asao Fujiyama
  Lecture Notes in Computer Science 1645, 1999, pp. 212-222
• Applying an edit distance to the matching of tree ring sequences in dendrochronology
  Carola Wenk
  Lecture Notes in Computer Science 1645, 1999, pp. 223-242
• Fast multi-dimensional approximate pattern matching
  Gonzalo Navarro, Ricardo Baeza-Yates
  Lecture Notes in Computer Science 1645, 1999, pp. 243-257
• Finding common RNA secondary structures from RNA sequences
  Zhuozhi Wang, Kaizhong Zhang
  Lecture Notes in Computer Science 1645, 1999, pp. 258-269
• Finding common subsequences with arcs and pseudoknots
  Patricia A. Evans
  Lecture Notes in Computer Science 1645, 1999, pp. 270-280
• Computing similarity between RNA structures
  Kaizhong Zhang, Lusheng Wang, Bin Ma
  Lecture Notes in Computer Science 1645, 1999, pp. 281-293