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 58(1) :35–54 Dong J, Fern´ andez-Baca D, McMorris F, et al (2010) Majority-r ule (+) consensus trees
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