title: 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 consider 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.
authors: LIRMM, Université Montpellier 2 and CNRS, Montpellier, France. doyonjea@iro.umontreal.ca
authors: Jean-Philippe
authors: JP
authors: Doyon
authors: Cedric
authors: C
authors: Chauve
mesh_terms: D000465:Algorithms; D019295:Computational Biology; D030541:Databases, Genetic; D019143:Evolution, Molecular; D049810:Genetic Speciation; D008957:Models, Genetic; D005810:Multigene Family; D010802:Phylogeny