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

• Algorithms on grammar-compressed strings
  Gad M. Landau
  Lecture Notes in Computer Science 6661, 2011, pp. 1-1
• Automatic discovery of patterns in media content
  Nello Cristianini
  Lecture Notes in Computer Science 6661, 2011, pp. 2-13
• Computational regulatory genomics
  Martin Vingron
  Lecture Notes in Computer Science 6661, 2011, pp. 14-14
• Lempel-Ziv factorization revisited
  Enno Ohlebusch, Simon Gog
  Lecture Notes in Computer Science 6661, 2011, pp. 15-26
• Succincter text indexing with wildcards
  Chris Thachuk
  Lecture Notes in Computer Science 6661, 2011, pp. 27-40
• Self-indexing based on LZ77
  Sebastian Kreft, Gonzalo Navarro
  Lecture Notes in Computer Science 6661, 2011, pp. 41-54
• Filling scaffolds with gene repetitions: Maximizing the number of adjacencies
  Haitao Jiang, Farong Zhong, Binhai Zhu
  Lecture Notes in Computer Science 6661, 2011, pp. 55-64
• String comparison and Lyndon-like factorization using V-order in linear time
  David E. Daykin, Jacqueline W. Daykin, W.F. Smyth
  Lecture Notes in Computer Science 6661, 2011, pp. 65-76
• A d-step approach for distinct squares in strings
  Antoine Deza, Frantisek Franek, Mei Jiang
  Lecture Notes in Computer Science 6661, 2011, pp. 77-89
• Tractability results for the consecutive-ones property with multiplicity
  Cedric Chauve, Ján Man̑uch, Murray Patterson, Roland Wittler
  Lecture Notes in Computer Science 6661, 2011, pp. 90-103
• Forest alignment with affine gaps and anchors
  Stefanie Schirmer, Robert Giegerich
  Lecture Notes in Computer Science 6661, 2011, pp. 104-117
• Phylogenetic footprinting and consistent sets of local aligments
  Wolfgang Otto, Peter F. Stadler, Sonja J. Prohaska
  Lecture Notes in Computer Science 6661, 2011, pp. 118-131
• Unique perfect phylogeny is NP-hard
  Michel Habib, Juraj Stacho
  Lecture Notes in Computer Science 6661, 2011, pp. 132-146
• Fast error-tolerant quartet phylogeny algorithms
  Daniel G. Brown, Jakub Truszkowski
  Lecture Notes in Computer Science 6661, 2011, pp. 147-161
• Real-time streaming string-matching
  Dany Breslauer, Zvi Galil
  Lecture Notes in Computer Science 6661, 2011, pp. 162-172
• Simple real-time constant-space string matching
  Dany Breslauer, Roberto Grossi, Filippo Mignosi
  Lecture Notes in Computer Science 6661, 2011, pp. 173-183
• Space lower bounds for online pattern matching
  Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
  Lecture Notes in Computer Science 6661, 2011, pp. 184-196
• Counting colours in compressed strings
  Travis Gagie, Juha Kärkkäinen
  Lecture Notes in Computer Science 6661, 2011, pp. 197-207
• On wavelet tree construction
  German Tischler
  Lecture Notes in Computer Science 6661, 2011, pp. 208-218
• Lightweight BWT construction for very large string collections
  Markus J. Bauer, Anthony J. Cox, Giovanna Rosone
  Lecture Notes in Computer Science 6661, 2011, pp. 219-231
• Palindrome pattern matching
  Tomohiro I, Shunsuke Inenaga, Masayuki Takeda
  Lecture Notes in Computer Science 6661, 2011, pp. 232-245
• Sparse and truncated suffix trees on variable-length codes
  Takashi Uemura, Hiroki Arimura
  Lecture Notes in Computer Science 6661, 2011, pp. 246-260
• On the weak prefix-search problem
  Paolo Ferragina
  Lecture Notes in Computer Science 6661, 2011, pp. 261-272
• Quick greedy computation for minimum common string partitions
  Isaac Goldstein, Moshe Lewenstein
  Lecture Notes in Computer Science 6661, 2011, pp. 273-284
• LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
  Jérémy Barbay, Johannes Fischer, Gonzalo Navarro
  Lecture Notes in Computer Science 6661, 2011, pp. 285-298