CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2012 vol.9 Issue No.04 - July-Aug.
Issue No.04 - July-Aug. (2012 vol.9)
D. Fernandez-Baca , Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2012.47
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 input trees. Constructing RF supertrees for rooted and unrooted data is NP-hard. Nevertheless, effective local search heuristics have been developed for the restricted case where the input trees and the supertree are rooted. We describe new heuristics, based on the Edge Contract and Refine (ECR) operation, that remove this restriction, thereby expanding the utility of RF supertrees. Our experimental results on simulated and empirical data sets show that our unrooted local search algorithms yield better supertrees than those obtained from MRP and rooted RF heuristics in terms of total RF distance to the input trees and, for simulated data, in terms of RF distance to the true tree.
trees (mathematics), computational complexity, genetics, optimisation, tree searching, unrooted local search algorithms, fast local search, unrooted Robinson-Foulds supertrees, NP-hard unrooted data, local search heuristics, edge contract and refine operation, empirical data sets, Radio frequency, Vegetation, Phylogeny, Search problems, Materials requirements planning, Bioinformatics, Computational biology, NNI., Computational phylogenetics, Robinson-Foulds, supertrees, local search, 2-ECR
D. Fernandez-Baca, "Fast Local Search for Unrooted Robinson-Foulds Supertrees", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, no. 4, pp. 1004-1013, July-Aug. 2012, doi:10.1109/TCBB.2012.47