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

• Sorting by reversals in subquadratic time
  Eric Tannier, Marie-France Sagot
  Lecture Notes in Computer Science 3109, 2004, pp. 1-13
• Computational problems in perfect phylogeny haplotyping: Xor-genotypes and tag SNPs
  Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, Itsik Pe'er
  Lecture Notes in Computer Science 3109, 2004, pp. 14-31
• Sorting by length-weighted reversals: Dealing with signs and circularity
  Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter
  Lecture Notes in Computer Science 3109, 2004, pp. 32-46
• Optimizing multiple spaced seeds for homology search
  Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma
  Lecture Notes in Computer Science 3109, 2004, pp. 47-58
• Approximate labelled subtree homeomorphism
  Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson
  Lecture Notes in Computer Science 3109, 2004, pp. 59-73
• On the average sequence complexity
  Svante Janson, Stefano Lonardi, Wojciech Szpankowski
  Lecture Notes in Computer Science 3109, 2004, pp. 74-88
• Approximate point set pattern matching on sequences and planes
  Tomoaki Suga, Shinichi Shimozono
  Lecture Notes in Computer Science 3109, 2004, pp. 89-101
• Finding biclusters by random projections
  Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang
  Lecture Notes in Computer Science 3109, 2004, pp. 102-116
• Real-time string matching in sublinear space
  Leszek Ga̧sieniec, Roman Kolpakov
  Lecture Notes in Computer Science 3109, 2004, pp. 117-129
• On the k-closest substring and k-consensus pattern problems
  Yishan Jiao, Jingyi Xu, Ming Li
  Lecture Notes in Computer Science 3109, 2004, pp. 130-144
• A trie-based approach for compacting automata
  Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
  Lecture Notes in Computer Science 3109, 2004, pp. 145-158
• A simple optimal representation for balanced parentheses
  Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
  Lecture Notes in Computer Science 3109, 2004, pp. 159-172
• Two algorithms for LCS consecutive suffix alignment
  Gad M. Landau, Eugene Myers, Michal Ziv-Ukelson
  Lecture Notes in Computer Science 3109, 2004, pp. 173-193
• Efficient algorithms for finding submasses in weighted strings
  Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták
  Lecture Notes in Computer Science 3109, 2004, pp. 194-204
• Maximum agreement and compatible supertrees
  Vincent Berry, François Nicolas
  Lecture Notes in Computer Science 3109, 2004, pp. 205-219
• Polynomial-time algorithms for the ordered maximum agreement subtree problem
  Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
  Lecture Notes in Computer Science 3109, 2004, pp. 220-229
• Small phylogeny problem: Character evolution trees
  Arvind Gupta, Ján Man̑uch, Ladislav Stacho, Chenchen Zhu
  Lecture Notes in Computer Science 3109, 2004, pp. 230-243
• The protein sequence design problem in canonical model on 2D and 3D lattices
  Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert Sloan, György Turán, Yi Zhang
  Lecture Notes in Computer Science 3109, 2004, pp. 244-253
• A computational model for RNA multiple structural alignment
  Eugene Davydov, Serafim Batzoglou
  Lecture Notes in Computer Science 3109, 2004, pp. 254-269
• Computational design of new and recombinant selenoproteins
  Rolf Backofen, Anke Busch
  Lecture Notes in Computer Science 3109, 2004, pp. 270-284
• A combinatorial shape matching algorithm for rigid protein docking
  Vicky Choi, Navin Goyal
  Lecture Notes in Computer Science 3109, 2004, pp. 285-296
• Multi-seed lossless filtration
  Gregory Kucherov, Laurent Noé, Mikhail Roytberg
  Lecture Notes in Computer Science 3109, 2004, pp. 297-310
• New results for the 2-interval pattern problem
  Guillaume Blin, Guillaume Fertin, Stéphane Vialette
  Lecture Notes in Computer Science 3109, 2004, pp. 311-322
• A linear-time algorithm for computing translocation distance between signed genomes
  Guojun Li, Xingqin Qi, Xiaoli Wang, Binhai Zhu
  Lecture Notes in Computer Science 3109, 2004, pp. 323-332
• Sparse normalized local alignment
  Nadav Efraty, Gad M. Landau
  Lecture Notes in Computer Science 3109, 2004, pp. 333-346