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

• Practical software for aligning ESTs to human genome
  Jun Ogasawara, Shinichi Morishita
  Lecture Notes in Computer Science 2373, 2002, pp. 1-16
• Efficient text mining with optimized pattern discovery
  Hiroki Arimura
  Lecture Notes in Computer Science 2373, 2002, pp. 17-19
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression
  Wojciech Rytter
  Lecture Notes in Computer Science 2373, 2002, pp. 20-31
• Block merging for off-line compression
  Raymond Wan, Alistair Moffat
  Lecture Notes in Computer Science 2373, 2002, pp. 32-41
• String matching with stopper encoding and code splitting
  Jussi Rautio, Jani Tanninen, Jorma Tarhio
  Lecture Notes in Computer Science 2373, 2002, pp. 42-52
• Pattern matching problems over 2-interval sets
  Stéphane Vialette
  Lecture Notes in Computer Science 2373, 2002, pp. 53-63
• The problem of context sensitive string matching
  Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy
  Lecture Notes in Computer Science 2373, 2002, pp. 64-75
• Two-pattern strings
  Frantis̑ek Franȇk, Jiandong Jiang, Weilin Lu, William F. Smyth
  Lecture Notes in Computer Science 2373, 2002, pp. 76-84
• Edit distance with move operations
  Dana Shapira, James A. Storer
  Lecture Notes in Computer Science 2373, 2002, pp. 85-98
• Towards optimally solving the LONGEST COMMON SUBSEQUENCE problem for sequences with nested arc annotations in linear time
  Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier
  Lecture Notes in Computer Science 2373, 2002, pp. 99-114
• Local similarity based point-pattern matching
  Veli Mäkinen, Esko Ukkonen
  Lecture Notes in Computer Science 2373, 2002, pp. 115-132
• Identifying occurrences of maximal pairs in multiple strings
  Costas S. Iliopoulos, Christos Makris, Spiros Sioutas, Athanasios Tsakalidis, Kostas Tsichlas
  Lecture Notes in Computer Science 2373, 2002, pp. 133-143
• Space-economical algorithms for finding maximal unique matches
  Wing-Kai Hon, Kunihiko Sadakane
  Lecture Notes in Computer Science 2373, 2002, pp. 144-152
• The minimum DAWG for all suffixes of a string and its applications
  Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
  Lecture Notes in Computer Science 2373, 2002, pp. 153-167
• On the complexity of deriving position specific score matrices from examples
  Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
  Lecture Notes in Computer Science 2373, 2002, pp. 168-177
• Three heuristics for \delta-matching: \delta-BM algorithms
  Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
  Lecture Notes in Computer Science 2373, 2002, pp. 178-189
• A better method for length distribution modeling in HMMs and its application to gene finding
  Broña Brejová, Tomás̑ Vinar
  Lecture Notes in Computer Science 2373, 2002, pp. 190-202
• Faster bit-parallel approximate string matching
  Heikki Hyyrö, Gonzalo Navarro
  Lecture Notes in Computer Science 2373, 2002, pp. 203-224
• One-gapped q-gram filters for Levenshtein distance
  Stefan Burkhardt, Juha Kärkkäinen
  Lecture Notes in Computer Science 2373, 2002, pp. 225-234
• Optimal exact and fast approximate two dimensional pattern matching allowing rotations
  Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
  Lecture Notes in Computer Science 2373, 2002, pp. 235-248
• Statistical identification of uniformly mutated segments within repeats
  S. Cenk Ṣahinalp, Evan Eichler, Paul Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergun
  Lecture Notes in Computer Science 2373, 2002, pp. 249-261
• Simple and practical sequence nearest neighbors with block operations
  S. Muthu Muthukrishnan, S. Cenk Ṣahinalp
  Lecture Notes in Computer Science 2373, 2002, pp. 262-278
• Constructing NFAs by optimal use of positions in regular expressions
  Lucian Ilie, Sheng Yu
  Lecture Notes in Computer Science 2373, 2002, pp. 279-288