Version 2.0 of the software (RFS v2.0) has now been released!
(Last updated on January 08, 2013)
- RFS v2.0 executables for: Linux, Mac (Intel), Windows
- Manual: pdf
- Sample dataset: seabirds.newick
This program takes as input a collection of rooted trees and heuristically searches for a binary supertree that minimizes the total (rooted) Robinson-Foulds distance between the supertree and the input trees. The intuition behind seeking a binary supertree, even though the input trees may be non-binary (unresolved), is that, under this setting, minimizing the RF distance is equivalent to maximizing the number of shared clades (or clusters) between the input trees and the supertree. Thus, an RF supertree is a supertree that is consistent with the largest number of clusters from the input trees. The program can quickly compute accurate supertrees for even large datasets containing thousands of input trees with many hundreds of taxa.
The new version of RFS (v2.0) implements several enhancements that make the software much faster and even more accurate.
The software can be cited as follows:
Mukul S. Bansal, J. G. Burleigh, Oliver Eulenstein, David Fernandez-Baca.
Algorithms for Molecular Biology 2010, 5:18.
‡This work was supported in part by NSF grants DEB-0334832 and DEB-0829674.
Contact: Please feel free to contact Mukul Bansal (firstname.lastname@example.org) if you have any questions, concerns, or suggestions.