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 [3]	Hilfe

Suche: Series=LNCS AND Volume=6129

• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
  Domenico Cantone, Simone Faro, Emanuele Giaquinta
  Lecture Notes in Computer Science 6129, 2010, pp. 288-298
• Algorithms for three versions of the shortest common superstring problem
  Maxime Crochemore, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
  Lecture Notes in Computer Science 6129, 2010, pp. 299-309
• Finding optimal alignment and consensus of circular strings
  Taehyung Lee, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim
  Lecture Notes in Computer Science 6129, 2010, pp. 310-322
• Optimizing restriction site placement for synthetic genomes
  Pablo Montes, Heraldo Memelli, Charles Ward, Joondong Kim, Joseph S.B. Mitchell, Steven Skiena
  Lecture Notes in Computer Science 6129, 2010, pp. 323-337
• Extension and faster implementation of the GRP transform for lossless compression
  Hidetoshi Yokoo
  Lecture Notes in Computer Science 6129, 2010, pp. 338-347
• Parallel and distributed compressed indexes
  Luís M.S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
  Lecture Notes in Computer Science 6129, 2010, pp. 348-360