Abstract
Phylogenetic trees are essential for studying biology, but their reproducibility under identical parameter settings remains unexplored. Here, we find that 3515 (18.11%) IQ-TREE-inferred and 1813 (9.34%) RAxML-NG-inferred maximum likelihood (ML) gene trees are topologically irreproducible when executing two replicates (Run1 and Run2) for each of 19,414 gene alignments in 15 animal, plant, and fungal phylogenomic datasets. Notably, coalescent-based ASTRAL species phylogenies inferred from Run1 and Run2 sets of individual gene trees are topologically irreproducible for 9/15 phylogenomic datasets, whereas concatenation-based phylogenies inferred twice from the same supermatrix are reproducible. Our simulations further show that irreproducible phylogenies are more likely to be incorrect than reproducible phylogenies. These results suggest that a considerable fraction of single-gene ML trees may be irreproducible. Increasing reproducibility in ML inference will benefit from providing analyses’ log files, which contain typically reported parameters (e.g., program, substitution model, number of tree searches) but also typically unreported ones (e.g., random starting seed number, number of threads, processor type).
Subject terms: Phylogeny, Phylogenetics
Replicate runs of maximum likelihood phylogenetic analyses can generate different tree topologies due to differences in parameters, such as random seeds. Here, Shen et al. demonstrate that replicate runs can generate substantially different tree topologies even with identical data and parameters.
Introduction
The ability to replicate the results of a specific published experiment or analysis is a cornerstone of the scientific enterprise1–3. In the last few years, concerns about scientists’ abilities to accurately reproduce the results of published studies in numerous disciplines, ranging from psychology and molecular biology to oncology, have steadily increased, leading to what some have dubbed as “the reproducibility crisis”4–10.
Phylogenetics, the science of reconstructing evolutionary relationships of biological entities, is fundamental to the study of biology11–14. For example, phylogenetic trees are routinely used to understand how genes, genomes, organisms, and species evolve15–17. Application of phylogenetic trees also extends to other fields, and a phylogenetic framework has been employed to understand the evolution of diverse non-biological entities, such as languages and medieval manuscripts18–21.
Concerns about reproducibility in phylogenetics are not new but have historically been attributed to the unavailability of the data used in inference22,23. For example, a 2013 meta-analysis reported that phylogenetic trees in 6277/7539 (83.3%) studies published in the last few decades are irreproducible due to the unavailability of the underlying data22. The availability of public data repositories (e.g., TreeBASE, Dryad, Figshare, Zenodo, OSF) coupled with the modernization of journal data sharing policies have greatly increased the availability of sequence alignment data, the resulting phylogenetic trees, as well as of information about program(s) and key parameter settings (e.g., substitution model) used24–30.
Concerns remain, however, that the information that is now routinely provided in public data repositories may be still insufficient to ensure reproducibility of a study’s findings. For example, phylogenetic studies seldom provide the random starting seed number used in inference, even though it is well established that it can affect hill-climbing tree heuristic searches of state-of-the-art, widely used maximum likelihood (ML)-based phylogenetic programs, such as IQ-TREE31 and RAxML-NG32. More worrisomely, we currently know little about how the phylogenetic informativeness of the underlying data (e.g., the number of parsimony-informative sites or branch support values) or the variation in the computing resources used (e.g., number of the central processing unit (CPU) cores and type(s) of processor among studies or among nodes of a supercomputing cluster)33,34 affect the reproducibility of phylogenetic inference.
Here we show that ~9 to ~18% of single-gene phylogenies are topologically irreproducible when executing two replicates (Run1 and Run2) on the same program (IQ-TREE or RAxML-NG on two threads of execution) with exactly the same parameter settings for each of 19,414 gene alignments in 15 animal, plant, and fungal studies. We further find that low phylogenetic informativeness (e.g., low percentage of parsimony-informative sites in gene alignment, short alignment length, and low branch support values), random starting seed number, processor type, and thread number contribute to the observed irreproducibility. Interestingly, thread number affected reproducibility in a program-specific manner.
Results
The ML phylogenies of a considerable number of genes in phylogenomic data sets are irreproducible
To evaluate the reproducibility of single-gene phylogenetic trees, we collected 19,414 gene alignments from 15 animal, plant, and fungal phylogenomic data sets that span a wide spectrum of taxonomic ranks (Supplementary Data 1). For each gene alignment, we conducted two replicate runs (Run1 and Run2) using identical settings, including substitution model, random starting seed number, number of threads of execution (2), the number of independent tree searches (20), log-likelihood epsilon value (0.0001), and ML program. Note that we chose values for the number of independent tree searches (20 instead of the standard range of 1–5) and log-likelihood epsilon (0.0001 instead of the standard 0.1) that aimed to minimize uncertainty in inference stemming from the fact that we are conducting heuristic searches. We used two state-of-the-art ML programs: IQ-TREE31, whose heuristic search algorithm uses nearest-neighbor-interchange (NNI)35, and RAxML-NG32, whose algorithm uses subtree pruning and regrafting (SPR)36 (Fig. 1).
For each pair of ML trees inferred from the Run1 and Run2 analyses of the same gene, we computed the normalized Robinson–Foulds37 tree distance (nRFD; i.e., the fraction of bipartitions that differ between Run1 and Run2 trees) and the branch score distance of Kuhner and Felsenstein38 (KF is the sum of the squares of the differences in branch lengths between Run1 and Run2 trees) with the R packages ape version 5.3 and phangorn version 2.5.539,40. We found that 3515/19,414 genes (18.1%) in IQ-TREE and 1813/19,414 genes (9.3%) in RAxML-NG differed in their topologies (nRFD > 0) and branch lengths (KF > 0) (Figs. 1,2 and Supplementary Fig. 1, Supplementary Data 1 and 2), 666/19,414 (3.4%) in IQ-TREE and 436/19,414 (2.2%) in RAxML-NG yielded the same topology (nRFD = 0) but differed in their branch lengths (KF > 0), while the remaining 15,233/19,414 (78.5%) in IQ-TREE and 17,165/19,414 (88.5%) in RAxML-NG had identical topology (nRFD = 0) and branch lengths (KF = 0) (Supplementary Fig. 1a). In addition, the differences in branch lengths between Run1 and Run2 trees with the same topology were much smaller than those observed between trees that differed in their topologies (Supplementary Fig. 1b). Observed patterns of topological irreproducibility were very similar in two different supercomputing clusters at the University of Wisconsin-Madison and at Vanderbilt University (Fig. 2 and Supplementary Fig. 2, Supplementary Data 2 and 3).
Among the 15 phylogenomic data sets examined, the percentage of genes that produced topologically irreproducible phylogenetic trees varied between 0.12% and 47.28% (IQ-TREE) and between 0.09 and 33.47% (RAxML-NG) (Fig. 2). In 14/15 data sets, IQ-TREE had higher levels of gene tree irreproducibility than RAxML-NG (Fig. 2). To examine the degree to which the genes that produced topologically irreproducible trees inferred by the two programs overlapped, we compared IQ-TREE-inferred gene trees with RAxML-NG-inferred gene trees. We found that only 3940/19,414 (20.3%) gene alignments yielded topologically identical phylogenies in Run1 and Run2 of IQ-TREE and in Run1 and Run2 of RAxML-NG (Supplementary Fig. 3).
To examine whether the observed irreproducibility of gene trees resulted in significantly different topologies, we used the approximately unbiased (AU) test41 to evaluate whether the different topologies inferred in Run1 and Run2 analyses could equally explain the gene alignment (null hypothesis H0). We found that the Run1 and Run2 topologies for 302/3515 (8.59%) irreproducible single-gene ML phylogenies generated by IQ-TREE and 457/1813 (25.21%) irreproducible phylogenies generated by RAxML-NG were significantly different (AU test; P-value ≤ 0.05) (Supplementary Fig. 4). Among genes that yielded topologically irreproducible phylogenies, the percentage of those that reached significance in the AU test varied between 0.00 and 48% and between 0.00% and 59.26% across the 15 phylogenomic data sets examined in IQ-TREE and RAXML-NG (Supplementary Fig. 4), respectively.
Comparison of the Run1 and Run2 trees for the 3515 irreproducible gene phylogenies in IQ-TREE and for the 1813 irreproducible gene phylogenies in RAxML-NG (Fig. 3a, b and Supplementary Figs. 5–12) revealed considerable tree distance (average nRFD between Run1 and Run2 trees in IQ-TREE = 0.28; average nRFD in RAxML-NG = 0.34) (Fig. 3a and Supplementary Fig. 5) and log-likelihood score (average difference in log-likelihood scores between Run1 and Run2 in IQ-TREE = 1.09769; the average difference in log-likelihood scores between Run1 and Run2 in RAxML-NG = 0.15076) differences (Fig. 3b and Supplementary Fig. 6).
Phylogenetic inference is a linear workflow that includes a series of separate steps (e.g., data sampling, orthology identification, multiple sequence alignment, tree-building)42–44, with each step introducing uncertainty that can potentially affect the reproducibility of inference. For example, a recent study found that ML trees inferred by IQ-TREE and RAxML are more likely to be the optimal ones when more extensive tree searches are performed45. Examination of three representative phylogenomic data sets showed that the percentages of genes that produced reproducible phylogenies between two replicate runs when using 20 tree searches were highly similar to those when using 50 or 100 tree searches (Fig. 4), suggesting that the observed irreproducibility is over and above the uncertainty contributed by the heuristic nature of phylogenomic inference.
Low phylogenetic informativeness, multithreading, and processor type contribute to irreproducibility
To explore the underlying causes of the observed irreproducibility, we compared the characteristics of genes that yielded topologically irreproducible phylogenies (3515 in IQ-TREE and 1813 in RAxML-NG) to those that yielded topologically reproducible phylogenies (15,899 in IQ-TREE and 17,601 in RAxML-NG). We found that genes with lower phylogenetic informativeness (quantified by the percentage of parsimony-informative sites in gene alignment, alignment length, and branch support values) were substantially more likely to result in irreproducible phylogenies (Fig. 3c and Supplementary Figs. 7–9).
Specifically, genes whose Run1 and Run2 trees were topologically different had lower percentages of parsimony-informative sites (13% vs. 34% in IQ-TREE; 16% vs. 32% in RAxML-NG), shorter gene alignments (556 sites vs. 844 sites in IQ-TREE; 427 sites vs. 830 sites in RAxML-NG) and lower overall average bootstrap support values (58% vs. 71% in IQ-TREE; 25% vs. 50% in RAxML-NG), compared to genes whose Run1 and Run2 trees had the same topology (Fig. 3c and Supplementary Figs. 7, 8, and 9a). We further found that conflicting internal branches between the Run1 and Run2 trees of genes that yielded topologically irreproducible phylogenies received lower bootstrap support values (26% vs. 67% in IQ-TREE; 5% vs. 38% in RAxML-NG) than the congruent internal branches (Supplementary Fig. 9b). In contrast, the number of taxa in gene alignments had little impact on the irreproducibility of single-gene trees (Supplementary Fig. 10).
Examination of architectures of CPU processors revealed that genes run on two different types of processors (both programs can automatically detect the kernel instructions on current processor architecture to best exploit the capabilities of CPU processor) were more likely to result in topologically irreproducible phylogenies (Fig. 3d and Supplementary Fig. 11).
To test whether multithreading contributes to phylogenetic irreproducibility, we first assessed the reproducibility of single-gene phylogenies from 3819 genes from three large representative phylogenomic data sets on an increasing number of threads. We found that execution of Run1 and Run2 one right after the other on the same node yielded identical Run1 and Run2 tree topologies for all 3819 genes examined in both programs (Fig. 5a and Supplementary Data 4); we found the same result for both programs when using one or two thread(s) on the same node and for RAxML-NG when using up to five threads on the same node. In contrast, analyses using 3–5 threads on the same node with IQ-TREE yielded irreproducible single-gene trees for ~35.8% of 3819 genes (Fig. 5a, Supplementary Data 4). We obtained similar results when we executed Run1 and Run2 on a single laboratory server (Intel Xeon E5–2630 v3 @ 2.40 GHz processor with 16 threads) (Fig. 5b and Supplementary Data 4). These results suggest that multithreading using 3 or more threads contributes to irreproducibility in IQ-TREE but not in RAxML-NG.
The vast majority of phylogenomic analyses are performed across multiple nodes on supercomputing clusters that employ diverse processor types (rather than on the same node). To test the effect of multithreading on phylogenetic irreproducibility in this more realistic experimental design scenario, we executed Run1 and Run2 on two separate compute nodes (i.e., each analysis was run on a single node, but Run1 was executed on a different node than Run2) using an increasing number of threads. We found that the execution of Run1 and Run2 on two separate nodes resulted in an average irreproducibility of ~16.7% when using one or two thread(s) in IQ-TREE and RAxML-NG analyses (Fig. 5c). Interestingly, irreproducibility increased more than two-fold in IQ-TREE when using 3–5 threads (~35.8%), whereas irreproducibility in RAxML-NG analyses remained at similar levels (Fig. 5c and Supplementary Data 4). These results suggest that: (1) multithreading, coupled with the use of different nodes, is a major contributing factor to irreproducibility in IQ-TREE; and (2) the use of different nodes, but not multithreading, is a major contributing factor to irreproducibility in RAxML-NG.
Irreproducibility of coalescent- and concatenation-based phylogenomic inference
Since a considerable number of single genes yielded different Run1 and Run2 tree topologies, we examined the coalescent-based ASTRAL species phylogenies reconstructed from the Run1 and Run2 sets of individual gene trees inferred using either IQ-TREE or RAxML-NG. We found that 9/15 (60%) phylogenomic data sets produced topologically different coalescent-based ASTRAL species phylogenies (Table 1 and Supplementary Fig. 12). When considering both topology and branch support values together, we found that 11/15 (73.3%) phylogenomic data sets whose gene trees were inferred using IQ-TREE and 13/15 (87%) data sets whose gene trees were inferred using RAxML-NG yielded different coalescent-based ASTRAL species phylogenies (i.e., nRFD > 0 and/or a number of internal branches with different support value > 0).
Table 1.
Data set | Program | Coalescent-based ASTRAL species phylogenies (Run1 vs. Run2) | Concatenation-based ML species phylogenies (Run1 vs. Run2) | ||||
---|---|---|---|---|---|---|---|
Tree distance (%)a | Branch distanceb | Bipartitions with different support values (%)c | Tree distance (%)a | Branch distanceb | Bipartitions with different support values (%)c | ||
Animal: Bees | IQ-TREE | 22.5 | NA | NA | 0.0 | 1.46138E−07 | 2.7 |
Animal: Birds | IQ-TREE | 1.5 | NA | NA | 0.0 | 4.09E−09 | 1.5 |
Animal: Butterflies | IQ-TREE | 4.4 | NA | NA | 0.0 | 0.000283233 | 16.7 |
Animal: Lizards | IQ-TREE | 3.8 | NA | NA | 0.0 | 1.49E−07 | 0.0 |
Animal: Marine fishes | IQ-TREE | 6.8 | NA | NA | 0.0 | 1.03E−08 | 0.9 |
Animal: Rodents | IQ-TREE | 0.0 | NA | 8.8 | 0.0 | 2.83E−10 | 0.0 |
Plant: Cardueae | IQ-TREE | 4.9 | NA | NA | 0.0 | 2.45E−10 | 0.0 |
Plant: Caryophyllales | IQ-TREE | 0.0 | NA | 0.0 | 0.0 | 0.0 | 0.0 |
Plant: Green plants | IQ-TREE | 1.8 | NA | NA | 0.0 | 0.0 | NA |
Plant: Jaltomata | IQ-TREE | 0.0 | NA | 0.0 | 0.0 | 8.00E−10 | 0.0 |
Plant: Protea | IQ-TREE | 14.5 | NA | NA | 0.0 | 3.46E−10 | 0.0 |
Fungi: Aspergillaceae | IQ-TREE | 0.0 | NA | 0.0 | 0.0 | 1.48E−07 | 0.0 |
Fungi: Budding yeasts | IQ-TREE | 0.0 | NA | 1.8 | 0.0 | 0.0 | 0.0 |
Fungi: Hanseniaspora | IQ-TREE | 0.0 | NA | 0.0 | 0.0 | 0.0 | 0.0 |
Fungi: Rhizoplaca | IQ-TREE | 10.7 | NA | NA | 0.0 | 3.32E−10 | 0.0 |
Animal: Bees | RAxML-NG | 8.6 | NA | NA | 0.0 | 0.0 | 0.0 |
Animal: Birds | RAxML-NG | 1.5 | NA | NA | 0.0 | 0.0 | 0.0 |
Animal: Butterflies | RAxML-NG | 2.0 | NA | NA | 0.0 | 0.0 | 0.0 |
Animal: Lizards | RAxML-NG | 0.0 | NA | 30.8 | 0.0 | 0.0 | 0.0 |
Animal: Marine fishes | RAxML-NG | 4.3 | NA | NA | 0.0 | 0.0 | 0.0 |
Animal: Rodents | RAxML-NG | 0.0 | NA | 5.9 | 0.0 | 0.0 | 0.0 |
Plant: Cardueae | RAxML-NG | 8.5 | NA | NA | 0.0 | 0.0 | 0.0 |
Plant: Caryophyllales | RAxML-NG | 16.3 | NA | NA | 0.0 | 0.0 | 0.0 |
Plant: Green plants | RAxML-NG | 0.7 | NA | NA | 0.0 | 0.0 | 0.0 |
Plant: Jaltomata | RAxML-NG | 0.0 | NA | 8.3 | 0.0 | 0.0 | 0.0 |
Plant: Protea | RAxML-NG | 21.0 | NA | NA | 0.0 | 0.0 | 0.0 |
Fungi: Aspergillaceae | RAxML-NG | 0.0 | NA | 0.0 | 0.0 | 0.0 | 0.0 |
Fungi: Budding yeasts | RAxML-NG | 0.0 | NA | 0.9 | 0.0 | 0.0 | NA |
Fungi: Hanseniaspora | RAxML-NG | 0.0 | NA | 0.0 | 0.0 | 0.0 | 0.0 |
Fungi: Rhizoplaca | RAxML-NG | 3.6 | NA | NA | 0.0 | 0.0 | 0.0 |
For each data set, coalescent-based ASTRAL trees were reconstructed from the Run1 and Run2 sets of individual gene trees; both Run1 and Run2 used identical settings, including substitution model, random starting seed number, number of threads of execution, number of independent tree searches, and ML program; concatenation-based ML trees were inferred twice from the supermatrix using IQ-TREE and RAxML-NG with identical settings.
aPercentage of bipartitions (or internal branches) that differ between two inferred species trees was quantified the normalized Robinson–Foulds tree distance.
bBranch distance between two inferred species trees was computed by the branch score distance of Kuhner and Felsenstein with the R packages ape and phangorn.
cThe percentage of bipartitions (or internal branches) that received different bootstrap support values between two inferred species trees that were topologically identical (i.e., tree distance is 0). When topologies, branch lengths, or internal branch support values between two inferred phylogenies are identical, their estimated values are zero and are shown in bold. “NA” denotes “not applicable” due to either lack of external branch lengths in a coalescent-based ASTRAL tree, different topologies between two inferred species trees, or lack of standard bootstrap support values in the RAxML-NG analyses of the two largest data sets (plant: green plants and fungi: budding yeasts) due to computation cost.
To examine the effects of removing poorly supported bipartitions from gene trees on the reproducibility of coalescent-based ASTRAL species phylogenies, we next collapsed branches with low bootstrap support values (≤50%) for Run1 and Run2 gene trees, and then used these partially multifurcating genes trees to infer coalescent-based ASTRAL species phylogenies. We found that collapsing branches with low bootstrap support values eliminated the irreproducibility of coalescent-based ASTRAL species phylogenies for three and four phylogenomic data sets when their gene trees were inferred by IQ-TEE and RAxML-NG, respectively, but eight phylogenomic data sets (IQ-TREE) and seven phylogenomic data sets (RAxML-NG) still yielded topologically different ASTRAL species phylogenies (Table 2). These results suggest that the observed irreproducibility of coalescent-based ASTRAL species phylogenies remains even after we account for low phylogenetic informativeness.
Table 2.
Data set | Program | Without collapsing branches | With collapsing branches | ||
---|---|---|---|---|---|
Conflicting bipartitions (%)a | Highly conflicting bipartitions (%)b | Conflicting bipartitions (%)a | Highly conflicting bipartitions (%)b | ||
Animal: Bees | IQ-TREE | 22.46 | 1.87 | 18.18 | 1.60 |
Animal: Birds | IQ-TREE | 6.09 | 0 | 6.60 | 0 |
Animal: Butterflies | IQ-TREE | 7.35 | 0.49 | 5.39 | 0.74 |
Animal: Lizards | IQ-TREE | 7.69 | 0 | 0 | 0 |
Animal: Marine fishes | IQ-TREE | 7.69 | 0 | 13.68 | 0 |
Animal: Rodents | IQ-TREE | 0 | 0 | 0 | 0 |
Plant: Cardueae | IQ-TREE | 12.20 | 0 | 12.20 | 0 |
Plant: Caryophyllales | IQ-TREE | 0 | 0 | 0 | 0 |
Plant: Green plants | IQ-TREE | 5.70 | 0.38 | 5.53 | 0.55 |
Plant: Jaltomata | IQ-TREE | 8.33 | 0 | 0 | 0 |
Plant: Protea | IQ-TREE | 14.52 | 0 | 3.23 | 0 |
Fungi: Aspergillaceae | IQ-TREE | 0 | 0 | 0 | 0 |
Fungi: Budding yeasts | IQ-TREE | 0.29 | 0 | 0.29 | 0 |
Fungi: Hanseniaspora | IQ-TREE | 0 | 0 | 0 | 0 |
Fungi: Rhizoplaca | IQ-TREE | 3.57 | 0 | 0 | 0 |
Animal: Bees | RAxML-NG | 27.27 | 1.87 | 8.02 | 0 |
Animal: Birds | RAxML-NG | 4.06 | 0 | 0 | 0 |
Animal: Butterflies | RAxML-NG | 6.86 | 0.49 | 6.86 | 0 |
Animal: Lizards | RAxML-NG | 19.23 | 0 | 0 | 0 |
Animal: Marine fishes | RAxML-NG | 3.42 | 0 | 5.98 | 0 |
Animal: Rodents | RAxML-NG | 0 | 0 | 0 | 0 |
Plant: Cardueae | RAxML-NG | 12.20 | 0 | 3.66 | 0 |
Plant: Caryophyllales | RAxML-NG | 0 | 0 | 0 | 0 |
Plant: Green plants | RAxML-NG | 0.26 | 0 | 1.02 | 0.09 |
Plant: Jaltomata | RAxML-NG | 8.33 | 0 | 0 | 0 |
Plant: Protea | RAxML-NG | 14.52 | 0 | 8.06 | 0 |
Fungi: Aspergillaceae | RAxML-NG | 0 | 0 | 0 | 0 |
Fungi: Budding yeasts | RAxML-NG | 0.29 | 0 | 0.59 | 0 |
Fungi: Hanseniaspora | RAxML-NG | 0 | 0 | 0 | 0 |
Fungi: Rhizoplaca | RAxML-NG | 3.57 | 0 | 0 | 0 |
Since running all 19,414 gene alignments from 15 phylogenomic data sets was computationally intractable, we sampled the first 100 genes from each data set. For each data set, coalescent-based ASTRAL trees were reconstructed from the Run1 and Run2 sets of 100 individual gene trees without and with collapsing branches with low bootstrap support values (≤50%); both Run1 and Run2 used identical settings, including substitution model, random starting seed number, number of threads of execution, number of independent tree searches, number of bootstrap replicates, and ML program.
aPercentage of conflicting bipartitions between coalescent-based ASTRAL species phylogenies inferred using Run1 and Run2 gene trees.
bPercentage of highly conflicting bipartitions (LPP ≥ 90%) between coalescent-based ASTRAL species phylogenies inferred using Run1 and Run2 gene trees.
We also examined whether concatenation-based ML trees that were inferred twice (Run1 and Run2) from the supermatrix using either IQ-TREE or RAxML-NG with identical settings were reproducible. We found that 15/15 phylogenomic data sets produced topologically identical concatenation-based ML species phylogenies (Table 1 and Supplementary Fig. 13). All phylogenomic data sets analyzed by RAxML-NG yielded phylogenies whose topologies, branch lengths, and branch support values were identical between Run1 and Run2 replicates. In contrast, only 4/15 (26%) phylogenomic data sets analyzed by IQ-TREE yielded phylogenies whose topologies, branch lengths, and branch support values were identical between Run1 and Run2 replicates. Whether coalescent-based phylogenetic inference or concatenation-based phylogenetic inference of species phylogenies is more reliable continues to be debated46–48. These results suggest that species phylogenies inferred using the coalescent-based approach, which relies on separately estimated gene trees, are more likely to be irreproducible than species phylogenies inferred using the concatenation-based approach, which relies on the supermatrix of gene alignments.
The genes that yield irreproducible phylogenies are more likely to be incorrect
Since the true species and single-gene phylogenies for the 15 empirical phylogenomic data sets are unknown, it is impossible to assess whether irreproducible phylogenies are more or less similar to the true phylogeny than reproducible ones. To address this question, we simulated DNA sequence alignments on 15 balanced trees and 15 star trees, both with 64 taxa. Each tree was scaled by branch length α (α = 0.001, 0.002, 0.003, 0.004, 0.005, 0.006, 0.007, 0.008, 0.009, 0.01, 0.02, 0.04, 0.06, 0.08, or 0.1), respectively; trees with larger α values had higher rates of substitutions per site and, consequently, higher average numbers of parsimony-informative sites (Fig. 6a, b). We then used each of these 15 balanced and 15 star trees to simulate 500 nucleotide sequence alignments that varied in length under the GTR + G4 model (detailed parameters are given in the file entitled “Seq_Gen_run.bat” on the figshare repository: 10.6084/m9.figshare.11917770) using Seq-Gen.v1.3.249, generating a total of 15,000 DNA sequence alignments.
Analysis of these 15,000 simulated DNA sequence alignments showed that the percentage of genes yielding irreproducible phylogenies decreased with increasing α values (Fig. 6c and Supplementary Data 5), a result in agreement with the observation from analysis of the 15 empirical phylogenomic data sets that genes producing irreproducible phylogenies tended to contain lower percentages of parsimony-informative sites (Fig. 3c). By comparing the 60,000 gene trees (15,000 gene alignments * 2 replicates * 2ML programs) against the reference tree used to simulate each gene alignment, we found that the 6104/60,000 (10%) irreproducible gene trees have three times higher average tree distance than the 53,896/60,000 (90%) reproducible gene trees (irreproducible gene phylogenies: average nRFD = 0.485 vs. reproducible gene phylogenies: average nRFD = 0.147) when using two threads per node (Fig. 6d and Supplementary Fig. 14). We observed a similar magnitude of gene tree estimation error (even though irreproducibility for IQ-TREE was two-fold higher) when using three threads per node (irreproducible gene phylogenies: average nRFD = 0.483 vs. reproducible gene phylogenies: average nRFD = 0.133) (Supplementary Data 5).
Discussion
In this study, we found that ~9 to ~18% of single-gene phylogenies in 15 phylogenomic data sets were topologically irreproducible when analyzed by two widely used ML programs on a supercomputing cluster (Figs. 1 and 2). In addition to sequence alignment, program, substitution model, number of tree searches, and random starting seed number, which are known contributors, we further found that low phylogenetic informativeness, processor type, and multithreading contribute to the observed irreproducibility, with the effects of multithreading being program-specific.
Why did genes with low phylogenetic informativeness (e.g., a low percentage of parsimony-informative sites in gene alignment or lower average bootstrap support) more frequently fail to reproduce their topologies when running on different processor types (i.e., on processors with different kernel instructions) than highly informative genes (Fig. 3c, d and Supplementary Fig. 9a)? To achieve optimal performance, both IQ-TREE and RAxML-NG can automatically detect the kernel instruction on current processor architecture50 to best exploit the capabilities of the CPU processor. Therefore, different processor architectures can result in otherwise identical replicates yielding different phylogenies with different log-likelihood values. While these differences in topology and likelihood are not generally sufficient to affect reproducibility in genes with high phylogenetic informativeness (Figs. 3c and 6c), our results suggest that they can have a dramatic effect on genes with low phylogenetic informativeness (Fig. 6d). Consistent with this explanation, irreproducibility was much higher (25.2%) in the eight data sets constructed using ultraconserved element (UCE) capture51, Anchored Hybrid Enriched (AHE) capture52, or conserved exon capture53 approaches, which tend to generate short alignments of highly conserved gene regions, than in the remaining seven studies (8.5%) (Supplementary Data 1 and 2). More broadly, data sets constructed from genes or regions of low phylogenetic informativeness and approaches biased toward including such regions may be particularly vulnerable to irreproducibility.
In contrast, phylogenetic trees of gene alignments executed on the same processor type (using one or two threads in IQ-TREE and any number in RAxML-NG) are reproducible (Fig. 5a, b). However, processor types vary both within, as well as between, supercomputing clusters. Thus, even if a study specified the processor type(s) used for inference, it may not always be straightforward (especially when new generations of processor types replace older ones) to reproduce results. Different containers (e.g., BIOS version, microarchitecture version, operating system, compiler manufacturer) could potentially influence the compilation of ML program, further complicating reproducibility. Although irreproducibility can be eliminated in RAxML-NG by turning off the kernel auto-detection option (with the “–simd none” command; the current version of IQ-TREE does not offer this option), this results in substantially longer runtimes (average 2.4-fold increase in runtime; Supplementary Fig. 15).
Why did IQ-TREE have larger numbers of irreproducible phylogenies when using three or more threads, even when running on the same processor type (Fig. 5a, b)? This is likely because different orders of commutative addition of the per-site log-likelihoods when using three or more threads in IQ-TREE could result in two different phylogenies with different log-likelihood values. Consistent with this explanation, irreproducibility in RAxML-NG, which accounts for the difference of addition orders of the per-site log likelihoods54,55, is not influenced by the use of three or more threads on the same processor (Fig. 5a, b).
Many previous studies have shown that most published gene alignments used to infer phylogenetic trees are inaccessible or have been permanently lost22,24,26–30, effectively rendering these trees irreproducible (scenario I; Fig. 7). These studies have convincingly shown that the availability of gene alignments, phylogenetic trees, and key parameter settings (e.g., substitution model, number of tree searches, random starting seed number) can greatly improve the reproducibility of phylogenetic inference (scenario II; Fig. 7). The random starting seed number is a well-known contributor to uncertainty in tree inference in heuristic searches (scenarios III and IV; Fig. 7). Our study further shows that reproducibility of single-gene ML tree is also affected by processor type and multithreading, sometimes in a program-specific way (scenarios V–VIII; Fig. 7). Comparison of these scenarios allows assessment of the relative contribution of different parameters to irreproducibility. For example, a comparison of scenario III in Fig. 7, where all parameters except random starting seed number are identical between Run1 and Run2, against scenario IV, where all parameters are identical between the two replicates except a number of threads and processor, shows that random starting seed number differences lead to much lower reproducibility than differences in architecture and number of processors.
What is the impact of the single-gene tree and species tree irreproducibility that we observed in ML analyses in phylogenetic inference in general? The observed differences in the topologies of single-gene ML trees between replicate analyses were not trivial. At the level of single genes, we found that a considerable fraction of single-gene trees were different in their topologies between two runs with identical settings (Figs. 1 and 2), often significantly so (Supplementary Fig. 4), which could change the outcomes of analyses from phylogenetic programs that employ single-gene phylogenetic trees, such as ASTRAL56,57, ModelTest-NG58, Notung59, and OrthoFinder60.
At the level of phylogenomic inference, we found that the use of Run1 or Run2 gene trees was sufficient to change the ASTRAL species phylogeny inferred under a coalescent-based framework for several phylogenomic data sets (Tables 1 and 2). Importantly, collapsing of branches with low bootstrap support in individual gene trees reduced irreproducibility in species tree inference (Table 2). It is also important to emphasize that while IQ-TREE and RAxML-NG are widely used maximum likelihood programs, they are not the only ones. Whether other ML programs, such as FastTree61, GARLI62, MEGA63, and PhyML64, also exhibit irreproducibility, whether irreproducibility extends for other approaches, such as parsimony or Bayesian inference, and the impact of the observed irreproducibility in phylogenetic biology in general, are all topics that deserve further examination.
How can we increase the reproducibility of phylogenetic inference? One potential solution would be the mandatory reporting of not only sequence alignment (see also the recent commentary by Salomaki et al.23), program, substitution model, and number of independent tree searches, but also of random starting seed numbers, number of threads, and processor type used (Supplementary Note 2). However, the benefits need to be weighed against the practical difficulty of implementing this solution for the hundreds or thousands of gene alignments present in current phylogenomic data sets. Moving forward, a more practical alternative may be the releasing of the log file of each analysis, which contain a record of the values of all these key parameters (e.g., alignment, program name, number of tree searches, substitution model, type of processor, number of threads, and random starting seed).
Methods
Empirical phylogenomic data sets
To assess the reproducibility of phylogenetic trees generated by individual genes, we retrieved 19,414 gene alignments from 15 phylogenomic studies in animals (6), plants (5), and fungi (4) (Supplementary Data 1). These 15 data sets were constructed using five widely accepted gene sampling approaches: Ultraconserved Element (UCE) capture, Anchored Hybrid Enriched (AHE) capture, conserved exon capture, transcriptome sequencing, and whole-genome sequencing. The 15 data sets comprise non-coding DNA (DNA), exon (DNA), and amino acid (AA) sequence alignments. The number of genes in these data sets ranges from 259 to 6431 with an average value of 1294; their number of taxa ranges from 15 to 1178 with an average value of 181. Finally, we note that this set of 15 data sets includes the largest available phylogenomic data sets in animals (Marine fishes: 1001 genes and 120 taxa from Alfaro et al.65), plants (Green plants: 410 genes and 1178 taxa from 1KP Initiative66), and fungi (budding yeasts: 2408 genes and 343 taxa from Shen et al.16). All gene alignments in FASTA form can be found on the figshare repository: 10.6084/m9.figshare.11917770.
Assessment of reproducibility of single-gene phylogenetic trees
Irreproducibility may manifest itself as a failure to reproduce published experiments (one’s own experiments or ones performed by others). Assessing the reproducibility of published analyses in phylogenetics is extremely challenging because most published studies do not report the specific settings for key parameters (e.g., random starting seed number, number of threads of execution). Therefore, we focused on assessing whether we could reproduce our own results. Specifically, for each of 19,414 gene alignments, we utilized two replicates (Run1 and Run2) to assess whether the phylogenetic tree inferred by Run1 is topologically identical to the tree inferred by Run2 (Fig. 1). To take into account variation that may stem from different tree rearrangement algorithms used in heuristic searches, we used both the NNI-based IQ-TREE multi-thread version 1.6.831 and the SPR-based RAxML-NG multi-thread version 0.9.032 were used to infer a single-gene ML tree.
For nucleotide sequence alignments, we used the GTR + G4 + F substitution model; for amino acid sequence alignments, we used the best-fitting substitution model reported in the original study, which can be found on the figshare repository: 10.6084/m9.figshare.11917770. The two replicates used exactly the same parameter settings on the ML program used for inference, including gene alignment, program, substitution model, random starting seed number, number of threads (2), number of tree searches (20), and log-likelihood epsilon for optimization (0.0001).
Below are two specific examples of the specific command line instructions and parameter settings for the two replicates (Run1 and Run2) in IQ-TREE and RAxML-NG for a DNA sequence alignment (dna.fasta) and an amino acid alignment (aa.fasta):
DNA sequence alignment (dna.fasta):
iqtree -s dna.fasta -st DNA -m GTR + G4 + F -seed 4760742 -nt 2–runs 20 -me 0.0001 -pre iqtree_dna_Run1
iqtree -s dna.fasta -st DNA -m GTR + G4 + F -seed 4760742 -nt 2–runs 20 -me 0.0001 -pre iqtree_dna_Run2
raxml-ng–msa dna.fasta–search -msa-format FASTA–model GTR + G4 + F -seed 967956542–threads 2–tree pars{10},rand{10}–lh-epsilon 0.0001–prefix raxml-ng_dna_Run1
raxml-ng–msa dna.fasta–search -msa-format FASTA–model GTR + G4 + F -seed 967956542–threads 2–tree pars{10},rand{10}–lh-epsilon 0.0001–prefix raxml-ng_dna_Run2
Amino acid alignment (aa.fasta):
iqtree -s aa.fasta -st AA -m LG + G4 -seed 529418945 -nt 2–runs 20 -me 0.0001 -pre iqtree_aa_Run1
iqtree -s aa.fasta -st AA -m LG + G4 -seed 529418945 -nt 2–runs 20 -me 0.0001 -pre iqtree_aa_Run2
raxml-ng–msa aa.fasta–search -msa-format FASTA–model LG + G4 -seed 652954101–threads 2–tree pars{10},rand{10}–lh-epsilon 0.0001–prefix raxml-ng_aa_Run1
raxml-ng–msa aa.fasta–search -msa-format FASTA–model LG + G4 -seed 652954101–threads 2–tree pars{10},rand{10}–lh-epsilon 0.0001–prefix raxml-ng_aa_Run2
Overall, we executed 77,656 jobs (19,414 alignments * 2 replicates * 2 ML programs). Each job was run on a single node with 2 threads and 1 GB RAM on the Center for High-Throughput Computing (CHTC) at the University of Wisconsin-Madison (see command lines and job submission file in the Supplementary Note 1). In addition to the CHTC, we also ran these 77,656 jobs on the Advanced Computing Center for Research and Education (ACCRE) at Vanderbilt University.
All our tree topology comparisons used the normalized Robinson–Foulds37 tree distance (nRFD), which we calculated using RAxML, version 8.2.367 (see command lines in Supplementary Note 1). For a given gene alignment, we considered that its tree was reproducible if the trees inferred from two replicates (Run1 and Run2) were topologically identical (i.e., nRFD = 0); in contrast, we considered the inferred tree irreproducible if the gene trees inferred from two replicates (Run1 and Run2) were topologically different from each other (i.e., nRFD > 0). Note that the reproducibility of each single-gene ML tree was only assessed by the same ML program (IQ-TREE or RAxML).
Assessment of reproducibility of coalescent- and concatenation-based species trees
For each of the 15 phylogenomic studies, we reconstructed their coalescent-based species trees from four sets of individual gene trees (iqtree_run1, iqtree_run2, raxml:ng_run1, and raxml:ng_run2) with ASTRAL version 5.6.356,57. The reliability of each internal branch was evaluated using local posterior probability (LPP).
For a given phylogenomic study Bee, we obtained four sets of gene trees: Bee_iqtree_run1.genetrees, Bee_iqtree_run2.genetrees, Bee_raxml-ng_run1.genetrees, and Bee_raxml-ng_run2.genetrees. We used these four set to calculate their species trees using the following commands:
java -jar astral.jar -i Bee_iqtree_run1.genetrees -o Bee_iqtree_run1_lpp.tree
java -jar astral.jar -i Bee_iqtree_run2.genetrees -o Bee_iqtree_run2_lpp.tree
java -jar astral.jar -i Bee_raxml-ng_run1.genetrees -o Bee_raxml-ng_run1_lpp.tree
java -jar astral.jar -i Bee_raxml-ng_run2.genetrees -o Bee_raxml-ng_run2_lpp.tree
Concatenation-based ML trees were inferred twice (Run1 and Run2) from the supermatrix using either IQ-TREE or RAxML-NG with identical settings. The reliability of each internal branch was evaluated using 1000 ultrafast bootstrap replicates and 100 standard bootstrap replicates for IQ-TREE analysis and RAxML-NG, respectively. Below are two specific examples of the specific command line instructions and parameter settings for the two concatenation replicates (Run1 and Run2) in IQ-TREE and RAxML-NG for a DNA sequence alignment (dna.fasta) and an amino acid alignment (aa.fasta):
DNA sequence alignment (dna.fasta):
iqtree–runs 1 -nt 10 -st DNA -seed 369284957 -me 0.0001 -s dna.fasta -m GTR + G4 + F -bb 1000 -pre iqtree_dna_Run1
iqtree–runs 1 -nt 10 -st DNA -seed 369284957 -me 0.0001 -s dna.fasta -m GTR + G4 + F -bb 1000 -pre iqtree_dna_Run2
raxml-ng–force–all–threads 10–lh-epsilon 0.0001–seed 369284957–tree pars{1}–msa dna.fasta -msa-format FASTA–model GTR + G4 + F–bs-trees 100–prefix raxml-ng_dna_Run1
raxml-ng–force–all–threads 10–lh-epsilon 0.0001–seed 369284957–tree pars{1}–msa dna.fasta -msa-format FASTA–model GTR + G4 + F–bs-trees 100–prefix raxml-ng_dna_Run2
Amino acid alignment (aa.fasta):
iqtree–runs 1 -nt 10 -st AA -seed 369284957 -me 0.0001 -s aa.fasta -m LG + G4 -bb 1000 -pre iqtree_aa_Run1
iqtree–runs 1 -nt 10 -st AA -seed 369284957 -me 0.0001 -s aa.fasta -m LG + G4 -bb 1000 -pre iqtree_aa_Run2
raxml-ng–force–all–threads 10–lh-epsilon 0.0001–seed 369284957–tree pars{1}–msa aa.fasta -msa-format FASTA–model LG + G4–bs-trees 100–prefix raxml-ng_aa_Run1
raxml-ng–force–all–threads 10–lh-epsilon 0.0001–seed 369284957–tree pars{1}–msa aa.fasta -msa-format FASTA–model LG + G4–bs-trees 100–prefix raxml-ng_aa_Run2
Note that for the larger phylogenomic data sets (e.g., green plants: 410 genes and 1178 taxa from 1KP Initiative66; and budding yeasts: 2408 genes and 343 taxa from Shen et al.16), we used 32 threads instead of 10 threads (detailed parameters can be found in the log files on the figshare repository: 10.6084/m9.figshare.11917770).
Impact of multithreading and processor types on gene tree reproducibility
When the number of threads is not specified, IQ-TREE will automatically determine the best number of threads on the processor according to the length of the gene alignment and RAxML-NG will use all of the available cores on the processor. In addition, IQ-TREE and RAxML-NG can automatically detect the best kernel instruction on processor architecture to optimize the performance of the tree search, but different types of processor architectures can result in different kernel instructions. Therefore, we investigated whether increasing the number of threads and using different processor types affect the reproducibility of gene trees inferred by IQ-TREE and RAxML-NG. Because these analyses are computationally demanding, we performed them using a set of 3819 gene alignments from three large representative studies in animals (marine fishes: 1001 genes65), plants (green plants: 410 genes66), fungi (budding yeasts: 2408 genes16). Specifically:
-
(i)
For each of the 3819 gene alignments, two replicates (Run1 and Run2) were submitted to a single node (two replicates ran one right after the other on the same node) for 1, 2, 3, 4, and 5 thread(s), respectively. The total number of jobs executed on the CHTC cluster was 38,190 (3819 genes * 1 node (it contains 2 replicates) * 5 threading data points * 2ML programs) (see command lines and job submission file in Supplementary Note 1).
-
(ii)
Since the analysis of phylogenomic data sets on a laboratory server is computationally intractable, we sampled the first 200 genes from each of the three data sets. For each of these 600 gene alignments, we ran two replicates (Run1 and Run2) on a laboratory server (Intel Xeon E5–2630 v3 @ 2.40 GHz processor with 16 threads) for 2 and 3 threads, respectively. All 3600 analyses (600 genes * 2 replicates * 2 threading data points * 2ML programs) were executed one right after the other on the server.
-
(iii)
For each of the 3819 gene alignments, two replicates (Run1 and Run2) were submitted to two separate nodes (i.e., each analysis was run on a single node, but Run1 was executed on a different node than Run2) for 1, 2, 3, 4, and 5 thread(s), respectively. The total number of jobs executed on the CHTC cluster was 76,380 (3819 genes * 2 nodes (each contains 1 replicate) * 5 threading data points * 2ML programs) (see command lines and job submission file in Supplementary Note 1).
Using simulated data to examine the accuracy of gene tree estimation for genes that yield irreproducible phylogenies
To investigate the accuracy of gene tree estimation for genes whose phylogenies are irreproducible, we first generated 15 balanced trees and 15 star trees, both with 64 taxa, each of which was scaled by branch length α (α = 0.001, 0.002, 0.003, 0.004, 0.005, 0.006, 0.007, 0.008, 0.009, 0.01, 0.02, 0.04, 0.06, 0.08, or 0.1) (Fig. 6a, b), respectively. Next, each reference species tree of 64 taxa was used to generate 500 nucleotide gene alignments with varying length (randomized to be between 300 and 1000 base pairs) using Seq-Gen.v1.3.249 under the GTR + G4 model, shape for the gamma rate heterogeneity =1, proportion of invariable sites=0, and equal state frequency (-mGTR -a1 -g4 -i0 -f0.25,0.25,0.25,0.25 –l random length -n1 –z random seed) (detailed parameters are given in the file entitled “Seq_Gen_run.bat” on the figshare repository: 10.6084/m9.figshare.11917770).
For each simulated gene alignment, two replicates (Run1 and Run2) were executed on two separate nodes (i.e., each analysis was run on a single node, but Run1 was executed on a different node than Run2) using 2 threads on the CHTC cluster. Reproducibility of the resulting gene trees of the two replicates was assessed with RAxML, version 8.2.3. Furthermore, we calculated gene tree estimation error as the average of the nRFD values between each of the Run1 and Run2 gene trees and the reference species tree.
Reporting summary
Further information on research design is available in the Nature Research Reporting Summary linked to this article.
Supplementary information
Acknowledgements
We thank members of the Rokas lab and in particular Jacob Steenwyk, for helpful discussions and comments. This work was conducted in part using the resources of the Center for High-Throughput Computing (CHTC) at the University of Wisconsin-Madison and of the Advanced Computing Center for Research and Education (ACCRE) at Vanderbilt University. X.-X.S. was supported by the National Natural Science Foundation of China (No. 32071665) and the Fundamental Research Funds for the Central Universities (No. 2020QNA6019). C.T.H. was supported by the National Science Foundation (DEB-1442148), the USDA National Institute of Food and Agriculture (Hatch Project No. 1020204), in part by the DOE Great Lakes Bioenergy Research Center (DOE BER Office of Science No. DE-SC0018409), the Pew Charitable Trusts (Pew Scholar in the Biomedical Sciences), and the Office of the Vice-Chancellor for Research and Graduate Education with funding from the Wisconsin Alumni Research Foundation (H. I. Romnes Faculty Fellow). X.-x.C. was supported by the Key International Joint Research Program of National Natural Science Foundation of China (No. 31920103005) and General Program of National Science Foundation of China (No. 31702035). A.R. was supported by the National Science Foundation (DEB-1442113), the National Institutes of Health/National Institute of Allergy and Infectious Diseases (1R56AI146096-01A1), the Guggenheim Foundation, and the Burroughs Wellcome Fund.
Author contributions
Study conception and design: X.-X.S. and A.R.; acquisition of data: X.-X.S.; analysis and interpretation of data: X.-X.S., L.Y., C.T.H., X.-x.C., and A.R.; drafting of manuscript: X.-X.S. and A.R.; critical revision: X.-X.S., C.T.H., X.-x.C., and A.R.
Data availability
All gene alignments, gene trees, log files, and command lines, as well as summary and statistics of the runs, are available on the figshare repository: 10.6084/m9.figshare.11917770.
Competing interests
The authors declare no competing interests.
Footnotes
Peer review information Nature Communications thanks Christophe Dessimoz, Barbara Holland and the other, anonymous, reviewer(s) for their contribution to the peer review of this work. Peer reviewer reports are available.
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Contributor Information
Xing-Xing Shen, Email: xingxingshen@zju.edu.cn.
Antonis Rokas, Email: antonis.rokas@vanderbilt.edu.
Supplementary information
Supplementary information is available for this paper at 10.1038/s41467-020-20005-6.
References
- 1.Baker M. 1,500 scientists lift the lid on reproducibility. Nature. 2016;533:452–454. doi: 10.1038/533452a. [DOI] [PubMed] [Google Scholar]
- 2.McNutt M. Reproducibility. Science. 2014;343:229–229. doi: 10.1126/science.1250475. [DOI] [PubMed] [Google Scholar]
- 3.Ioannidis JPA. Why most published research findings are false. PLoS Med. 2005;2:e124. doi: 10.1371/journal.pmed.0020124. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 4.Camerer CF, et al. Evaluating replicability of laboratory experiments in economics. Science. 2016;351:1433–1436. doi: 10.1126/science.aaf0918. [DOI] [PubMed] [Google Scholar]
- 5.Camerer CF, et al. Evaluating the replicability of social science experiments in Nature and Science between 2010 and 2015. Nat. Hum. Behav. 2018;2:637–644. doi: 10.1038/s41562-018-0399-z. [DOI] [PubMed] [Google Scholar]
- 6.Open Science Collaboration. Estimating the reproducibility of psychological science. Science349, aac4716 (2015). [DOI] [PubMed]
- 7.Bergman RG, Danheiser RL. Reproducibility in chemical research. Angew. Chem. Int. Ed. 2016;55:12548–12549. doi: 10.1002/anie.201606591. [DOI] [PubMed] [Google Scholar]
- 8.Chen X, et al. Open is not enough. Nat. Phys. 2019;15:113–119. doi: 10.1038/s41567-018-0342-2. [DOI] [Google Scholar]
- 9.Jarvis MF, Williams M. Irreproducibility in preclinical biomedical research: perceptions, uncertainties, and knowledge gaps. Trends Pharmacol. Sci. 2016;37:290–302. doi: 10.1016/j.tips.2015.12.001. [DOI] [PubMed] [Google Scholar]
- 10.Lawrence MS, et al. Mutational heterogeneity in cancer and the search for new cancer-associated genes. Nature. 2013;499:214–218. doi: 10.1038/nature12213. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 11.Felsenstein, J. Inferring Phylogenies (Sinauer Associates, 2003).
- 12.Hamilton, A. The Evolution of Phylogenetic Systematics (Species and Systematics) (University of California Press, 2014).
- 13.Yang, Z. Molecular Evolution: A Statistical Approach (Oxford University Press, 2014).
- 14.Hillis, D., Moritz, C. & Mable, B. K. Molecular Systematics 2nd edn (Sinauer Associates, 1996).
- 15.Slot JC, Rokas A. Horizontal transfer of a large and highly toxic secondary metabolic gene cluster between fungi. Curr. Biol. 2011;21:134–139. doi: 10.1016/j.cub.2010.12.020. [DOI] [PubMed] [Google Scholar]
- 16.Shen X-X, et al. Tempo and mode of genome evolution in the budding yeast subphylum. Cell. 2018;175:1533–1545. doi: 10.1016/j.cell.2018.10.023. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 17.Hug LA, et al. A new view of the tree of life. Nat. Microbiol. 2016;1:1–6. doi: 10.1038/nmicrobiol.2016.48. [DOI] [PubMed] [Google Scholar]
- 18.Bentz C, Dediu D, Verkerk A, Jäger G. The evolution of language families is shaped by the environment beyond neutral drift. Nat. Hum. Behav. 2018;2:816–821. doi: 10.1038/s41562-018-0457-6. [DOI] [PubMed] [Google Scholar]
- 19.Mühlemann B, et al. Ancient hepatitis B viruses from the Bronze Age to the Medieval period. Nature. 2018;557:418–423. doi: 10.1038/s41586-018-0097-z. [DOI] [PubMed] [Google Scholar]
- 20.Schuenemann VJ, et al. Genome-wide comparison of medieval and modern Mycobacterium leprae. Science. 2013;341:179–183. doi: 10.1126/science.1238286. [DOI] [PubMed] [Google Scholar]
- 21.Gray RD, Drummond AJ, Greenhill SJ. Language phylogenies reveal expansion pulses and pauses in pacific settlement. Science. 2009;323:479–483. doi: 10.1126/science.1166858. [DOI] [PubMed] [Google Scholar]
- 22.Drew BT, et al. Lost branches on the tree of life. PLoS Biol. 2013;11:e1001636. doi: 10.1371/journal.pbio.1001636. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 23.Salomaki ED, Eme L, Brown MW, Kolisko M. Releasing uncurated datasets is essential for reproducible phylogenomics. Nat. Ecol. Evol. 2020 doi: 10.1038/s41559-020-01296-w. [DOI] [PubMed] [Google Scholar]
- 24.Roche DG, Kruuk LEB, Lanfear R, Binning SA. Public data archiving in ecology and evolution: how well are we doing? PLoS Biol. 2015;13:e1002295. doi: 10.1371/journal.pbio.1002295. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 25.Christensen G, Dafoe A, Miguel E, Moore DA, Rose AK. A study of the impact of data sharing on article citations using journal policies as a natural experiment. PLoS ONE. 2019;14:e0225883. doi: 10.1371/journal.pone.0225883. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 26.Parker TH, et al. Transparency in ecology and evolution: real problems, real solutions. Trends Ecol. Evol. 2016;31:711–719. doi: 10.1016/j.tree.2016.07.002. [DOI] [PubMed] [Google Scholar]
- 27.Roche DG, et al. Troubleshooting public data archiving: suggestions to increase participation. PLoS Biol. 2014;12:e1001779. doi: 10.1371/journal.pbio.1001779. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 28.Piwowar HA, Vision TJ, Whitlock MC. Data archiving is a good investment. Nature. 2011;473:285–285. doi: 10.1038/473285a. [DOI] [PubMed] [Google Scholar]
- 29.Drew BT. Missing data mean holes in tree of life. Nature. 2013;493:305–305. doi: 10.1038/493305f. [DOI] [PubMed] [Google Scholar]
- 30.Stoltzfus A, et al. Sharing and re-use of phylogenetic trees (and associated data) to facilitate synthesis. BMC Res. Notes. 2012;5:574. doi: 10.1186/1756-0500-5-574. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 31.Nguyen L-T, Schmidt HA, von Haeseler A, Minh BQ. IQ-TREE: a fast and effective stochastic algorithm for estimating maximum-likelihood phylogenies. Mol. Biol. Evol. 2015;32:268–274. doi: 10.1093/molbev/msu300. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 32.Kozlov AM, Darriba D, Flouri T, Morel B, Stamatakis A. RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference. Bioinformatics. 2019;35:4453–4455. doi: 10.1093/bioinformatics/btz305. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 33.Ivie P, Thain D. Reproducibility in scientific computing. ACM Comput. Surv. 2018;51:1–36. doi: 10.1145/3186266. [DOI] [Google Scholar]
- 34.Ince DC, Hatton L, Graham-Cumming J. The case for open computer programs. Nature. 2012;482:485–488. doi: 10.1038/nature10836. [DOI] [PubMed] [Google Scholar]
- 35.Robinson D. Comparison of labeled trees with valency three. J. Comb. Theory Ser. B. 1971;11:105–119. doi: 10.1016/0095-8956(71)90020-7. [DOI] [Google Scholar]
- 36.Swofford, D. L., Olsen, G. J., Waddell, P. J. & Hillis, D. M. in Molecular Systematics (eds. Hillis, D. M., Moritz, C. & Mable, B. K.) 407–514 (Sinauer, Sunderland, MA, 1996).
- 37.Robinson DF, Foulds LR. Comparison of phylogenetic trees. Math. Biosci. 1981;53:131–147. doi: 10.1016/0025-5564(81)90043-2. [DOI] [Google Scholar]
- 38.Kuhner MK, Felsenstein J. A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Mol. Biol. Evol. 1994;11:459–468. doi: 10.1093/oxfordjournals.molbev.a040126. [DOI] [PubMed] [Google Scholar]
- 39.Paradis E, Schliep K. ape 5.0: an environment for modern phylogenetics and evolutionary analyses in R. Bioinformatics. 2019;35:526–528. doi: 10.1093/bioinformatics/bty633. [DOI] [PubMed] [Google Scholar]
- 40.Schliep KP. phangorn: phylogenetic analysis in R. Bioinformatics. 2011;27:592–593. doi: 10.1093/bioinformatics/btq706. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 41.Shimodaira H. An approximately unbiased test of phylogenetic tree selection. Syst. Biol. 2002;51:492–508. doi: 10.1080/10635150290069913. [DOI] [PubMed] [Google Scholar]
- 42.Guang A, Zapata F, Howison M, Lawrence CE, Dunn CW. An integrated perspective on phylogenetic workflows. Trends Ecol. Evol. 2016;31:116–126. doi: 10.1016/j.tree.2015.12.007. [DOI] [PubMed] [Google Scholar]
- 43.Anisimova M, et al. State-of the art methodologies dictate new standards for phylogenetic analysis. BMC Evol. Biol. 2013;13:161. doi: 10.1186/1471-2148-13-161. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 44.Philippe, H. et al. Pitfalls in supermatrix phylogenomics. Eur. J. Taxon. 283, 1–25 (2017).
- 45.Zhou X, Shen X-X, Hittinger CT, Rokas A. Evaluating fast maximum likelihood-based phylogenetic programs using empirical phylogenomic data sets. Mol. Biol. Evol. 2018;35:486–503. doi: 10.1093/molbev/msx302. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 46.Simmons MP, Gatesy J. Coalescence vs. concatenation: sophisticated analyses vs. first principles applied to rooting the angiosperms. Mol. Phylogenet. Evol. 2015;91:98–122. doi: 10.1016/j.ympev.2015.05.011. [DOI] [PubMed] [Google Scholar]
- 47.Jiang X, Edwards SV, Liu L. The multispecies coalescent model outperforms concatenation across diverse phylogenomic data sets. Syst. Biol. 2020;69:795–812. doi: 10.1093/sysbio/syaa008. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 48.Bryant, D. & Hahn, M. W. in Phylogenetics in the Genomic Era (eds. Scornavacca, C., Delsuc, F. & Galtier, N.) 3.4:1–3.4:23 (2020).
- 49.Rambaut A, Grass NC. Seq-Gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees. Bioinformatics. 1997;13:235–238. doi: 10.1093/bioinformatics/13.3.235. [DOI] [PubMed] [Google Scholar]
- 50.Flouri T, et al. The phylogenetic likelihood library. Syst. Biol. 2015;64:356–362. doi: 10.1093/sysbio/syu084. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 51.Faircloth BC, et al. Ultraconserved elements anchor thousands of genetic markers spanning multiple evolutionary timescales. Syst. Biol. 2012;61:717–726. doi: 10.1093/sysbio/sys004. [DOI] [PubMed] [Google Scholar]
- 52.Lemmon AR, Emme SA, Lemmon EM. Anchored hybrid enrichment for massively high-throughput phylogenomics. Syst. Biol. 2012;61:727–744. doi: 10.1093/sysbio/sys049. [DOI] [PubMed] [Google Scholar]
- 53.Bragg JG, Potter S, Bi K, Moritz C. Exon capture phylogenomics: efficacy across scales of divergence. Mol. Ecol. Resour. 2016;16:1059–1068. doi: 10.1111/1755-0998.12449. [DOI] [PubMed] [Google Scholar]
- 54.Sanderson MJ, McMahon MM, Stamatakis A, Zwickl DJ, Steel M. Impacts of terraces on phylogenetic inference. Syst. Biol. 2015;64:709–726. doi: 10.1093/sysbio/syv024. [DOI] [PubMed] [Google Scholar]
- 55.Stamatakis A, Ott M. Efficient computation of the phylogenetic likelihood function on multi-gene alignments and multi-core architectures. Philos. Trans. R. Soc. B Biol. Sci. 2008;363:3977–3984. doi: 10.1098/rstb.2008.0163. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 56.Mirarab S, et al. ASTRAL: genome-scale coalescent-based species tree estimation. Bioinformatics. 2014;30:i541–i548. doi: 10.1093/bioinformatics/btu462. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 57.Zhang C, Rabiee M, Sayyari E, Mirarab S. ASTRAL-III: polynomial time species tree reconstruction from partially resolved gene trees. BMC Bioinformatics. 2018;19:153. doi: 10.1186/s12859-018-2129-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 58.Darriba D, et al. ModelTest-NG: a new and scalable tool for the selection of DNA and protein evolutionary models. Mol. Biol. Evol. 2020;37:291–294. doi: 10.1093/molbev/msz189. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 59.Stolzer M, et al. Inferring duplications, losses, transfers and incomplete lineage sorting with nonbinary species trees. Bioinformatics. 2012;28:i409–i415. doi: 10.1093/bioinformatics/bts386. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 60.Emms DM, Kelly S. OrthoFinder: phylogenetic orthology inference for comparative genomics. Genome Biol. 2019;20:238. doi: 10.1186/s13059-019-1832-y. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 61.Price, M. N., Dehal, P. S. & Arkin, A. P. FastTree 2—approximately maximum-likelihood trees for large alignments. PLoS ONE5, e9490 (2010). [DOI] [PMC free article] [PubMed]
- 62.Zwickl, D. J. Genetic algorithm approaches for the phylogenetic analysis of large biological sequence datasets under the maximum likelihood criterion. Ph.D. dissertation, The University of Texas at Austin (2006).
- 63.Kumar S, Stecher G, Li M, Knyaz C, Tamura K. MEGA X: molecular evolutionary genetics analysis across computing platforms. Mol. Biol. Evol. 2018;35:1547–1549. doi: 10.1093/molbev/msy096. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 64.Guindon S, et al. New algorithms and methods to estimate maximum-likelihood phylogenies: assessing the performance of PhyML 3.0. Syst. Biol. 2010;59:307–321. doi: 10.1093/sysbio/syq010. [DOI] [PubMed] [Google Scholar]
- 65.Alfaro ME, et al. Explosive diversification of marine fishes at the Cretaceous-Palaeogene boundary. Nat. Ecol. Evol. 2018;2:688–696. doi: 10.1038/s41559-018-0494-6. [DOI] [PubMed] [Google Scholar]
- 66.One Thousand Plant Transcriptomes Initiative. One thousand plant transcriptomes and the phylogenomics of green plants. Nature. 2019;574:679–685. doi: 10.1038/s41586-019-1693-2. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 67.Stamatakis A. RAxML version 8: A tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics. 2014;30:1312–1313. doi: 10.1093/bioinformatics/btu033. [DOI] [PMC free article] [PubMed] [Google Scholar]
- 68.Wu M, Kostyun JL, Hahn MW, Moyle LC. Dissecting the basis of novel trait evolution in a radiation with widespread phylogenetic discordance. Mol. Ecol. 2018;27:3301–3316. doi: 10.1111/mec.14780. [DOI] [PubMed] [Google Scholar]
- 69.Steenwyk JL, et al. Extensive loss of cell-cycle and DNA repair genes in an ancient lineage of bipolar budding yeasts. PLoS Biol. 2019;17:e3000255. doi: 10.1371/journal.pbio.3000255. [DOI] [PMC free article] [PubMed] [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Supplementary Materials
Data Availability Statement
All gene alignments, gene trees, log files, and command lines, as well as summary and statistics of the runs, are available on the figshare repository: 10.6084/m9.figshare.11917770.