Fast Local Search for Unrooted Robinson-Foulds Supertrees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
By David Fernandez-Baca, J. Gordon Burleigh, Ruchi Chaudhary
Issue Date:July 2012
A Robinson-Foulds (RF) supertree for a collection of input trees is a tree containing all the species in the input trees that is at minimum total RF distance to the input trees. Thus, an RF supertree is consistent with the maximum number of splits in the i...