Get 1000 Hours free
On the UCSD Supercomputer
Start Your TrialAccurate Species TRee ALgorithm (ASTRAL) is a tool for estimating an unrooted species tree given a set of unrooted gene trees. ASTRAL is statistically consistent under the multi-species coalescent model (and thus is useful for handling incomplete lineage sorting, i.e., ILS). ASTRAL finds the species tree that has the maximum number of shared induced quartet trees with the set of gene trees, subject to the constraint that the set of bipartitions in the species tree comes from a predefined set of bipartitions. This predefined set is empirically decided by ASTRAL (but see tutorial on how to expand it). The current code corresponds to ASTRAL-III (see below for the publication).
The algorithm was designed by Tandy Warnow and Siavash Mirarab originally. ASTRAL-III incorporates many ideas by Chao Zhang and Maryam Rabiee. Code developers are mainly Siavash Mirarab, Chao Zhang, Maryam Rabiee, and Erfan Sayyari.
The table below shows the kinds of results returned by CIPRES Science Gateway:
Input File Names | Sample File from a Test |
file containing gene trees | astral_infile.tre |
Sample Output File Type | File Name |
log file | astral_logfile.txt |
species tree file | astral_species.tre |
If you use ASTRAL here, please cite:
If there is a tool or a feature you need, please let us know.