Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests
BMC Bioinformatics2010Vol. 11(1), pp. 324–324
Citations Over TimeTop 10% of 2010 papers
Abstract
The ability of Prunier to take into account branch support in the process of reconciliation allows a gain in complexity, in comparison to EEEP, and in accuracy in comparison to RIATA-HGT. Prunier's greedy algorithm proposes a single scenario of LGT for a gene family, but its quality always compares to the best solutions provided by the other algorithms. When the root position is uncertain in the species tree, Prunier is able to infer a scenario per root at a limited additional computational cost and can easily run on large datasets.Prunier is implemented in C++, using the Bio++ library and the phylogeny program Treefinder. It is available at: http://pbil.univ-lyon1.fr/software/prunier.
Related Papers
- → Tree-Based Unrooted Phylogenetic Networks(2017)30 cited
- Computing Measures for Tree-Basedness of Phylogenetic Networks(2018)
- Covering Tree-Based Phylogenetic Networks.(2020)
- → Mathematical Inference and Application of Expectation-Maximization Algorithm in the Construction of Phylogenetic Tree(2013)