We introduce molecularevolution.org, a publicly available gateway for high-throughput, maximum likelihood phylogenetic analysis powered by grid computing. The gateway features a garli 2.0 web service that enables a user to quickly and easily submit thousands of maximum likelihood tree searches or bootstrap searches that are executed in parallel on distributed computing resources. The garli web service allows one to easily specify partitioned substitution models using a graphical interface, and it performs sophisticated post-processing of phylogenetic results. Although the garli web service has been used by the research community for over three years, here we formally announce the availability of the service, describe its capabilities, highlight new features and recent improvements, and provide details about how the grid system efficiently delivers high-quality phylogenetic results.
Supplemental material associated with the Systematic Biology article, "A Gateway for Phylogenetic Analysis Powered by Grid Computing Featuring GARLI 2.0".
Supplemental Table 1
A snapshot of information associated with The Lattice Project grid resources. The resources are shown sorted by composite throughput rating.
Supplemental Figure 1
The file repository belonging to an example registered user. Registered users may select from among the files found in their repository when specifying input files for a GARLI analysis, in addition to being able to upload new files.
Supplemental Figure 2
The create job page found at molecularevolution.org, as viewed by a registered user.
Supplemental Figure 3
The job status page found at molecularevolution.org, as viewed by a registered user.
Supplemental Figure 4
The job details page found at molecularevolution.org, as viewed by a registered user.
Supplemental Figure 5
The partitioned analysis portion of the create job page, currently showing a guided mode specification of two character sets and two data subsets.
Supplemental Figure 6
Partial output summarizing the results of 100 search replicates for the best tree. Among the results of the post-processing displayed here are summary statistics that characterize the distribution of log-likelihood scores, symmetric tree distances (raw and normalized), and estimates of the number of search replicates required to recover the best tree topology at three probability levels.