 Research
 Open access
 Published:
Weighted ASTRID: fast and accurate species trees from weighted internode distances
Algorithms for Molecular Biology volume 18, Article number: 6 (2023)
Abstract
Background
Species tree estimation is a basic step in many biological research projects, but is complicated by the fact that gene trees can differ from the species tree due to processes such as incomplete lineage sorting (ILS), gene duplication and loss (GDL), and horizontal gene transfer (HGT), which can cause different regions within the genome to have different evolutionary histories (i.e., “gene tree heterogeneity”). One approach to estimating species trees in the presence of gene tree heterogeneity resulting from ILS operates by computing trees on each genomic region (i.e., computing “gene trees”) and then using these gene trees to define a matrix of average internode distances, where the internode distance in a tree T between two species x and y is the number of nodes in T between the leaves corresponding to x and y. Given such a matrix, a tree can then be computed using methods such as neighbor joining. Methods such as ASTRID and NJst (which use this basic approach) are provably statistically consistent, very fast (low degree polynomial time) and have had high accuracy under many conditions that makes them competitive with other popular species tree estimation methods. In this study, inspired by the very recent work of weighted ASTRAL, we present weighted ASTRID, a variant of ASTRID that takes the branch uncertainty on the gene trees into account in the internode distance.
Results
Our experimental study evaluating weighted ASTRID typically shows improvements in accuracy compared to the original (unweighted) ASTRID, and shows competitive accuracy against weighted ASTRAL, the state of the art. Our reimplementation of ASTRID also improves the runtime, with marked improvements on large datasets.
Conclusions
Weighted ASTRID is a new and very fast method for species tree estimation that typically improves upon ASTRID and has comparable accuracy to weighted ASTRAL, while remaining much faster. Weighted ASTRID is available at https://github.com/RuneBlaze/internode.
Introduction
Species tree estimation is a common task in phylogenomics and is a prior step in many downstream analyses (e.g., estimating divergence, understanding adaptation). Despite the recent increase in the availability of genomescale data, species tree estimation remains challenging due to gene tree heterogeneity, where gene trees (the evolutionary history of genes) differ from species trees [1]. Among common factors for gene tree heterogeneity, incomplete lineage sorting (ILS), a populationlevel process modeled statistically by the multispecies coalescent (MSC) [2, 3], is extremely common and wellstudied.
A standard approach to speciestree reconstruction under the presence of ILS is to concatenate the alignments of the individual genes and running a maximum likelihood (ML) heuristic on the combined alignment. This simple approach, however, has been established to be statistically inconsistent under the MSC, and can even be positively misleading, returning a wrong topology with probability converging to 1 as the number of genes increases [4, 5]. Empirically, concatenation can also suffer from degraded accuracy under higher levels of ILS, and can be affected by scalability issues under large data [6, 7]. In response, many accurate ILSaware methods have since been developed. Those that are most commonly used in practice fall into a class of socalled “summary methods”, where gene trees are first independently estimated from each genomic region, and the inferred gene trees are then used as input to the summary method, which outputs an estimated species tree (i.e., that summarizes the information in the input gene trees).
In recent years, many summary methods that are statistically consistent under the MSC have been developed, such as MPEST [8], NJst [9], ASTRAL [6], ASTRID [10], FASTRAL [11], and wQFM [12]. Many of these methods are scalable to thousands of species with genomicscale data (i.e., with thousands of genes). Among these methods, ASTRAL is the most well known, and has shown improved accuracy in comparison to many other methods in many simulation studies [13, 14]. Moreover, when the gene trees are adequately accurate and ILS is sufficiently high, ASTRAL tends to be more accurate than concatenation [7]. However, ASTRAL and summary methods more generally are not statistically consistent when given estimated gene trees and can be positively misleading in some model conditions [5]. Moreover, it is well known that accuracy for summary methods degrades as gene tree error increases [7, 15], and when gene tree error is sufficiently high, better accuracy may be obtained from concatenation, even under very high ILS, and even in the anomaly zone [7].
Alternative approaches to summary methods have also been developed that can be robust to conditions that lead to gene tree estimation error (e.g., gene alignments that have low phylogenetic signal due to being too short or evolving too slowly). Examples of such methods include methods that statistically coestimate the gene trees and species trees, such as StarBeast [16] or StarBeast2 [17]. However, these coestimation methods are very computationally intensive, as runtime is impacted by the number of genes as well as the number of species, so that StarBeast is limited to datasets that have perhaps 20 or 30 species and at most 100 genes [18]. Some other methods operate without ever estimating gene trees, including SVDquartets [19] and LilyQ [20]; these operate by computing quartet trees from the alignment and then combine the quartet trees into a tree on the full set of species using quartet amalgamation methods. Of these, LilyQ has perhaps the best accuracy and can be more accurate than ASTRAL when gene tree estimation error is high. However, these quartetbased methods are computationally intensive if all quartet trees must be computed, and subsampling quartet trees rather than computing and aggregating all \(\left( {\begin{array}{c}n\\ 4\end{array}}\right)\) quartet trees is expected to reduce accuracy (see discussion in [21]). Thus, largescale species tree estimation in the presence of ILS has substantial computational challenges, as surveyed in [22].
This sensitivity of summary methods to gene tree error has motivated approaches preprocessing the gene trees to improve the quality of the signal. Although throwing out inaccurate gene trees generally does not help [7], statistical binning [23, 24] and contracting lowsupport branches [14] improved accuracy for summary methods on many conditions. Nonetheless, these approaches require setting arbitrary thresholds: statistical binning requires a threshold to determine which branches are trustworthy, and contracting lowsupport branches also requires such a threshold. Suboptimal parameter selection in either case can lead to little accuracy improvement, or even worse, degraded accuracy compared to simply running on the original input [14, 24]. Thus, pragmatically, accurately applying such methods faces the difficulty of parameter selection.
Very recently, Zhang and Mirarab introduced weighted ASTRAL [25]. By directly incorporating gene tree uncertainty into the ASTRAL optimization problem, weighted ASTRAL improved ASTRAL in accuracy under all of their tested conditions. Notably, under conditions where concatenation proved more accurate than unweighted ASTRAL, weighted ASTRAL achieved the largest improvement, shrinking substantially the long known gap [13, 26, 27] between summary methods and concatenation under low gene signal. More specifically, (unweighted) ASTRAL heuristically searches for a species tree that maximizes the amount of quartet trees (unrooted fourtaxon tree) shared with the input gene trees. By using branch support and lengths to weigh the reliability of gene tree quartets, weighted ASTRAL instead heuristically maximizes the weighted agreement with respect to the input gene trees, effectively discounting the contribution of unreliable quartets. Weighted ASTRAL is thresholdfree, was shown to be more accurate than running ASTRAL on contracted gene trees [25], and in fact might be the most accurate summary method under ILS that can scale to large datasets.
Here, inspired by weighted ASTRAL, we introduce weighted ASTRID, incorporating gene tree uncertainty into ASTRID. ASTRID, a fast and more accurate variant of NJst, is based on the internode distance, defined by ASTRID as the number of edges between two taxa in a gene tree. We explore variations of this internode distance where branch uncertainty is considered. Notably, ASTRID is shown to have competitive accuracy against ASTRAL [7, 10] while having a much faster running time [10, 11], both of which we hope to generalize to weighted ASTRID when compared against weighted ASTRAL, obtaining a fast alternative to a very accurate method.
The rest of the study is organized as follows. We begin with a description of weighted ASTRID and introduce the two ways of weighting the internode distance matrix. We then describe our experimental study, choosing parameters for weighted ASTRID and comparing it to other methods, followed by the results for our experimental study using both simulated and biological data. These results show in general that weighted ASTRID improves ASTRID accuracy under most conditions, and our implementation of weighted ASTRID is much faster than the unweighted ASTRID code. We also find that weighted ASTRID is faster than ASTRAL and weighted ASTRAL, and is competitive for accuracy with these methods. We conclude the paper with a discussion of our observations and directions for future work.
Materials and methods
Basic definitions
Let n denote the number of taxa and let k denote the number of genes assuming a set of gene trees. Given an unrooted phylogenetic tree T, we denote its leafset by \({\mathcal {L}}(T)\) and its edgeset by E(T). For each edge e in E(T), deleting e from T partitions the leaves into two sets defined by the two connected components separated by e; we denote this bipartition by \(\pi _e\), and we denote the set of bipartitions of T by \(C(T) = \{\pi _e \,\, e \in E(T)\}\). We note that C(T) uniquely defines the (unrooted) topology of T. Note that the terms “branch” and “edge” have the same meaning, and we use both in this document.
A bipartition \(\pi _e\) is said to be trivial if e is incident to a leaf, since in such case \(\pi _e \in C(T)\) for any T on the same leafset. A tree T is said to be a contraction of \(T'\) if \(C(T) \subset C(T')\). The RobinsonFoulds distance (RF distance) [28] between two trees T and \(T'\) on the same leafset is the size of the symmetric difference between the bipartitions of T and \(T'\), i.e., \(C(T) \, \triangle \, C(T')\). Given two binary trees T and \(T'\), we define the nRF (error) rate as their RF distance normalized by \(2 n  6\) (the number of nontrivial bipartitions), obtaining a value that is between 0 and 1.
For taxa \(u, v \in {\mathcal {L}}(T)\), let \(P_T(u, v)\) denote the set of edges on the unique path connecting u and v in T. Given an estimated gene tree G, we assume that each internal edge e is associated with a branch support value s(e) denoting the confidence that this edge is correctly estimated, where \(s(e) \in [0, 1]\). We say an edge is correctly estimated (in topology) if the bipartition associated with that edge is present in the true gene tree, thus \(s(e) = 1\) if e is incident to a leaf. We also let l(e) denote the length of the edge e, normally given in substitution units.
NJst and ASTRID: distancebased summary methods
One approach to species tree estimation is based on combining estimated gene trees, using a distance matrix computed for the input gene trees, and then applying a distancebased method, such as neighbor joining [29]. In this study, we will assume that any discordance between the true gene tree and the true species tree is due to incomplete lineage sorting, and so all gene trees are single copy. We do not assume that the gene trees contain all the species, however, and we also assume that the gene trees are unrooted.
NJst In 2011, the NJst method was developed, which uses this approach [30]. In NJst, the distance between two taxa i and j within a tree is the number of nodes on the path between the leaves for those taxa. This “internode distance” is then averaged across all the gene trees, thus defining the “average internodedistance matrix”. Given the distance matrix, neighbor joining [29] is then used to compute a tree. This method, referred to as NJst, is polynomial time and statistically consistent under the MSC [31].
The proof that NJst is statistically consistent under the MSC for this approach has two parts: first, that the average internode distance matrix converges, as the number of genes increases, to an additive matrix for the species tree, and second, that neighbor joining return the species tree when the average internode distance matrix is close enough to this additive distance matrix. The proof that the average internode distance matrix converges to an additive matrix for the species tree was provided in [31], and the guarantee for neighbor joining returning the species tree when the estimated distance matrix is close enough to an additive matrix was proven in [32]. This last condition is referred to by saying that neighbor joining has a “positive safety radius”, which means that for the true tree T with additive matrix D, there is some value \(\epsilon >0\) so that when given a distance matrix d such that \(L_{\infty }(d,D) < \epsilon\), then neighbor joining is guaranteed to return the unrooted topology of T.
ASTRID Note that the proof that NJst is statistically consistent under the MSC enables any distancebased method to replace neighbor joining, as long as the substitute method also has a positive safety radius. Once such method is balanced minimum evolution (BME), which also has a positive safety radius [33, 34]. Moreover, BME has several theoretical properties that suggest that it will have a better sample complexity (and hence better accuracy) than neighbor joining (see discussion about the edge safety radius in [34]). This observation led to the development of ASTRID, which we now describe.
ASTRID is very similar to NJst in design in that it computes a distance matrix from the gene trees and then computes a tree on the distance matrix. The major difference between ASTRID and NJst is that it uses a heuristic for BME available in FastME [35] to construct a species tree from the distance matrix it computes instead of neighbor joining. A minor difference between ASTRID and NJst is that ASTRID uses a slightly different distance matrix: instead of using the number of nodes in a gene tree between the leaves for each pair of taxa, it uses the number of edges. It is trivial to see that this way of defining the distance matrix also converges to an additive matrix for the species tree; hence, this change does not impact statistical consistency. Because the matrix it computes is not exactly the same, we will refer to it as the intertaxon distance matrix.
Like NJst, ASTRID is statistically consistent under the MSC. However, the proof for statistical consistency for ASTRID is somewhat more complicated than for NJst, since ASTRID uses a heuristic search within FastME for BME, which is NPhard [36]. This heuristic search begins with a greedy BME tree, followed by either NNI (nearestneighbor interchange) or SPR (subtree prune and regraft) moves, until a local optimum is found. Although this heuristic uses a local search strategy, this approach is guaranteed to converge to the true species tree topology when the input distance matrix is sufficiently close to the additive matrix for the species tree (i.e., like neighbor joining, it also has a positive safety radius) [33, 34]. Thus, we have the following theorem:
Theorem 1
ASTRID is statistically consistent under the MSC, provided that the default heuristic is used and run until convergence to a local optimum.
Several simulation studies have shown ASTRID has accuracy that can be comparable to that of ASTRAL and can scale to large datasets [7, 10]. Moreover, early implementations of ASTRID were shown to be much faster than early versions of ASTRAL on large datasets [10], and although ASTRAL has continued to improve in speed, there may still be a runtime advantage to ASTRID. Finally, ASTRID is a key technique used in FASTRAL for speeding up ASTRAL.
Here we describe how we run ASTRID on the datasets in this study. We begin with some notation that we will use throughout this paper.
Notation We let G denote a gene tree in the set \({\mathcal {G}}\) of gene trees. For u, v two taxa, we let \(d_G(u, v)\) denote the number of edges in the path \(P_G(u, v)\) between the leaves for u, v in G, and we let \({\mathcal {G}}_{u,v}\) denote the set of gene trees that have both u and v.
ASTRID given complete distance matrices We now describe how ASTRID operates when the average intertaxon distance matrix has no undefined entries; thus, we assume that for every pair of taxa u, v there is some gene tree that has both u and v, and so \({\mathcal {G}}_{u,v}\ne \emptyset\) for all u, v. We refer to this as saying that the distance matrix is complete. ASTRID proceeds as follows:

1
For each pair of taxa u, v, we set D[u, v] to be the empirical mean of \(d_G(u, v)\) where G ranges over \({\mathcal {G}}_{u, v}\). Thus, we set \(D[u, v] = \frac{\sum _{G \in {\mathcal {G}}_{u, v}} d_G(u, v)}{{\mathcal {G}}_{u, v}}\).

2
We run FastME’s heuristic for balanced minimum evolution [35], under the accurate setting of using extra rounds of NNI and SPR moves (referred to as FastME from here on) on D, outputting an unrooted species tree.
ASTRID given incomplete distance matrices To handle incomplete distance matrices, i.e., the case where some pair of taxa u, v do not appear together in any gene tree and so \({\mathcal {G}}_{u, v} = 0\), ASTRID instead first marks the corresponding entry of D[u, v] as “missing” in Step 2. FastME requires complete distance matrices, and as such these missing entries must be imputed.
In the original version of ASTRID [10], this issue was addressed by using methods from the PhyD* family [37] of tree estimation methods, which are specifically designed to handle distance matrices that are incomplete (i.e., entries that are undefined). However, in subsequent research (published in Pranjal Vachaspati’s PhD dissertation [38]), a modification to this approach was found to produce better accuracy, which we now describe:

a
Run a variant of UPGMA [39] on D (that contains missing entries) called UPGMA\(^{*}\). Recall that UPGMA is an agglomerative clustering algorithm defined on the “average” distance between two clusters. In UPGMA\(^{*}\), two clusters A and B are candidates for joining only if there exists taxa \(u \in A\) and \(v \in B\) such that the distance between u and v is defined (nonmissing), and in such case the average distance between the clusters A and B is the average of all such distances between such pairs u, v. The resulting UPGMA\(^*\) tree is denoted by \(U_1\) and we let \(A_1\) be the matrix of path lengths (counting the number of edges) between the leaves in \(U_1\).

b
We define matrix \(D_1\), a completion of D, as follows. For each u, v such that D[u, v] is undefined (because \({\mathcal {G}}_{u,v}=\emptyset\)), we set \(D[u, v] = A_1[u,v]\). We denote this filledin matrix by \(D_1\), and we note that the matrix \(D_1\) is complete.

c
We run FastME with only NNI moves on \(D_1\), obtaining a tree \(U_2\). As before, we let \(A_2\) denote the matrix of path lengths for \(U_2\), and we complete D using \(A_2\), thus producing complete matrix \(D_2\).
As described, the distance matrix \(D_2\) is complete, and can be used as input to any tree estimation method that operates using distances. In [38], FastME trees estimated using this distance matrix were more accurate than trees estimated using methods from PhyD* applied to the incomplete distance matrices given as input. This way of running ASTRID is available in the GitHub site [40], where it is referred to as ASTRID2.
Weighted ASTRID
In the definition of the intertaxon distance, each edge contributes equally to the intertaxon distance for each pair of taxa it separates. Intuitively, under the realistic assumption that gene trees are estimated with a nontrivial amount of error, some branches will be more reliably estimated than the others. As such it makes sense to assign weights to branches as some confidence of them correctly contributing to the intertaxon distance. The branch lengths could also be used as such a proxy, because short branches are empirically hard to estimate. Thus, our problem becomes to choose appropriate weighting schemes for the edges based on information already annotated in the gene trees, that is, the branch support and branch lengths. Because branch support is already designed as some statistical confidence of the correctness of some branch, it seems natural to naively assign the support directly as the weight for each branch. We alternatively explore simply assigning the branch length as the weight. The details are presented as follows.
Distance defined by branch support
We now formally introduce wASTRIDs (weighted ASTRID by support), analogous to the naming of weighted ASTRAL by support. Here we try one simple approach, defining each branch’s contribution to the intertaxon distance as its support instead of 1, which gives rise to the following definition of \(d_G(u, v)\), the new supportweighted intertaxon distance replacing the intertaxon distance from step 2 of ASTRID:
In reality, several different measures of support exist with different running time and accuracy tradeoffs [41]. As reported in [25], the approximate Bayesian support [41] of IQTREE led to the most accurate species tree reconstruction, although other measures of support also led to accuracy improvements over unweighted ASTRAL. We leave this choice of support as a parameter to be decided later for wASTRIDs in an experiment for parameter exploration (Experiment 1).
Distance defined by branch lengths
Unlike branch support, which is designed to be a measure of statistical confidence on the correctness of a branch, branch lengths can only serve as proxies to such information, where shorter branches are empirically harder to estimate likely as a result of shorter branches containing less information (fewer substitutions) [42]. We do not attempt a complex conversion here, and simply just assign the branch length as the confidence similar to how we use the support values:
Notably, this definition of \(d_G(u, v)\) coincides with STEAC [43] (motivated by a different perspective of the coalescence time between genes), and potentially under a more accurate setting when paired with the FastME step of ASTRID. In addition, we also explore whether and how to normalize the input branch lengths of the gene trees for the weighting. We name this final algorithm wASTRIDpl (weighted ASTRID by pathlengths).
Running time
The runtime for wASTRIDs and wASTRIDpl has two parts: the calculation of the distance matrix and then running FastME. Here we derive the runtime for each part.
Theorem 2
The average intertaxon distance matrix of wASTRIDs and wASTRIDpl can be obtained in \(O(k n^2)\) time, where n is the number of species and k is the number of genes. The runtime using FastME on this input matrix, and using p NNI or SPR moves, is \(O(pn^2)\). Hence, the total runtime is \(O((k + p) n^2 )\).
Proof
We begin by demonstrating that the asymptotic runtime for calculating the distance matrix is the same for wASTRIDs, wASTRIDpl, and ASTRID. For each gene tree, our metricization simply assigns alreadycomputed values as lengths to each edge; thus, using dynamic programming, calculating the intertaxon distance across all pairs of taxa per gene tree takes \(O(n^2)\) time (for normalizing branch lengths in wASTRIDpl, we only explore ways to normalize that do not affect this asymptotic running time). Hence, the average intertaxon distance matrix can be calculated in \(O(k n^2)\) time.
The runtime for FastME, given the distance matrix, depends on the number p of NNI or SPR moves. According to [35, 44], FastME optimizing BME, using NNI or SPR moves, uses \(O(n^2)\) for the starting tree and \(O(n^2 + pn \times diam(T))\), where diam(T) is the topological diameter of the output tree and p is the number of moves, for the heuristic search. Since \(diam(T) \le n1\), this is \(O(pn^2)\). \(\square\)
We also reimplemented the calculation of the distance matrix to improve empirical runtime compared to the available version of ASTRID in [40]. The asymptotically optimal algorithm is easy to devise because the naive algorithm, which, given a gene tree, starts a tree traversal at each leaf to obtain the allpairs intertaxon distance, is already quadratic time per gene and also asymptotically optimal due to each gene tree having \(\left( {\begin{array}{c}n\\ 2\end{array}}\right)\) distances. The original ASTRID implementation, in this vein, uses an algorithm which implicitly performs multiple traversals in the tree. We instead implemented an intertaxondistance algorithm from TreeSwift [45] based on postorder traversal, through which we hope to achieve better empirical performance due to better cache locality in its simultaneous maintenance of multiple distances from the leaves in an array. This produces for us a speed advantage for wASTRID as well as an alternative way of running ASTRID, which we refer to as ASTRID3.
Experimental study
Overview
We conduct five experiments. The first experiment is parameter exploration and uses training data; all subsequent experiments use the testing data, which are disjoint from the training data.

Experiment 1: we explore parameter choices (choice of branch support for wASTRIDs and normalization scheme for wASTRIDpl) for weighted ASTRID.

Experiment 2: we compare the accuracy and running time of weighted ASTRID against other methods on a diverse set of simulated conditions, where all genes are complete, and so have all the species.

Experiment 3: we compare ASTRID, wASTRALh, and the best variant of wASTRID (as determined by previous experiments) on the Jarvis et al. [46] avian biological dataset.

Experiment 4: we explore weighted and unweighted ASTRAL and ASTRID on datasets where the average intertaxon distance matrix might be incomplete (i.e., where there is at least one pair of taxa that do not appear together in any gene tree). Specifically, we explored two models of missing data, one uniformly deleting a fixed number of taxa across gene trees, and also a “cladebased” model of missing data, denoted by \(M_{\text {clade}}\) from [47]. Both types of missing data results in gene trees that each almost always has taxa missing.

Experiment 5: we conducted a detailed running time comparison between ASTRID2 and ASTRID3, where ASTRID3 differs from ASTRID2 by a faster implementation for calculating the average intertaxon distance matrix.
Datasets
We assembled a set of diverse data from prior studies (see Table 1), consisting of various simulated conditions with estimated gene trees and one biological dataset (“avian biological”) from the avian phylogenomics project [46]. We separate the datasets into training (Experiment 1) and testing (Experiments 2–5).
We use the nomenclature of the original ASTRID study and refer to the SimPhysimulated datasets from the ASTRALII study [13] by an “MC” name (where “MC” refers to “model condition”). We additionally replaced some ASTRALII datasets by some “H” variants generated by a prior separate study [48] to induce a level of GTEE closer to the rest of the conditions, which span from 23% to 55%. The ILS levels of the datasets are measured in average discordance (AD), defined as the average nRF rate between the true species tree and the true gene trees. Like the original ASTRID study [10], we classify the ILS levels of the datasets into four categories according to their AD values, where below \(25\%\) is classified as low ILS (L), between \(26\%\) and \(39\%\) medium ILS (M), between \(40\%\) and \(59\%\) high ILS (H), and higher AD considered very high ILS (VH). For the simulated conditions, we subsample k of the gene trees with \(k = 50, 200, 1000\), except for the mammalian simulation where we sample \(k = 50, 100, 200\) instead, as only 200 gene trees were provided.
In Experiment 4, we evaluate methods on datasets where some gene trees are missing one or more species. For this experiment, we created missing data variants of the S100 (seqlen = 400) dataset under two models of missing data: the i.i.d. model and the \(M_{\text {clade}}\) model. For the i.i.d. case, we deleted a fixed number of taxa (\(20\%, 40\%, 60\%, 80\%\) of the total number of taxa) from each gene; thus, every gene tree is incomplete (i.e., misses at least one species). For the \(M_{\text {clade}}\) model, the process is more complicated. Briefly, each gene tree uniformly samples a clade from the species tree above a certain size (a parameter x relative to the number of taxa in the species tree), and only retains taxa from this clade. We varied x in 0.2, 0.4 and 0.6, which resulted in an average percentage of taxa being deleted of \(46\%, 23\%\) and \(10\%\), respectively for the \(M_{\text {clade}}\) model. Thus, for the \(M_{\text {clade}}\) model, it is possible for a gene tree to be complete (i.e., have all the species), but not very likely for this to occur.
We now describe how we compute branch support in our experiments. The weighted ASTRAL study [25] provided gene trees reannotated with aBayes support [41] and edge lengths inferred using IQTREE [49] for the ASTRALII and ASTRALIII datasets. We also reannotated the avian and mammalian simulation with aBayes support and IQTREE edge lengths, because aBayes was determined as the best measure of support also for wASTRIDs. We use the MC2 condition as the training data for both wASTRIDs and wASTRIDpl, where to explore the choice of edge support for wASTRIDs, we took the original gene trees estimated using FastTree [50] and estimated branch support using two techniques: the default FastTree SHlike support and also bootstrap support [51] using 100 bootstrap trees. For Experiment 4, we only used the IQTREE aBayes support, computed on the reduced gene trees and using the reduced alignments. See Appendix for additional discussion about branch support.
Methods
We ran weighted and unweighted versions of ASTRAL and ASTRID.

ASTRID (v2.2.1), available at [40]. With the exception of Experiment 4, we turn off missing data imputation.

wASTRID, available at [52], missing data imputation will be automatically turned on by the software when necessary.

ASTRAL(III) (v5.7.8), available at [53]. Although ASTRALIII enables analyses of gene trees with lowsupport branches collapsed, we use the fully resolved gene trees as input, as this allows us the fully explore the impact of weighting.

wASTRALh (hybrid weighted ASTRAL, v.1.4.2.3). This was the most accurate version of weighted ASTRAL from the original study [25], using both branch lengths and support to weight gene tree quartets. wASTRALh supports parallelization, so we run wASTRALh with 16 threads. wASTRALh is available as part of the ASTER [54] software suite.
For all analyses using wASTRID and ASTRID, when we ran FastME to search for a BME solution, we ran FastME with the most accurate setting that uses the same greedy BME starting tree and follows with both NNI and SPR moves to improve the score.
Many of the datasets in our study have FastTreeinferred gene trees that were reannotated with IQTREE approximate Bayesian support. FastTreeinferred trees have polytomies when the input has identical sequences, but these polytomies will be resolved when the trees are reannotated by IQTREE. Since polytomy resolution may add false positive edges that adversely affect the accuracy of the unweighted methods, in these cases, we run the unweighted methods on the original FastTree gene trees.
Evaluation criterion
For simulated datasets, we report the topological error rate of the reconstructed species trees using the normalized RobinsonFoulds error (nRF error) [28] with respect to the true species trees, where the nRF error rate is the number of bipartitions in the estimated and true species trees that do not appear in both trees, normalized by the total number of nontrivial bipartitions in the two trees. Because all the inferred and true species trees are binary, the nRF error rate is the same as the missing branch rate (i.e., the fraction of the nontrivial bipartitions in the true species tree that are missing from the reconstructed tree). For these calculations, the nontrivial bipartitions of a tree are defined by the internal edges in the tree, i.e., the edges that are not incident to leaves.
On the avian biological dataset, as the true tree is not known, we compare the estimated species trees against prior topologies (wASTRAL tree and published trees). We also compute the local posteriorprobability (localPP) branch support [55] for the reconstructed species trees obtained using wASTARLh to assess the reliability of the branches.
On all datasets, we keep track of the wallclock running time of the methods, the time taken from consuming the input gene trees (that may have been preprocessed with new branch support values) until outputting the species tree.
Experimental environment
All experiments before Experiment 5 were conducted on the Illinois Campus Cluster, a heterogeneous cluster that has a fourhour running time limit. The heterogeneity of the hardware makes the wallclock running times not directly comparable across runs, but can still be used to gather obvious running time trends.
All runs in Experiment 5 were performed serially on an Apple M1 Macbook Pro (model Z11B000E3LL/A) to ensure accurate comparison of running times.
Results
Experiment 1: parameter selection
In Fig. 1, we explore the choice of branch support among the default FastTree SHlike support, IQTREE approximate Bayesian (aBayes) support (normalized to the [0, 1] range), and bootstrap support (100 FastTree replicates) on the training datasets. The best accuracy of wASTRIDs is obtained by using the normalized aBayes support on gene trees. All measures of support, however, improved the species tree estimation error in general. The superiority of (normalized) aBayes support is consistent with the support chosen for weighted ASTRAL, where it was also found superior to SHlike support and bootstrap support. This advantage is even more pronounced when considering that aBayes support can be obtained much faster than bootstrap support [41].
On this training dataset, wASTRIDpl attained the highest accuracy when normalizing the branch lengths in each gene tree by the maximum path length in that gene tree (better than no normalization). Interestingly, while worse than ASTRID with fewer genes \(k \in \{50, 200\}\), wASTRIDpl attained higher accuracy than ASTRID when \(k = 1000\). However, when comparing wASTRIDs and wASTRIDpl, wASTRIDpl was always less accurate.
Experiment 2: results on simulated datasets
In this experiment, we show fourway comparisons among ASTRID, ASTRAL, weighted ASTRAL (wASTRALh), and weighted ASTRID (wASTRIDs). We additionally show wASTRIDpl on S100 but omit showing its results later as wASTRIDpl was discovered to be on all datasets less accurate than wASTRIDs. We put an emphasis on the accuracy (nRF error), while later revisiting the problem of running time.
ASTRALIII S100
This 101species dataset contains four conditions that varied in the gene tree estimation error (GTEE, measured by the average nRF error between the estimated gene trees and their corresponding true gene trees) by varying the sequence lengths. We show the results in Fig. 2. We show the unweighted methods (i.e., ASTRID and ASTRAL) in dotted lines.
Many trends are as expected. For example, summary methods become more accurate as k (the number of genes) increases, and all methods also improve in accuracy when given more accurate estimated gene trees. These two trends are unsurprising and welldocumented across studies for summary methods in general (e.g., [7]).
More interestingly, the weighted methods (wASTRIDs, wASTRALh) are clearly more accurate than their unweighted counterparts, especially at higher levels of GTEE (GTEE \(= 0.55, 0.42\)). The improvement in accuracy from the weighted methods does not seem to depend on the number of genes, suggesting that the noise brought by lowquality gene trees is not resolved by having ample data. This advantage of the weighted methods, however, is smaller as more accurate gene trees are used (GTEE = 0.31), as expected.
wASTRIDs clearly improves upon ASTRID on this dataset, across all conditions and all numbers of genes. wASTRIDs notably almost matches the accuracy of wASTRALh. With \(k \in \{200, 1000\}\), no clear benefit exists for using wASTRALh on the shown conditions.
On this dataset, wASTRIDpl, similar to trends seen in the training dataset, attains better accuracy than ASTRID when \(k = 1000\), but is almost always worse than wASTRIDs.
ASTRALII SimPhy
We show the results of the ASTRALII SimPhy datasets in Fig. 3. Across all conditions in this dataset, the weighted methods are more accurate than the unweighted methods. This advantage does not seem to depend on the level of ILS or the number of species. Even under the easiest condition (MC3), wASTRALh and wASTRIDs still consistently achieved better accuracy. All methods also performed worse in accuracy as ILS increased, as expected.
While wASTRIDs still consistently improved upon ASTRID in accuracy on this dataset, we also see datasets where wASTRIDs is worse than wASTRALh. The relative performance of wASTRIDs and wASTRALh seems related to the relative performance of the base methods: MC1 and MC6H are the two conditions that ASTRAL is in general more accurate than ASTRID, but the relative performance of the base methods does not explain the whole picture – for MC1 going to \(k = 1000\), ASTRID became more accurate than ASTRAL yet wASTRIDs is still worse than wASTRALh. More positively, on the other conditions of this dataset, wASTRALh has nearly the same accuracy as wASTRIDs, although wASTRALh is marginally more accurate, which might be due to the hybrid weighting of wASTRALh, which also incorporates the branch lengths for better accuracy.
The model condition with the largest number of species, i.e., MC11H with 1001 species, presented computational challenges for ASTRAL. Specifically, on roughly half of the replicates of model condition MC11H with \(k = 1000\) genes, ASTRAL did not finish under our fourhour time limit (see Appendix Sect. "Failures to complete" for more details), but wASTRALh did.
Avian and mammalian simulations
The avian and mammalian simulation have model trees inferred on biological datasets. Both datasets have three conditions with varying ILS by scaling the model tree branch lengths by 2X, 1X, or 0.5X, with shorter branch lengths leading to higher degrees of ILS. Notably, prior results [10] showed that ASTRID outperformed ASTRAL on the avian simulation in accuracy, while on the mammalian simulation ASTRAL was more accurate. Also, the mammalian simulation only has 200 genes available, so we vary k among 50, 100, 200 unlike the other datasets.
On the avian simulation (Fig. 4), aside from obvious trends (ILS increases difficulty; more genes leads to more accurate reconstruction), same as the original study [10], ASTRID is consistently more accurate than ASTRAL. Strangely, although the weighted methods inherit the relative performance of their base methods, in a few cases the weighted methods do not help in accuracy, but they do not erode accuracy either. Even on conditions where the weighted methods improved accuracy, the improvement was small. For example, wASTRALh, even though improving upon ASTRAL, is even less accurate than ASTRID, whereas on previously shown data wASTRALh was consistently the best in accuracy. This avian simulation does carry substantial GTEE (\(> 50\%\)), so it is not clear what led to the weighted methods underperforming.
The results for the mammalian simulation (Fig. 5) paint a more perplexing picture. On the 2X condition, surprisingly, the weighted methods are less accurate than their unweighted counterparts in general. This trend continues with the 1X condition, where wASTRALh only mostly matches ASTRAL in accuracy, and wASTRIDs is worse than ASTRID in accuracy. Only on the 0.5X condition do both weighted methods clearly help in accuracy. wASTRALh is clearly better than wASTRIDs on this dataset, but this difference can be explained by the accuracy advantage of ASTRAL on ASTRID. While it is again unclear why the weighted methods underperformed, this dataset is relatively easy, compared to the previously shown datasets, with all methods achieving at most 0.05 nRF error rate at \(k = 200\); thus, despite the puzzling relative performance of weighted and unweighted methods, the difference in accuracy among methods is very small.
Running time
We show the wallclock running time of the four methods under three representative conditions (\(n = 101, 201, 1001\)) in Table 2, with a direct comparison of the two most accurate methods visualized in Fig. 6. While the heterogeneity of the hardware dilutes the comparability of the running times, clearly wASTRIDs and ASTRID are much faster than wASTRALh and ASTRAL, with wASTRIDs on average taking less than 12 s even on the largest input, whereas on the same input wASTRALh on average takes roughly two hours. In general, wASTRIDs is around two orders of magnitude faster than wASTRALh. Although we note that the default flags of both ASTRAL and wASTRALh (that we used in the experiments) also calculate support and lengths for reconstructed species tree, in practice, this is a fast step relative to the species tree reconstruction, and does not affect our running time analysis in any substantial way. On MC11H, wASTRIDs and ASTRID took less time going from \(k = 50\) to 200, likely due to the \(k = 50\) species trees having larger diameters, negatively impacting the FastME step running time which has a linear dependency on the diameter of the output tree.
The weighted methods are faster than their unweighted counterparts. For example on S100 (seqlen \(= 400\)) with 1000 genes, wASTRALh is more than ten times faster than ASTRAL. In addition ASTRAL did not finish for approximately half of the datasets for the largest input (MC11H, \(k = 1000\)). Aside from the benefit of parallelization (we ran wASTRALh using 16 threads, but offtheshelf ASTRAL does not support parallelization), this speed advantage under a large number of genes of wASTRALh over ASTRAL can also be attributed to the algorithmic change implemented in wASTRALh. The new weighted ASTRAL algorithm removes the inpractice quadratic dependency of ASTRAL’s search algorithm on the number of genes [56] and instead has a linear dependency on k for the running time. wASTRIDs is consistently faster (at least two times faster on most conditions) than ASTRID, showing that the new distance calculation algorithm implemented is more efficient than the original one.
Experiment 3: results on the avian biological dataset
Jarvis et al. studied the phylogeny of birds using a dataset on 48 taxa using 14,446 genes [46]. The original gene trees were annotated with RAxML [58] bootstrap support, which we directly use in our wASTRIDs analysis. This dataset is known to have very low gene tree resolution, with the average branch support only \(32\%\) [23].
ASTRAL on the original set of gene trees reconstructed a species tree that failed to reproduce a few wellsupported clades from prior studies, such as the Columbea clade. Nonetheless, contracting low support branches in the gene trees enabled ASTRAL to construct a very plausible topology in agreement with prior studies [14]. In a subsequent study, Zhang and Mirarab reanalyzed the original gene trees using wASTRALh and reconstructed the same topology as ASTRAL running on contracted gene trees [25].
We computed trees using both ASTRID and wASTRID on the Jarvis et al. [46] dataset, and compare them to these other estimated trees. We also compute the number of differing branches between the inferred trees and the two published trees of the Jarvis et al. study [46]: the ExaMLbased concatenation tree, called the TENT (“total evidence nucleotide tree”), and the coalescentbased published tree based on the result of running MPEST with statistical binning [23] (i.e., the MPEST* tree). We also examine whether these trees include the six clades that are proposed by Braun & Kimball to be strongly corroborated [57] for the avian phylogeny.
The wASTRIDs and wASTRAL trees are shown in Fig. 7 and the ASTRID tree is shown in Fig. 8, with branch support given by the localPP criterion. Note that all trees display the six reliable avian clades of Braun & Kimball. Nevertheless, some interesting differences do appear.
The ASTRID tree (shown in Fig. 8) differed in eight or nine edges with each of the wASTRALh, TENT, and MPEST* trees. The ASTRID tree did not recover the Columbea clade, which has also seen strong support in various analyses of this data [14, 46, 59].
Using wASTRIDs, we recovered a topology that is much more in agreement with the other trees, differing in two branches (\(4.4\%\) of the branches) with the wASTRALh tree. It displays the six wellcorroborated clades, and is also in much higher agreement with the published trees (differing in three branches with the TENT, two branches with the MPEST* tree). Looking closer, the two branches where it differs from the wASTRALh tree coincide with the only two extremely low support branches (no more than \(5\%\) in bootstrap support), and thus contracting these branches in the wASTRIDs tree arrives at a topology that is a contraction of the wASTRALh tree. Both wASTRIDs and wASTRALh recover the ColumbeaPasserea split, a major conclusion in the original analysis of this data, and even agree on the placement of the hardtoplace Hoatzin.
For running time, both ASTRID and wASTRIDs finished quickly. ASTRID completed in 6.4 s, and wASTRIDs completed in 1.1 s. Our rerun of wASTRALh on this data finished in 294.2 s, showcasing the much better scalability of the new weighted ASTRAL optimization algorithm in the number of genes, whereas ASTRAL on the same input took 32 h in [14].
In summary, on this dataset, wASTRIDs inferred a more accurate tree compared to ASTRID, is much faster than wASTRALh, and is compatible with wASTRALh after contraction of two very low support branches.
Experiment 4: accuracy given incomplete gene trees
In realworld datasets, genes that are incomplete, so that they miss some species, are commonplace. This “missing data” condition can reduce accuracy, as shown in [7, 47], and the impact of this is studied in this experiment.
Random missing data We show the impact of missing data using a model of uniformly deleting a fixed number of taxa across gene trees in Fig. 9. As the percentage of missing data increases, all methods increase in error, an expected trend as the amount of information in the input decreases. Comparing the weighted and unweighted versions, weighted methods were more accurate than their unweighted counterparts under low to moderate (20% to 60% taxa randomly missing) missing data. However, under the highest level of missing data (80% taxa missing), ASTRAL achieved the best accuracy across all methods, showing a robustness against extreme missing data while wASTRALh achieved the worst accuracy at this extreme. Comparing horizontally between the ASTRID and ASTRAL variants, we see a slight advantage of ASTRAL in accuracy across levels of randomly deleted taxa, suggesting ASTRAL might be more robust to this i.i.d. model of missing data. Although we only show results on one condition, our results suggest that the weighted methods still offer accuracy advantages except on the more extreme conditions of missing data, and both ASTRID variants and ASTRAL variants demonstrate reasonable robustness against missing data.
Cladebased missing data We show the results under the \(M_{\text {clade}}\) based missing data in Fig. 10. Recall that each gene tree uniformly samples a clade from the species tree above a certain size (a parameter \(x = 0.2, 0.4, 0.6\) relative to the number of taxa in the species tree), and only retains taxa from this clade. This process resulted in average percentage of taxa being deleted of \(46\%, 23\%\) and \(10\%\) across the genes.
Under these cladebased missing data conditions, the weighted methods are consistently more accurate than the unweighted variants. The most accurate method is wASTRIDs (tied with wASTRALh under the lowest level of missing data, the most accurate under higher levels). The ASTRID variants do not observably degrade in accuracy as the percentage of deleted taxa increases while the ASTRAL variants do. This relative robustness of weighted ASTRID to the cladebased missing data is largely expected given ASTRID’s robustness shown in the prior study of [47].
Experiment 5: detailed comparison of the distance matrix algorithm
Recall that ASTRID variants first calculate an average distance matrix D from the gene trees, and then run FastME on D. From previously shown results in Table 2, wASTRIDs is clearly faster than ASTRID, only possible due to our change in the distance matrix calculation algorithm. To better benchmark this running time difference brought by this new algorithm for producing D, we broke down the running time of ASTRID2 (the most efficient known implementation) and ASTRID3, which is the ASTRID algorithm implemented inside our wASTRID software. We show the results in Fig. 11, benchmarking on 1000 gene trees.
The runtimes for both ASTRID2 and ASTRID3 on the two smaller datasets are both small, but with an advantage to ASTRID3. However, on the largest dataset with 1001 species and 1000 genes, we see large differences in runtime. Unsurprisingly perhaps, the running time for FastME is essentially the same for both ASTRID and wASTRID, so that the runtime difference between the two methods is due to the time used to calculate the distance matrix, D. A detailed examination of that runtime (Table 3) shows that ASTRID2 takes at least 3 times as long as ASTRID3 to compute the distance matrix, across all conditions. The constanttime speed up is consistent with the fact that both ASTRID and wASTRID implement \(O(n^2 k)\) algorithms for calculating D.
Discussion
Here we discuss the trends seen in this study, and how they compare to trends from previous studies. We begin with a discussion about accuracy before turning to computational performance.
Accuracy
Overall trends
For all model conditions, all tested methods achieved better accuracy when given more genes or as ILS or GTEE decreased. These trends are well known and quite expected for all summary methods [7]. The accuracy advantage of weighted methods over unweighted methods is present in nearly all conditions, but is larger for the conditions with shorter sequences (equivalently, the higher GTEE conditions) and fewer genes. This trend was already established for wASTRALh compared to ASTRAL in [25], but shows that wASTRIDs, just like ASTRAL, is able to better interpret the signal in the input through taking branch support into consideration.
In most cases, weighting improved accuracy for both ASTRAL and ASTRID, but not for the simulated mammalian dataset, where both ASTRAL and ASTRID had conditions where they were more accurate than their weighted versions, and not for the extreme missing data condition (80% taxa missing), where ASTRAL (but not ASTRID) had a condition where it was more accurate than its weighted version. While we do not understand why this occurs, it is noteworthy that both ASTRAL and ASTRID had conditions where they were more accurate than their weighted versions.
wASTRALh vs. wASTRIDs
ASTRAL and ASTRID are known to be among the most accurate summary methods under ILS, and their relative accuracy is dataset dependent, as also shown in our results. The relative accuracy of their weighted counterparts is clearly influenced by the accuracy of their base methods, as seen in the performance differences in the avian and mammalian simulation, where either wASTRIDs and wASTRALh can be the more accurate method. On the ASTRAL simulated datasets (ASTRALIII S100, ASTRALII SimPhy), wASTRIDs and wASTRALh have comparable accuracy, with a small advantage to wASTRALh.
The improvement of wASTRALh over wASTRIDs may be due to its weighting also incorporating branch lengths. A branchlength weighted version of ASTRID (wASTRIDpl) has mixed accuracy compared to ASTRID, and does not compete against the supportweighted wASTRIDs in accuracy. In general, wASTRIDs and wASTRALh serve as accurate species tree inference methods under ILS and are more robust to GTEE than ASTRID and ASTRAL, two of the most accurate summary methods. Both can scale very well, with wASTRIDs much faster. However, the differences in accuracy are dataset dependent, just as the comparison between ASTRAL and ASTRID for accuracy seems dataset dependent.
Impact of missing data
In this study, we examined two models of missing data: the more commonly studied i.i.d. model and the \(M_{\text {clade}}\) model. As expected, error rates increase with deletions of taxa, a trend that arises from reduction in information content (and has been noted in other studies [7, 47]). Of greater interest, however, is the relative impact on ASTRAL and ASTRID, and on their weighted versions. We see that ASTRAL (weighted and unweighted) is more accurate than ASTRID (weighted or unweighted) under the i.i.d. model of missing data, but the reverse occurs for the cladebased model of missing data; this trend was already observed in [47, 60] for ASTRID and ASTRAL, and it is noteworthy that it appears for their weighted versions as well.
We also see that weighted versions are generally more accurate than unweighted versions under missing data, except that ASTRAL is more accurate than wASTRALh for the condition of a very high degree of i.i.d. missing data. This trend was not reported in [25], but we note that they only examined very low levels of missing data (5% of the taxa deleted per gene). Thus, overall our findings are consistent with prior studies, and show both that the weighted versions of ASTRID and ASTRAL have comparable levels of robustness to missing data (with advantage to wASTRID for cladebased missing data and advantage to wASTRAL for i.i.d. missing data).
Given these trends, it is interesting to consider the statistical consistency guarantees for these methods under these models of missing data. Under the i.i.d. model, ASTRAL is statistically consistent while ASTRID is not [9, 47], but both methods are statistically consistent under the cladebased model. That said, the condition under which ASTRAL is consistent for the cladebased model requires that it be run in exact mode, rather than the heuristic mode where a set of allowed bipartitions is computed and the returned tree must draw its bipartitions from that set [47]. In this experiment, we explored ASTRAL only in heuristic mode (and hence not in such a way as to guarantee statistical consistency), and yet wASTRALh and ASTRAL both showed relatively good robustness, for both types of missing data. Similarly, it is worth noting that ASTRID is not statistically consistent under the i.i.d. model, and yet both ASTRID and wASTRIDs had accuracy that was fairly close to that of both ASTRAL and wASTRALh. Thus, all four methods (weighted and unweighted versions of ASTRAL and ASTRID) exhibited comparable robustness to missing data.
Computational performance
All tested methods, with the exception of ASTRAL, exhibit good scalability for large datasets, as wASTRALh, wASTRIDs, and ASTRID can efficiently handle genomescale data. For instance, wASTRALh, wASTRIDs, and ASTRID completed the analysis of the avian biological dataset, a genomescale dataset, in under five minutes, while ASTRAL required more than a day [14]. On simulated conditions, ASTRAL was the only method that ever exceeded our computational constraints during experimentation. This may be due to ASTRAL’s quadratic dependency [56] on the number of allowed bipartitions for the constrained search, which includes all the bipartitions from the input gene trees. Given many gene trees and high ILS or high GTEE, this set of allowed bipartitions can be large, which can increase the runtime for ASTRAL.
While wASTRIDs and wASTRALh are both very scalable, wASTRIDs is clearly faster than wASTRALh. Despite wASTRALh’s improved algorithm and parallelism, wASTRIDs is still two orders of magnitude faster than wASTRALh, and hence might provide better scalability on largescale data.
Conclusions
While the estimation of species trees using summary methods, such as ASTRAL, ASTRID, MPEST, and others, is now commonplace, it is known that gene tree estimation error reduces the accuracy of the estimated species tree. We presented supportweighted ASTRID (wASTRIDs), an improvement over ASTRID that incorporates uncertainty in gene tree branches into its estimation of the average intertaxon distance matrix. The development of wASTRIDs is inspired by the recent work of weighted ASTRAL (wASTRALh), which improved upon ASTRAL, and we showed that wASTRIDs obtained similar accuracy improvements over ASTRID. The advantage provided by wASTRIDs over ASTRID is most noteworthy under higher degrees of gene tree estimation error. wASTRIDs has very close accuracy to wASTRALh and is sometimes more accurate, but overall wASTRALh has a small advantage in accuracy, while wASTRIDs has an advantage in speed.
Although weighting usually helped accuracy for both ASTRID and ASTRAL, there were cases where it did not help, and even some cases where it reduced accuracy. All tested methods show a degree of robustness to missing data, but ASTRAL variants and ASTRID variants differ in their relative performance depending on the model of missing data.
This study was limited to datasets where the only cause for gene tree discordance with the species tree was ILS and gene tree estimation error. When considering real world datasets that may have other sources of gene tree heterogeneity, such as GDL or HGT, it seems likely that ASTRAL and other quartetbased methods may have an advantage over ASTRID and wASTRIDs, due to the theoretical proofs of statistical consistency for quartetbased methods for conditions involving gene duplication and loss or HGT (and the lack of such proofs for distancebased species tree estimation methods under the same conditions) [61,62,63,64].
Although wASTRIDs is highly accurate and very fast, we recommend using wASTRIDs in conjunction with wASTRALh and other species tree estimation methods. Due to its speed, the inclusion of wASTRIDs adds little computational burden, and having multiple different approaches for estimating the species tree, each based on a very different technique, can provide insights into what parts of the species tree are most reliably recovered, and which parts may need further data in order for full resolution.
This study suggests several directions for future work. Most importantly, finding a way to incorporate branch lengths into the branch certainty scoring for wASTRIDs, i.e. a hybrid weighting, could improve accuracy and might close the accuracy gap between wASTRIDs and wASTRALh under some conditions.
Another direction for future work is species tree estimation in the presence of gene duplication and loss, where gene family trees have multiple copies of species and so are called MULtrees [65]. The combination of DISCO [66], a method for decomposing the MULtrees into singlecopy gene trees, with ASTRID produced very good accuracy and scalability [66], suggesting that combining DISCO with wASTRID might be even more accurate.
We also note that wASTRID might be useful for supertree estimation, a major challenge that currently has no fast and accurate methods that can scale to large datasets [67, 68]. Although ASTRID performed poorly as a supertree method for some model conditions [68], the reason for its poor accuracy may have been its reliance on the PhyD\(^*\) methods for handling missing data (i.e., constructing trees from incomplete matrices). Given the more accurate handling of missing data introduced in this updated version of ASTRID and our introduced accuracy improvement taking branch support into account, wASTRID might prove to be a more accurate method for supertree estimation.
It may also be useful to use wASTRID to develop a weighted version of FASTRAL [11], a technique for speeding up ASTRAL. In FASTRAL, rather than building the set X of allowed bipartitions for the ASTRAL optimization criterion using the default setting (which can make X very large, as it includes by default all the bipartitions from all the input gene trees), the set of allowed bipartitions is taken from the species trees computed using ASTRID on random subsets of the gene trees. As shown in [11], FASTRAL maintains accuracy (and in some cases improves accuracy) compared to default ASTRAL, and can greatly reduce the runtime. Given the potential improvements in accuracy and the demonstrated improvement in speed, replacing ASTRID by wASTRID to produce a weighted version of FASTRAL might provide substantial improvements over FASTRAL.
Another direction for future work is to modify wASTRID to enable improved robustness to missing data, using (for example) the approach in Asteroid [60], which replaces the BME criterion by a revised criterion that better handles missing data.
This study explored accuracy using normalized RobinsonFoulds distances. Other studies [69], have suggested the use of alternative criteria, including quartetsimilarity, to evaluate accuracy, when tree estimation is hampered by the presence of rogue taxa (i.e., taxa that can be added to a tree in many places). While these conditions did not arise in this study, which was largely based on simulated data, realworld datasets often do have such rogue taxa, and so subsequent studies should examine this question more carefully. As noted in particular in [69], this question may be particularly relevant for analyses of very large datasets, with more than 1000 species (the limit explored in this study). Hence, future work should also evaluate species tree estimation on biological datasets where rogue taxa are conjectured or known to create challenges, and use alternative accuracy criteria in those cases.
Although this study examined relatively large datasets (up to 1001 species and 1000 genes), larger datasets may create additional challenges.
For example, branch support in gene trees is known to be very low on large datsets, as discussed in [70], potentially making it difficult to reliably use weighted versions of summary methods, such as weighted ASTRAL and weighted ASTRID. Very large datasets also present computational challenges, and improving the speed for the distance matrix calculation through parallelization is a natural direction. Thus, future work should examine these questions in even larger phylogenomic datasets.
Availability of data and materials
Weighted ASTRID is available in open source form at [52]. All datasets, other than for Experiment 4, are from prior studies and freely available. For Experiment 4, we provide the modified gene trees, species trees, and scripts used to generate the data at [71]. The ASTRALIII S100 and S200 data with aBayes support are available from weighted ASTRAL study at [72]. The “H”suffixed data are available from [48]. The mammalian and avian simulated data are available from [73]. The avian biological data are available at [74].
References
Kubatko LS, Degnan JH. Inconsistency of phylogenetic estimates from concatenated data under coalescence. Syst Biol. 2007;56(1):17–24. https://doi.org/10.1080/10635150601146041.
Takahata N. Gene genealogy in three related populations: consistency probability between gene and population trees. Genetics. 1989;122(4):957–66. https://doi.org/10.1093/genetics/122.4.957.
Maddison WP. Gene trees in species trees. Syst Biol. 1997;46(3):523–36. https://doi.org/10.1093/sysbio/46.3.523.
Roch S, Steel M. Likelihoodbased tree reconstruction on a concatenation of aligned sequence data sets can be statistically inconsistent. Theor Popul Biol. 2015;100:56–62. https://doi.org/10.1016/j.tpb.2014.12.005.
Roch S, Nute M, Warnow T. Longbranch attraction in species tree estimation: inconsistency of partitioned likelihood and topologybased summary methods. Syst Biol. 2019;68(2):281–97.
Mirarab S, Reaz R, Bayzid MS, Zimmermann T, Swenson MS, Warnow T. ASTRAL: genomescale coalescentbased species tree estimation. Bioinformatics. 2014;30(17):541–8. https://doi.org/10.1093/bioinformatics/btu462.
Molloy EK, Warnow T. To include or not to include: the impact of gene filtering on species tree estimation methods. Syst Biol. 2018;67(2):285–303. https://doi.org/10.1093/sysbio/syx077.
Liu L, Yu L, Edwards SV. A maximum pseudolikelihood approach for estimating species trees under the coalescent model. BMC Evol Biol. 2010;10(1):302. https://doi.org/10.1186/1471214810302.
Rhodes JA, Nute MG, Warnow T. NJst and ASTRID are not statistically consistent under a random model of missing data. arXiv. 2020. https://doi.org/10.48550/ARXIV.2001.07844.
Vachaspati P, Warnow T. ASTRID: accurate species TRees from internode distances. BMC Genomics. 2015;16(10):3. https://doi.org/10.1186/1471216416S10S3.
Dibaeinia P, TabeBordbar S, Warnow T. FASTRAL: improving scalability of phylogenomic analysis. Bioinformatics. 2021;37(16):2317–24. https://doi.org/10.1093/bioinformatics/btab093.
Mahbub M, Wahab Z, Reaz R, Rahman MS, Bayzid MS. wQFM: highly accurate genomescale species tree estimation from weighted quartets. Bioinformatics. 2021;37(21):3734–43. https://doi.org/10.1093/bioinformatics/btab428.
Mirarab S, Warnow T. ASTRALII: coalescentbased species tree estimation with many hundreds of taxa and thousands of genes. Bioinformatics. 2015;31(12):44–52. https://doi.org/10.1093/bioinformatics/btv234.
Zhang C, Rabiee M, Sayyari E, Mirarab S. ASTRALIII: polynomial time species tree reconstruction from partially resolved gene trees. BMC Bioinformatics. 2018;19(6):153. https://doi.org/10.1186/s128590182129y.
Xi Z, Liu L, Davis CC. Genes with minimal phylogenetic information are problematic for coalescent analyses when gene tree estimation is biased. Mol Phylogenet Evol. 2015;92:63–71. https://doi.org/10.1016/j.ympev.2015.06.009.
Heled J, Drummond AJ. Bayesian inference of species trees from multilocus data. Mol Biol Evol. 2009;27(3):570–80.
Ogilvie HA, Bouckaert RR, Drummond AJ. StarBEAST2 brings faster species tree inference and accurate estimates of substitution rates. Mol Biol Evol. 2017;34(8):2101–14. https://doi.org/10.1093/molbev/msx126.
Zimmermann T, Mirarab S, Warnow T. BBCA: improving the scalability of *BEAST using random binning. BMC Genomics. 2014;15(6):1–9.
Chifman J, Kubatko L. Quartet inference from SNP data under the coalescent model. Bioinformatics. 2014;30(23):3317–24. https://doi.org/10.1093/bioinformatics/btu530.
Richards A, Kubatko L. Bayesianweighted triplet and quartet methods for species tree inference. Bull Math Biol. 2021;83(9):93.
Molloy EK, Warnow T. Statistically consistent divideandconquer pipelines for phylogeny estimation using NJMerge. Algorithms Mol Biol. 2019;14(1):1–17.
Molloy E, Warnow T. Largescale species tree estimation. In: Knowles L, Kubatko L, editors. Species tree inference: a guide to methods and applications, pp. 19– 42. Princeton University Press, Princeton, NJ; 2019. Also appears in an arXiv preprint arXiv:1904.02600.
Mirarab S, Bayzid MS, Boussau B, Warnow T. Statistical binning enables an accurate coalescentbased estimation of the avian tree. Science. 2014;346(6215):1250463. https://doi.org/10.1126/science.1250463.
Bayzid MS, Mirarab S, Boussau B, Warnow T. Weighted statistical binning: enabling statistically consistent genomescale phylogenetic analyses. PLoS ONE. 2015;10(6):0129183. https://doi.org/10.1371/journal.pone.0129183.
Zhang C, Mirarab S. Weighting by gene tree uncertainty improves accuracy of quartetbased species trees. Mol Biol Evol. 2022. https://doi.org/10.1093/molbev/msac215.
Mirarab S, Bayzid MS, Warnow T. Evaluating summary methods for multilocus species tree estimation in the presence of incomplete lineage sorting. Syst Biol. 2016;65(3):366–80.
Patel S, Kimball RT, Braun EL. Error in phylogenetic estimation for bushes in the tree of life. J Phylogenet Evol Biol. 2013;1(2):1–10.
Robinson DF, Foulds LR. Comparison of phylogenetic trees. Math Biosci. 1981;53(1):131–47. https://doi.org/10.1016/00255564(81)900432.
Saitou N, Nei M. The neighborjoining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol. 1987;4(4):406–25. https://doi.org/10.1093/oxfordjournals.molbev.a040454.
Liu L, Yu L. Estimating species trees from unrooted gene trees. Syst Biol. 2011;60(5):661–7. https://doi.org/10.1093/sysbio/syr027.
Allman ES, Degnan JH, Rhodes JA. Species tree inference from gene splits by unrooted STAR methods. IEEE/ACM Trans Comput Biol Bioinf. 2018;15(1):337–42. https://doi.org/10.1109/TCBB.2016.2604812.
Atteson K. The performance of neighborjoining methods of phylogenetic reconstruction. Algorithmica. 1999;25:251–78.
Bordewich M, Gascuel O, Huber KT, Moulton V. Consistency of topological moves based on the balanced minimum evolution principle of phylogenetic inference. IEEE/ACM Trans Comput Biol Bioinf. 2008;6(1):110–7.
Bordewich M, Mihaescu R. Accuracy guarantees for phylogeny reconstruction algorithms based on balanced minimum evolution. IEEE/ACM Trans Comput Biol Bioinf. 2013;10(3):576–83.
Lefort V, Desper R, Gascuel O. FastME 2.0: a comprehensive, accurate, and fast distancebased phylogeny inference program. Mol Biol Evol. 2015;32(10):2798–800. https://doi.org/10.1093/molbev/msv150.
Fiorini S, Joret G. Approximating the balanced minimum evolution problem. Oper Res Lett. 2012;40(1):31–5.
Criscuolo A, Gascuel O. Fast NJlike algorithms to deal with incomplete distance matrices. BMC Bioinform. 2008;9:1–16.
Vachaspati P. Large scale phylogenomic estimation. PhD dissertation, University of Illinois UrbanaChampaign; 2019.
Michener CD, Sokal RR. A quantitative approach to a problem in classification. Evolution. 1957;11(2):130–62.
Vachaspati P. ASTRID2 github site. 2023. https://pranjalv123.github.io/ASTRID/.
Anisimova M, Gil M, Dufayard JF, Dessimoz C, Gascuel O. Survey of branch support methods demonstrates accuracy, power, and robustness of fast likelihoodbased approximation schemes. Syst Biol. 2011;60(5):685–99. https://doi.org/10.1093/sysbio/syr041.
Wiens JJ, Kuczynski CA, Smith SA, Mulcahy DG, Sites JW Jr, Townsend TM, Reeder TW. Branch lengths, support, and congruence: testing the phylogenomic approach with 20 nuclear loci in snakes. Syst Biol. 2008;57(3):420–31.
Liu L, Yu L, Pearl DK, Edwards SV. Estimating species phylogenies using coalescence times among sequences. Syst Biol. 2009;58(5):468–77. https://doi.org/10.1093/sysbio/syp031.
Desper R, Gascuel O. Fast and accurate phylogeny reconstruction algorithms based on the minimumevolution principle. J Comput Biol. 2002;9(5):687–705. https://doi.org/10.1089/106652702761034136. (PMID: 12487758).
Moshiri N. TreeSwift: a massively scalable Python tree package. SoftwareX. 2020;11: 100436. https://doi.org/10.1016/j.softx.2020.100436.
Jarvis ED, Mirarab S, Aberer AJ, Li B, Houde P, Li C, Ho SYW, Faircloth BC, Nabholz B, Howard JT, Suh A, Weber CC, da Fonseca RR, Li J, Zhang F, Li H, Zhou L, Narula N, Liu L, Ganapathy G, Boussau B, Bayzid MS, Zavidovych V, Subramanian S, Gabaldón T, CapellaGutiérrez S, HuertaCepas J, Rekepalli B, Munch K, Schierup M, Lindow B, Warren WC, Ray D, Green RE, Bruford MW, Zhan X, Dixon A, Li S, Li N, Huang Y, Derryberry EP, Bertelsen MF, Sheldon FH, Brumfield RT, Mello CV, Lovell PV, Wirthlin M, Schneider MPC, Prosdocimi F, Samaniego JA, Velazquez AMV, AlfaroNúñez A, Campos PF, Petersen B, SicheritzPonten T, Pas A, Bailey T, Scofield P, Bunce M, Lambert DM, Zhou Q, Perelman P, Driskell AC, Shapiro B, Xiong Z, Zeng Y, Liu S, Li Z, Liu B, Wu K, Xiao J, Yinqi X, Zheng Q, Zhang Y, Yang H, Wang J, Smeds L, Rheindt FE, Braun M, Fjeldsa J, Orlando L, Barker FK, Jønsson KA, Johnson W, Koepfli KP, O’Brien S, Haussler D, Ryder OA, Rahbek C, Willerslev E, Graves GR, Glenn TC, McCormack J, Burt D, Ellegren H, Alström P, Edwards SV, Stamatakis A, Mindell DP, Cracraft J, Braun EL, Warnow T, Jun W, Gilbert MTP, Zhang G. Wholegenome analyses resolve early branches in the tree of life of modern birds. Science. 2014;346(6215):1320–31. https://doi.org/10.1126/science.1253451.
Nute M, Chou J, Molloy EK, Warnow T. The performance of coalescentbased species tree estimation methods under models of missing data. BMC Genomics. 2018;19(5):1–22.
Liu B, Warnow T. Data from "Scalable species tree inference with external constraints". Journal of Computational Biology 29.7 (2022): 664678. 2021. https://doi.org/10.13012/B2IDB2566000_V1.
Minh BQ, Schmidt HA, Chernomor O, Schrempf D, Woodhams MD, Von Haeseler A, Lanfear R. IQTREE 2: new models and efficient methods for phylogenetic inference in the genomic era. Mol Biol Evol. 2020;37(5):1530–4.
Price MN, Dehal PS, Arkin AP. FastTree 2—approximately maximumlikelihood trees for large alignments. PLoS ONE. 2010;5(3):9490. https://doi.org/10.1371/journal.pone.0009490.
Felsenstein J. Confidence limits on phylogenies: an approach using the bootstrap. Evolution. 1985;39(4):783–91. https://doi.org/10.1111/j.15585646.1985.tb00420.x.
Liu B. internode: fast implementation of ASTRIDlike methods. 2023. https://github.com/RuneBlaze/internode. Accessed 27 Mar 2023.
Zhang C, Rabiee M, Sayyari E, Mirarab S. Software of ASTRALIII: polynomial time species tree reconstruction from partially resolved gene trees. 2018. https://github.com/smirarab/ASTRAL. Accessed 27 Mar 2023.
Zhang C, Mirarab S. Accurate species tree EstimatoR (ASTER*). 2022. https://github.com/chaoszhang/ASTER.
Sayyari E, Mirarab S. Fast coalescentbased computation of local branch support from quartet frequencies. Mol Biol Evol. 2016;33(7):1654–68. https://doi.org/10.1093/molbev/msw079.
Mirarab S. Species tree estimation using ASTRAL: practical considerations. In: Knowles L, Kubatko L, editors. Species tree inference: a guide to methods and applications, Princeton, NJ: Princeton University Press; 2019. pp 68–88. Also appears in an arXiv preprint arXiv:1904.02600.
Braun EL, Kimball RT. Data types and the phylogeny of neoaves. Birds. 2021;2(1):1–22. https://doi.org/10.3390/birds2010001.
Stamatakis A. RAxML version 8: a tool for phylogenetic analysis and postanalysis of large phylogenies. Bioinformatics. 2014;30(9):1312–3. https://doi.org/10.1093/bioinformatics/btu033.
Rabiee M, Mirarab S. Forcing external constraints on tree inference using astral. BMC Genomics. 2020;21(2):1–13.
Morel B, Williams TA, Stamatakis A. Asteroid: a new algorithm to infer species trees from gene trees under high proportions of missing data. Bioinformatics. 2023;39(1):832.
Legried B, Molloy EK, Warnow T, Roch S. Polynomialtime statistical estimation of species trees under gene duplication and loss. J Comput Biol. 2021;28(5):452–68.
Markin A, Eulenstein O. Quartetbased inference is statistically consistent under the unified duplicationlosscoalescence model. Bioinformatics. 2021;37(22):4064–74.
Daskalakis C, Roch S. Species trees from gene trees despite a high rate of lateral genetic transfer: a tight bound. In: Proceedings of the TwentySeventh Annual ACMSIAM Symposium on Discrete Algorithms, SIAM; 2016, pp. 1621–1630.
Hill M, Legried B, Roch S. Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods. Ann Appl Probab. 2022;32(6):4681–705.
Huber KT, Moulton V. Phylogenetic networks from multilabelled trees. J Math Biol. 2006;52:613–32.
Willson J, Roddur MS, Liu B, Zaharias P, Warnow T. DISCO: species tree inference using multicopy gene family tree decomposition. Syst Biol. 2022;71(3):610–29. https://doi.org/10.1093/sysbio/syab070.
Warnow T. Computational phylogenetics: an introduction to designing methods for phylogeny estimation. Cambridge: Cambridge University Press; 2017.
Vachaspati P, Warnow T. FastRFS: fast and accurate RobinsonFoulds Supertrees using constrained exact optimization. Bioinformatics. 2016;33(5):631–9. https://doi.org/10.1093/bioinformatics/btw600.
Lemoine F, Domelevo Entfellner JB, Wilkinson E, Correia D, Dávila Felipe M, De Oliveira T, Gascuel O. Renewing Felsenstein’s phylogenetic bootstrap in the era of big data. Nature. 2018;556(7702):452–6.
Zaharias P, Lemoine F, Gascuel O. Robustness of Felsenstein’s versus transfer bootstrap supports with respect to taxon sampling. bioRxiv. 2023; 2023–02.
Liu B. Extra data for weighted ASTRID. 2023. https://github.com/RuneBlaze/wastridextradata. Accessed 27 Mar 2023.
Zhang C. WeightedASTRAL data. 2023. https://github.com/chaoszhang/WeightedASTRAL_data. Accessed 27 Mar 2023.
Mirarab S, Bayzid MS, Boussau B, Warnow T. Datasets for statistical binning. 2023. https://sites.google.com/eng.ucsd.edu/datasets/binning. Accessed 27 Mar 2023.
Jarvis E, Mirarab S, Aberer A, Li B, Houde P, Li C, et al. Phylogenomic analyses data of the Avian Phylogenomics Project. GigaScience. 2014. 2015.
Lemoine F, Gascuel O. Gotree/Goalign: toolkit and Go API to facilitate the development of phylogenetic workflows. NAR Genomics Bioinform. 2021. https://doi.org/10.1093/nargab/lqab075.
Kozlov AM, Darriba D, Flouri T, Morel B, Stamatakis A. RAxMLNG: a fast, scalable and userfriendly tool for maximum likelihood phylogenetic inference. Bioinformatics. 2019;35(21):4453–5. https://doi.org/10.1093/bioinformatics/btz305.
Stamatakis A, Hoover P, Rougemont J. A rapid bootstrap algorithm for the RAxML web servers. Syst Biol. 2008;57(5):758–71.
Hoang DT, Chernomor O, Von Haeseler A, Minh BQ, Vinh LS. UFBoot2: improving the ultrafast bootstrap approximation. Mol Biol Evol. 2018;35(2):518–22.
Shimodaira H, Hasegawa M. Multiple comparisons of loglikelihoods with applications to phylogenetic inference. Mol Biol Evol. 1999;16(8):1114.
Guindon S, Delsuc F, Dufayard JF, Gascuel O. Estimating maximum likelihood phylogenies with phyml. Bioinform DNA Sequence Anal. 2009; 113–137.
Rannala B, Yang Z. Probability distribution of molecular evolutionary trees: a new method of phylogenetic inference. J Mol Evol. 1996;43:304–11.
Simmons MP, Pickett KM, Miya M. How meaningful are Bayesian support values? Mol Biol Evol. 2004;21(1):188–99.
Acknowledgements
We thank the anonymous reviewers for their helpful feedback.
Funding
This research was supported in part by the Grainger Foundation.
Author information
Authors and Affiliations
Contributions
BL conceived the approach and implemented the software. TW and BL designed the study. BL conducted the experiments. BL and TW interpreted the experimental results. TW and BL proved the theoretical results. BL and TW wrote the manuscript. Both authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Ethics approval and consent to participate
Not applicable.
Consent for publication
Not applicable.
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix A: commands
Weighted ASTRID
The commands differ depending on the type of support annotated on the gene trees. For FastTree SHlike, bootstrap support, and aBayes support, the commands for wASTRIDs are respectively:
For the final setting of wASTRIDpl (distance defined by path lengths, with branch lengths normalized by the maximum pathlength in tree), the above commands need to be appended with an additional flag: m nlength (distance using “normalized branch length” instead of the default m support).
Other summary methods
Weighted ASTRAL
We ran hybridweighted ASTRAL (v1.4.2.3) using the following command on trees annotated with aBayes support:
ASTRID
For all experiments except for Experiment 4, we ran ASTRID2 compiled from scratch from [40] without missing data imputation, using the following command:
In Experiment 4, we instead used the following command:
ASTRAL
We ran ASTRAL (v5.7.8) using the following command:
FastME
ASTRID and wASTRID bind into and call subroutines inside FastME directly instead of calling FastME’s CLI interface. We bundle our software with FastME (v2.1.5). See https://github.com/RuneBlaze/internode/blob/3791b7e344869f3beb9f11e3d588e5e4eff788ba/src/internode.rs#L345 for how wASTRID binds into FastME, which is a translation of the C++ code from ASTRID.
Obtaining gene tree branch support
Approximate Bayesian support
We computed IQTREE (v2.1.2) aBayes support using the following command:
where $aln is the alignment file for the gene tree, and $gtree is the path to the gene tree topology.
Bootstrap support
We computed bootstrap support (on the training dataset) using FastTree (v2.1.11) on bootstrap replicates generated by Goalign (v0.3.5) [75].
The following command was used to generate bootstrap replicates ($aln is the original gene alignment):
The FastTree command used for inferring a tree from one bootstrap replicate is ($bs_aln is one bootstrap alignment replicate generated by Goalign):
The FastTree bootstrap trees are then randomly resolved to eliminate polytomies, and then mapped by RAxMLNG [76] to the original gene trees using the following command:
where $gtree is the path to the original gene tree, and $bs_trees contains newline separated newick trees inferred on the bootstrap replicates.
Appendix B: additional text
Failures to complete
ASTRAL failed to complete 24/50 replicates (replicates 2, 4, 6, 8, 9, 11, 13, 15, 16, 17, 20, 23, 27, 28, 29, 30, 32, 36, 38, 39, 40, 41, 48, and 49) on the MC11H condition (\(n = 1001){\,under\,} k = 1000\). The 24 log files indicate that ASTRAL timed out on each of the replicates. An example of the last three lines of the log files is attached:
Branch support
Many techniques are available to assess branch support. In the following paragraph, let \(T\) denote the gene tree that we aim to annotate each nonleaf edge \(e \in E(T)\) with support, and let \(A\) be the gene alignment that we used to infer \(T\).
The most common approach is the bootstrap method first proposed by Joe Felsenstein [51]. Briefly, a fixed number of “bootstrap alignments” \(\{A_1, \ldots , A_k \}\) (kaparameter commonly set to 100 or 1000) are sampled with replacement from columns of A. Each bootstrap alignment \(A_i\) has same number of columns as A. Boot straptrees \(\{T_i\}\) are then infer red fromt. Variants of Felsenstein’s support exists, including Rapid Bootstrap Support [77] and Ultrafast Bootstrap [78] designed for speed. A different approach, the Transfer Bootstrap Expectation [69], was proposed in order to enable robustness to rogue taxa in large phylogenies.
This study extensively uses the approximate Bayes branch support [41], available in the IQTREE [49] software, which is an approximated version of the posterior probability of an NNI configuration at a particular branch. Similarly only exploring the NNI configurations around a branch, FastTree SHlike support, which relies on a ShimodairaHasegawalike procedure [79, 80], was also explored in this study.
The Bayesian posterior probability support [81], a well known form of support approximating the posterior probability of the bipartition, seems computationally infeasible for datasets in this study \((n \ge 200)\) and is thought to be an overconfident form of support [82].
Appendix C: additional table
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.
About this article
Cite this article
Liu, B., Warnow, T. Weighted ASTRID: fast and accurate species trees from weighted internode distances. Algorithms Mol Biol 18, 6 (2023). https://doi.org/10.1186/s13015023002306
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13015023002306