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

• Asynchronous pattern matching
  Amihood Amir
  Lecture Notes in Computer Science 4009, 2006, pp. 1-10
• SNP and haplotype analysis - Algorithms and applications
  Eran Halperin
  Lecture Notes in Computer Science 4009, 2006, pp. 11-11
• Identifying co-referential names across large corpora
  Levon Lloyd, Andrew Mehler, Steven Skiena
  Lecture Notes in Computer Science 4009, 2006, pp. 12-23
• Adaptive searching in succinctly encoded binary relations and tree-structured documents
  Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
  Lecture Notes in Computer Science 4009, 2006, pp. 24-35
• Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE
  Johannes Fischer, Volker Heun
  Lecture Notes in Computer Science 4009, 2006, pp. 36-48
• A linear size index for approximate pattern matching
  Ho-Leung Chan, Tak-Wah Lam, Wing-Kin Sung, Siu-Lung Tam, Swee-Seong Wong
  Lecture Notes in Computer Science 4009, 2006, pp. 49-59
• On-line linear-time construction of word suffix trees
  Shunsuke Inenaga, Masayuki Takeda
  Lecture Notes in Computer Science 4009, 2006, pp. 60-71
• Obtaining provably good performance from suffix trees in secondary storage
  Pang Ko, Srinivas Aluru
  Lecture Notes in Computer Science 4009, 2006, pp. 72-83
• Geometric suffix tree: A new index structure for protein 3-D structures
  Tetsuo Shibuya
  Lecture Notes in Computer Science 4009, 2006, pp. 84-93
• New bounds for motif finding in strong instances
  Bron̑a Brejová, Daniel G. Brown, Ian M. Harrower, Tomás̑ Vinaȓ
  Lecture Notes in Computer Science 4009, 2006, pp. 94-105
• Fingerprint clustering with bounded number of missing values
  Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Giancarlo Mauri
  Lecture Notes in Computer Science 4009, 2006, pp. 106-116
• Tiling an interval of the discrete line
  Olivier Bodini, Eric Rivals
  Lecture Notes in Computer Science 4009, 2006, pp. 117-128
• Common substrings in random strings
  Eric Blais, Mathieu Blanchette
  Lecture Notes in Computer Science 4009, 2006, pp. 129-140
• On the repeat-annotated phylogenetic tree reconstruction problem
  Firas Swidan, Michal Ziv-Ukelson, Ron Y. Pinter
  Lecture Notes in Computer Science 4009, 2006, pp. 141-152
• Subsequence combinatorics and applications to microarray production, DNA sequencing and chaining algorithms
  Sven Rahmann
  Lecture Notes in Computer Science 4009, 2006, pp. 153-164
• Solving the maximum agreement subtree and the maximum compatible tree problems on many bounded degree trees
  Sylvain Guillemot, François Nicolas
  Lecture Notes in Computer Science 4009, 2006, pp. 165-176
• An improved algorithm for the macro-evolutionary phylogeny problem
  Behshad Behzadi, Martin Vingron
  Lecture Notes in Computer Science 4009, 2006, pp. 177-187
• Property matching and weighted matching
  Amihood Amir, Eran Chencinski, Costas Iliopoulos, Tsvi Kopelowitz, Hui Zhang
  Lecture Notes in Computer Science 4009, 2006, pp. 188-199
• Faster two dimensional scaled matching
  Amihood Amir, Eran Chencinski
  Lecture Notes in Computer Science 4009, 2006, pp. 200-210
• Approximation of RNA multiple structural alignment
  Marcin Kubica, Romeo Rizzi, Stéphane Vialette, Tomasz Waleń
  Lecture Notes in Computer Science 4009, 2006, pp. 211-222
• Finding common RNA pseudoknot structures in polynomial time
  Patricia A. Evans
  Lecture Notes in Computer Science 4009, 2006, pp. 223-232
• A compact mathematical programming formulation for DNA motif finding
  Carl Kingsford, Elena Zaslavsky, Mona Singh
  Lecture Notes in Computer Science 4009, 2006, pp. 233-245
• Local alignment of RNA sequences with arbitrary scoring schemes
  Rolf Backofen, Danny Hermelin, Gad M. Landau, Oren Weimann
  Lecture Notes in Computer Science 4009, 2006, pp. 246-257
• An O(n^{3/2}\sqrt {\log (n})) algorithm for sorting by reciprocal translocations
  Michal Ozery-Flato, Ron Shamir
  Lecture Notes in Computer Science 4009, 2006, pp. 258-269
• Longest common subsequences in permutations and maximum cliques in circle graphs
  Alexander Tiskin
  Lecture Notes in Computer Science 4009, 2006, pp. 270-281