Branch-and-Bound Approach for Parsimonious Inference of a Species Tree From a Set of Gene Family Trees - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports Year : 2010

Branch-and-Bound Approach for Parsimonious Inference of a Species Tree From a Set of Gene Family Trees

Abstract

We describe a Branch-and-Bound algorithm for computing a parsimonious species tree given a set of gene family trees. Our algorithm can compute a parsimonious species tree for three cost measures: number of gene duplications, number of gene losses, and both combined. Moreover, to cope with intrinsic limitations of Branch-and-Bound algorithms for species trees inference regarding the number of taxa that can be considered, our algorithm can naturally take into account predefined relationships between sets of taxa. We test our algorithm on a dataset of eukaryotic gene families spanning 29 taxa.
Fichier principal
Vignette du fichier
RR-10001.pdf (229.16 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00448481 , version 1 (19-01-2010)
lirmm-00448481 , version 2 (03-05-2010)

Identifiers

  • HAL Id : lirmm-00448481 , version 1

Cite

Jean-Philippe Doyon, Cedric Chauve. Branch-and-Bound Approach for Parsimonious Inference of a Species Tree From a Set of Gene Family Trees. RR-10001, 2010, pp.18. ⟨lirmm-00448481v1⟩
289 View
422 Download

Share

Gmail Mastodon Facebook X LinkedIn More