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

• Yeast ancestral genome reconstructions: The possibilities of computational methods
  Eric Tannier
  Lecture Notes in Computer Science 5817, 2009, pp. 1-12
• Natural parameter values for generalized gene adjacency
  Zhenyu Yang, David Sankoff
  Lecture Notes in Computer Science 5817, 2009, pp. 13-23
• Parking functions, labeled trees and DCJ sorting scenarios
  Aïda Ouangraoua, Anne Bergeron
  Lecture Notes in Computer Science 5817, 2009, pp. 24-35
• Counting all DCJ sorting scenarios
  Marília D.V. Braga, Jens Stoye
  Lecture Notes in Computer Science 5817, 2009, pp. 36-47
• Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction
  Cedric Chauve, Utz-Uwe Haus, Tamon Stephen, Vivija P. You
  Lecture Notes in Computer Science 5817, 2009, pp. 48-58
• Finding nested common intervals efficiently
  Guillaume Blin, Jens Stoye
  Lecture Notes in Computer Science 5817, 2009, pp. 59-69
• DCJ median problems on linear multichromosomal genomes: Graph representation and fast exact solutions
  Andrew Wei Xu
  Lecture Notes in Computer Science 5817, 2009, pp. 70-83
• Rearrangement models and single-cut operations
  Paul Medvedev, Jens Stoye
  Lecture Notes in Computer Science 5817, 2009, pp. 84-97
• Aligning two genomic sequences that contain duplications
  Minmei Hou, Cathy Riemer, Piotr Berman, Ross C. Hardison, Webb Miller
  Lecture Notes in Computer Science 5817, 2009, pp. 98-110
• Inferring the recent duplication history of a gene cluster
  Giltae Song, Louxin Zhang, Tomás̑ Vinaȓ, Webb Miller
  Lecture Notes in Computer Science 5817, 2009, pp. 111-125
• Pseudo Boolean programming for partially ordered genomes
  Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette
  Lecture Notes in Computer Science 5817, 2009, pp. 126-137
• Computing the summed adjacency disruption number between two genomes with duplicate genes using pseudo-Boolean optimization
  João Delgado, Inês Lynce, Vasco Manquinho
  Lecture Notes in Computer Science 5817, 2009, pp. 138-149
• Reconstructing histories of complex gene clusters on a phylogeny
  Tomás̑ Vinaȓ, Bron̑a Brejová, Giltae Song, Adam Siepel
  Lecture Notes in Computer Science 5817, 2009, pp. 150-163
• Co-evolutionary models for reconstructing ancestral genomic sequences: Computational issues and biological examples
  Tamir Tuller, Hadas Birin, Martin Kupiec, Eytan Ruppin
  Lecture Notes in Computer Science 5817, 2009, pp. 164-180
• Whole-genome analysis of gene conversion events
  Chih-Hao Hsu, Yu Zhang, Ross Hardison, Webb Miller
  Lecture Notes in Computer Science 5817, 2009, pp. 181-192
• A statistically fair comparison of ancestral genome reconstructions, based on breakpoint and rearrangement distances
  Zaky Adam, David Sankoff
  Lecture Notes in Computer Science 5817, 2009, pp. 193-204
• Comparative genomics and extensive recombinations in phage communities
  Guylaine Poisson, Mahdi Belcaid, Anne Bergeron
  Lecture Notes in Computer Science 5817, 2009, pp. 205-216
• Properties of sequence conservation in upstream regulatory and protein coding sequences among paralogs in Arabidopsis thaliana
  Dale N. Richardson, Thomas Wiehe
  Lecture Notes in Computer Science 5817, 2009, pp. 217-228
• Transcription factor binding probabilities in orthologous promoters: An alignment-free approach to the inference of functional regulatory targets
  Xiao Liu, Neil D. Clarke
  Lecture Notes in Computer Science 5817, 2009, pp. 229-240