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

Suche: Series=LNCS AND Volume=5577

• The structure of level-k phylogenetic networks
  Philippe Gambette, Vincent Berry, Christophe Paul
  Lecture Notes in Computer Science 5577, 2009, pp. 289-300
• Finding all sorting tandem duplication random loss operations
  Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf
  Lecture Notes in Computer Science 5577, 2009, pp. 301-313
• Average-case analysis of perfect sorting by reversals
  Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin
  Lecture Notes in Computer Science 5577, 2009, pp. 314-325
• Statistical properties of factor oracles
  Jérémie Bourdon, Irena Rusu
  Lecture Notes in Computer Science 5577, 2009, pp. 326-338
• Haplotype inference constrained by plausible haplotype data
  Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances Rosamond, Liat Rozenberg
  Lecture Notes in Computer Science 5577, 2009, pp. 339-352
• Efficient inference of haplotypes from genotypes on a pedigree with mutations and missing alleles (extented abstract)
  Wei-Bung Wang, Tao Jiang
  Lecture Notes in Computer Science 5577, 2009, pp. 353-367