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

• Substring range reporting
  Philip Bille, Inge Li Grtz
  Lecture Notes in Computer Science 6661, 2011, pp. 299-308
• Faster subsequence and don't-care pattern matching on compressed texts
  Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
  Lecture Notes in Computer Science 6661, 2011, pp. 309-322
• A combinatorial model of phyllotaxis perturbations in Arabidopsis thaliana
  Yassin Refahi, Etienne Farcot, Yann Guédon, Fabrice Besnard, Teva Vernoux, Christophe Godin
  Lecture Notes in Computer Science 6661, 2011, pp. 323-335
• Tractability and approximability of maximal strip recovery
  Laurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu
  Lecture Notes in Computer Science 6661, 2011, pp. 336-349
• Efficient seeds computation revisited
  Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Waleń
  Lecture Notes in Computer Science 6661, 2011, pp. 350-363
• Efficient matching of biological sequences allowing for non-overlapping inversions
  Domenico Cantone, Salvatore Cristofaro, Simone Faro
  Lecture Notes in Computer Science 6661, 2011, pp. 364-375
• A coarse-to-fine approach to computing the k-best Viterbi paths
  Jesper Nielsen
  Lecture Notes in Computer Science 6661, 2011, pp. 376-387
• Finding approximate and constrained motifs in graphs
  Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
  Lecture Notes in Computer Science 6661, 2011, pp. 388-401
• Improved MAX SNP-hard results for finding an edit distance between unordered trees
  Kouichi Hirata, Yoshiyuki Yamamoto, Tetsuji Kuboyama
  Lecture Notes in Computer Science 6661, 2011, pp. 402-415
• Approximation algorithms for orienting mixed graphs
  Michael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan
  Lecture Notes in Computer Science 6661, 2011, pp. 416-428
• Frequent submap discovery
  Stéphane Gosselin, Guillaume Damiand, Christine Solnon
  Lecture Notes in Computer Science 6661, 2011, pp. 429-440
• Edit distance with duplications and contractions revisited
  Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
  Lecture Notes in Computer Science 6661, 2011, pp. 441-454
• Polynomial-time approximation algorithms for weighted LCS problem
  Marek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
  Lecture Notes in Computer Science 6661, 2011, pp. 455-466
• Restricted common superstring and restricted common supersequence
  Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
  Lecture Notes in Computer Science 6661, 2011, pp. 467-478