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

• Sharper upper and lower bounds for an approximation scheme for CONSENSUS-PATTERN
  Bron̑a Brejová, Daniel G. Brown, Ian M. Harrower, Alejandro López-Ortiz, Tomás̑ Vinaȓ
  Lecture Notes in Computer Science 3537, 2005, pp. 1-10
• On the longest common rigid subsequence problem
  Bin Ma, Kaizhong Zhang
  Lecture Notes in Computer Science 3537, 2005, pp. 11-20
• Text indexing with errors
  Moritz G. Maaß, Johannes Nowak
  Lecture Notes in Computer Science 3537, 2005, pp. 21-32
• A new compressed suffix tree supporting fast search and its construction algorithm using optimal working space
  Dong Kyue Kim, Heejin Park
  Lecture Notes in Computer Science 3537, 2005, pp. 33-44
• Succinct suffix arrays based on run-length encoding
  Veli Mäkinen, Gonzalo Navarro
  Lecture Notes in Computer Science 3537, 2005, pp. 45-56
• Linear-time construction of compressed suffix arrays using o(n \log n)-bit working space for large alphabets
  Joong Chae Na
  Lecture Notes in Computer Science 3537, 2005, pp. 57-67
• Faster algorithms for \delta,\gamma-matching and related problems
  Peter Clifford, Raphaël Clifford, Costas Iliopoulos
  Lecture Notes in Computer Science 3537, 2005, pp. 68-78
• A fast algorithm for approximate string matching on gene sequences
  Zheng Liu, Xin Chen, James Borneman, Tao Jiang
  Lecture Notes in Computer Science 3537, 2005, pp. 79-90
• Approximate matching in the L_1 metric
  Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski
  Lecture Notes in Computer Science 3537, 2005, pp. 91-103
• An efficient algorithm for generating super condensed neighborhoods
  Luís M.S. Russo, Arlindo L. Oliveira
  Lecture Notes in Computer Science 3537, 2005, pp. 104-115
• The median problem for the reversal distance in circular bacterial genomes
  Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp
  Lecture Notes in Computer Science 3537, 2005, pp. 116-127
• Using PQ trees for comparative genomics
  Gad M. Landau, Laxmi Parida, Oren Weimann
  Lecture Notes in Computer Science 3537, 2005, pp. 128-143
• Hardness of optimal spaced seed design
  François Nicolas, Eric Rivals
  Lecture Notes in Computer Science 3537, 2005, pp. 144-155
• Weighted directed word graph
  Meng Zhang, Liang Hu, Qiang Li, Jiubin Ju
  Lecture Notes in Computer Science 3537, 2005, pp. 156-167
• Construction of Aho Corasick automaton in linear time for integer alphabets
  Shiri Dori, Gad M. Landau
  Lecture Notes in Computer Science 3537, 2005, pp. 168-177
• An extension of the Burrows Wheeler Transform and applications to sequence comparison and data compression
  Sabrina Mantaci, Antonio Restivo, G. Rosone, Marinella Sciortino
  Lecture Notes in Computer Science 3537, 2005, pp. 178-189
• DNA compression challenge revisited: A dynamic programming approach
  Behshad Behzadi, Fabrice Le Fessant
  Lecture Notes in Computer Science 3537, 2005, pp. 190-200
• On the complexity of sparse exon assembly
  Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
  Lecture Notes in Computer Science 3537, 2005, pp. 201-218
• An upper bound on the hardness of exact matrix based motif discovery
  Paul Horton, Wataru Fujibuchi
  Lecture Notes in Computer Science 3537, 2005, pp. 219-228
• Incremental inference of relational motifs with a degenerate alphabet
  Nadia Pisanti, Henry Soldano, Mathilde Carpentier
  Lecture Notes in Computer Science 3537, 2005, pp. 229-240
• Speeding up parsing of biological context-free grammars
  Daniel Fredouille, Christopher H. Bryant
  Lecture Notes in Computer Science 3537, 2005, pp. 241-256
• A new periodicity lemma
  Kangmin Fan, William F. Smyth, R.J. Simpson
  Lecture Notes in Computer Science 3537, 2005, pp. 257-265
• Two dimensional parameterized matching
  Carmit Hazay, Moshe Lewenstein, Dekel Tsur
  Lecture Notes in Computer Science 3537, 2005, pp. 266-279
• An optimal algorithm for online square detection
  Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu
  Lecture Notes in Computer Science 3537, 2005, pp. 280-287
• A simple fast hybrid pattern-matching algorithm
  Frantisek Franek, Christopher G. Jennings, William F. Smyth
  Lecture Notes in Computer Science 3537, 2005, pp. 288-297