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

• A linear time pattern matching algorithm between a string and a tree
  Tatsuya Akutsu
  Lecture Notes in Computer Science 684, 1993, pp. 1-10
• Tight comparison bounds for the string prefix-matching problem
  Dany Breslauer, Livio Colussi, Laura Toniolo
  Lecture Notes in Computer Science 684, 1993, pp. 11-19
• 3-D docking of protein molecules
  Daniel Fischer, Raquel Norel, Ruth Nussinov, Haim J. Wolfson
  Lecture Notes in Computer Science 684, 1993, pp. 20-34
• Minimal separators of two words
  Emmanuelle Garel
  Lecture Notes in Computer Science 684, 1993, pp. 35-53
• Covering a string
  Costas S. Iliopoulos, Dennis W.G. Moore, Kunsoo Park
  Lecture Notes in Computer Science 684, 1993, pp. 54-62
• On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings
  Robert W. Irving, Campbell B. Fraser
  Lecture Notes in Computer Science 684, 1993, pp. 63-73
• An algorithm for locating non-overlapping regions of maximum alignment score
  Sampath K. Kannan, Eugene W. Myers
  Lecture Notes in Computer Science 684, 1993, pp. 74-86
• Exact and approximation algorithms for the inversion distance between two chromosomes
  John Kececioglu, David Sankoff
  Lecture Notes in Computer Science 684, 1993, pp. 87-105
• The maximum weight trace problem in multiple sequence alignment
  John Kececioglu
  Lecture Notes in Computer Science 684, 1993, pp. 106-119
• An algorithm for approximate tandem repeats
  Gad M. Landau, Jeanette P. Schmidt
  Lecture Notes in Computer Science 684, 1993, pp. 120-133
• Two dimensional pattern matching in a digitized image
  Gad M. Landau, Uzi Vishkin
  Lecture Notes in Computer Science 684, 1993, pp. 134-151
• Analysis of a string edit problem in a probabilistic framework
  Guy Louchard, Wojciech Szpankowski
  Lecture Notes in Computer Science 684, 1993, pp. 152-163
• Detecting false matches in string matching algorithms
  S. Muthukrishnan
  Lecture Notes in Computer Science 684, 1993, pp. 164-178
• On suboptimal alignments of biological sequences
  Dalit Naor, Douglas Brutlag
  Lecture Notes in Computer Science 684, 1993, pp. 179-196
• A fast filtration algorithm for the substring matching problem
  Pavel A. Pevzner, Michael S. Waterman
  Lecture Notes in Computer Science 684, 1993, pp. 197-214
• A unifying look at d-dimensional periodicities and space coverings
  Mireille Régnier, Ladan Rostami
  Lecture Notes in Computer Science 684, 1993, pp. 215-227
• Approximate string-matching over suffix trees
  Esko Ukkonen
  Lecture Notes in Computer Science 684, 1993, pp. 228-242
• Multiple sequence comparison and n-dimensional image reconstruction
  Martin Vingron, Pavel A. Pevzner
  Lecture Notes in Computer Science 684, 1993, pp. 243-253
• A new editing based distance between unordered labeled trees
  Kaizhong Zhang
  Lecture Notes in Computer Science 684, 1993, pp. 254-265