Robinson-foulds supertrees
Background Supertree methods synthesize collections of small phylogenetic trees with
incomplete taxon overlap into comprehensive trees, or supertrees, that include all taxa found …
incomplete taxon overlap into comprehensive trees, or supertrees, that include all taxa found …
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background Genomic data provide a wealth of new information for phylogenetic analysis.
Yet making use of this data requires phylogenetic methods that can efficiently analyze …
Yet making use of this data requires phylogenetic methods that can efficiently analyze …
Exact solutions for species tree inference from discordant gene trees
Phylogenetic analysis has to overcome the grant challenge of inferring accurate species
trees from evolutionary histories of gene families (gene trees) that are discordant with the …
trees from evolutionary histories of gene families (gene trees) that are discordant with the …
An efficient method for exploring the space of gene tree/species tree reconciliations in a probabilistic framework
Background. Inferring an evolutionary scenario for a gene family is a fundamental problem
with applications both in functional and evolutionary genomics. The gene tree/species tree …
with applications both in functional and evolutionary genomics. The gene tree/species tree …
Algorithms for genome-scale phylogenetics using gene tree parsimony
MS Bansal, O Eulenstein - IEEE/ACM Transactions on …, 2013 - ieeexplore.ieee.org
The use of genomic data sets for phylogenetics is complicated by the fact that evolutionary
processes such as gene duplication and loss, or incomplete lineage sorting (deep …
processes such as gene duplication and loss, or incomplete lineage sorting (deep …
A note on the fixed parameter tractability of the gene-duplication problem
The NP-hard gene-duplication problem takes as input a collection of gene trees and seeks a
species tree that requires the fewest number of gene duplications to reconcile the input gene …
species tree that requires the fewest number of gene duplications to reconcile the input gene …
GTP supertrees from unrooted gene trees: linear time algorithms for NNI based local searches
Gene tree parsimony (GTP) problems infer species supertrees from a collection of rooted
gene trees that are confounded by evolutionary events like gene duplication, gene …
gene trees that are confounded by evolutionary events like gene duplication, gene …
Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems
A Wehe, JG Burleigh… - IEEE/ACM transactions on …, 2012 - ieeexplore.ieee.org
Phylogenetic inference is a computationally difficult problem, and constructing high-quality
phylogenies that can build upon existing phylogenetic knowledge and synthesize insights …
phylogenies that can build upon existing phylogenetic knowledge and synthesize insights …
H-trees: a model of evolutionary scenarios with horizontal gene transfer
P Górecki - Fundamenta Informaticae, 2010 - content.iospress.com
In this paper, we present a model of evolution of genes in the context of evolution of species.
The concept is based on reconciliation models. We assume that the gene evolution is …
The concept is based on reconciliation models. We assume that the gene evolution is …
Branch-and-bound approach for parsimonious inference of a species tree from a set of gene family trees
JP Doyon, C Chauve - Software Tools and Algorithms for Biological …, 2011 - Springer
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 …
given a set of gene family trees. Our algorithm can consider three cost measures: number of …