General Information
| Description | Fast and accurate Robinson-Foulds Supertrees using constrained exact optimization |
| Homepage | https://github.com/pranjalv123/FastRFS |
Publications
FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization
Motivation:
The estimation of phylogenetic trees is a major part of many biological dataset analyses, but maximum likelihood approaches are NP-hard and Bayesian MCMC methods do not scale well to even moderate-sized datasets. Supertree methods, which are used to construct trees from trees computed on subsets, are critically important tools for enabling the statistical estimation of phylogenies for large and potentially heterogeneous datasets. Supertree estimation is itself NP-hard, and no current supertree method has sufficient accuracy and scalability to provide good accuracy on the large datasets that supertree methods were designed for, containing thousands of species and many subset trees.
Results:
We present FastRFS, a new method based on a dynamic programming method we have developed to find an exact solution to the Robinson-Foulds Supertree problem within a constrained search space. FastRFS has excellent accuracy in terms of criterion scores and topological accuracy of the resultant trees, substantially improving on competing methods on a large collection of biological and simulated data. In addition, FastRFS is extremely fast, finishing in minutes on even very large datasets, and in under an hour on a biological dataset with 2228 species.
Availability and Implementation:
FastRFS is available on github at https://github.com/pranjalv123/FastRFS
Contact:
warnow@illinois.edu
Supplementary information:
Supplementary data are available at Bioinformatics online.
FAIR Evaluation
Sorry, you must be signed in to evaluate this object.
