A polynomial-time algorithm completes phylogenetic tree sets with partial taxon overlap by extracting maximal subtrees, forming weighted majority-rule consensus, scaling branches from common leaves, and inserting subtrees to minimize quadratic distance error, producing unique order-independent trees
Systematic Biology 21(4):390–397 Akanni W A, Wilkinson M, Creevey CJ, et al (2015) Implementing and testing bayesian and maximum-likelihood supertree methods in phylogenetics
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
q-bio.PE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial-time completion of phylogenetic tree sets
A polynomial-time algorithm completes phylogenetic tree sets with partial taxon overlap by extracting maximal subtrees, forming weighted majority-rule consensus, scaling branches from common leaves, and inserting subtrees to minimize quadratic distance error, producing unique order-independent trees