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: Booktitle=Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, CPM'96 (Laguna Beach, California, June 10-12, 1996)

• A faster algorithm for approximate string matching
  Ricardo Baeza-Yates, Gonzalo Navarro
  Lecture Notes in Computer Science 1075, 1996, pp. 1-23
• Boyer-Moore strategy to efficient approximate string matching
  Nadia El-Mabrouk, Maxime Crochemore
  Lecture Notes in Computer Science 1075, 1996, pp. 24-38
• Randomized efficient algorithms for compressed strings: The finger-print approach
  Leszek Ga̧sieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
  Lecture Notes in Computer Science 1075, 1996, pp. 39-49
• Filtration with q-samples in approximate string matching
  Erkki Sutinen, Jorma Tarhio
  Lecture Notes in Computer Science 1075, 1996, pp. 50-63
• Computing discoveries in molecular biology
  David J. Lipman
  Lecture Notes in Computer Science 1075, 1996, pp. 64-64
• Approximate dictionary queries
  Gerth Stlting Brodal, Leszek Ga̧sieniec
  Lecture Notes in Computer Science 1075, 1996, pp. 65-74
• Approximate multiple string search
  Robert Muth, Udi Manber
  Lecture Notes in Computer Science 1075, 1996, pp. 75-86
• A 2\frac{2}{3}-approximation algorithm for the shortest superstring problem
  Chris Armen, Clifford Stein
  Lecture Notes in Computer Science 1075, 1996, pp. 87-101
• Suffix trees on words
  Arne Andersson, N. Jesper Larsson, Kurt Swanson
  Lecture Notes in Computer Science 1075, 1996, pp. 102-115
• The suffix tree of a tree and minimizing sequential transducers
  Dany Breslauer
  Lecture Notes in Computer Science 1075, 1996, pp. 116-129
• Perfect hashing for strings: Formalization and algorithms
  Martin Farach, S. Muthukrishnan
  Lecture Notes in Computer Science 1075, 1996, pp. 130-140
• Spliced alignment: A new approach to gene recognition
  Mikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner
  Lecture Notes in Computer Science 1075, 1996, pp. 141-158
• Original synteny
  Vincent Ferretti, Joseph H. Nadeau, David Sankoff
  Lecture Notes in Computer Science 1075, 1996, pp. 159-167
• Fast sorting by reversal
  Piotr Berman, Sridhar Hannenhalli
  Lecture Notes in Computer Science 1075, 1996, pp. 168-185
• A double combinatorial approach to discovering patterns in biological sequences
  Marie-France Sagot, Alain Viari
  Lecture Notes in Computer Science 1075, 1996, pp. 186-208
• Poisson process approximation for repeats in one sequence and its application to sequencing by hybridization
  Richard Arratia, Gesine Reinert
  Lecture Notes in Computer Science 1075, 1996, pp. 209-219
• Improved approximation algorithms for tree alignment
  Lusheng Wang, Dan Gusfield
  Lecture Notes in Computer Science 1075, 1996, pp. 220-233
• The asymmetric median tree - A new model for building consensus trees
  Cynthia A. Phillips, Tandy J. Warnow
  Lecture Notes in Computer Science 1075, 1996, pp. 234-252
• Constructing computer virus phylogenies
  Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin
  Lecture Notes in Computer Science 1075, 1996, pp. 253-270
• Docking of conformationally flexible proteins
  Bilha Sandak, Ruth Nussinov, Haim J. Wolfson
  Lecture Notes in Computer Science 1075, 1996, pp. 271-287
• Invariant patterns in crystal lattices: Implications for protein folding algorithms
  William E. Hart, Sorin Istrail
  Lecture Notes in Computer Science 1075, 1996, pp. 288-303
• Graph traversals, genes, and matroids: An efficient case of the Travelling Salesman problem
  Dan Gusfield, Richard Karp, Lusheng Wang, Paul Stelling
  Lecture Notes in Computer Science 1075, 1996, pp. 304-319
• Alphabet independent and dictionary scaled matching
  Amihood Amir, Gruia Calinescu
  Lecture Notes in Computer Science 1075, 1996, pp. 320-334
• Analysis of two-dimensional approximate pattern matching algorithms
  Kunsoo Park
  Lecture Notes in Computer Science 1075, 1996, pp. 335-347
• Approximation algorithms for maximum two-dimensional pattern matching
  Srinivasa R. Arikati, Anders Dessmark, Andrzej Lingas, Madhav Marathe
  Lecture Notes in Computer Science 1075, 1996, pp. 348-360