 Research
 Open Access
 Published:
Anchoring quartetbased phylogenetic distances and applications to species tree reconstruction
BMC Genomicsvolume 17, Article number: 783 (2016)
Abstract
Background
Inferring species trees from gene trees using the coalescentbased summary methods has been the subject of much attention, yet new scalable and accurate methods are needed.
Results
We introduce DISTIQUE, a new statistically consistent summary method for inferring species trees from gene trees under the coalescent model. We generalize our results to arbitrary phylogenetic inference problems; we show that two arbitrarily chosen leaves, called anchors, can be used to estimate relative distances between all other pairs of leaves by inferring relevant quartet trees. This results in a family of distancebased tree inference methods, with running times ranging between quadratic to quartic in the number of leaves.
Conclusions
We show in simulated studies that DISTIQUE has comparable accuracy to leading coalescentbased summary methods and reduced running times.
Background
The evolutionary histories of species and genes can be discordant [1], necessitating a distinction between genes trees and species trees. Incomplete Lineage Sorting (ILS), modeled by the multispecies coalescent (MSC) model [2], is one of the main causes of discordance. A fast approach for estimating the species relationships in the face of such discordances is to first estimate a gene tree for each gene and to summarize the gene trees to build a species tree. The summary method, thus, takes as input a set of gene trees and returns a species tree. A desirable property for a summary method is statistical consistency (a theoretical guarantee that it converges in probability to the correct species tree as the number of errorfree genes increases). Many statistically consistent summary methods are available (e.g., ASTRAL [3, 4], BUCKypopulation [5], and MPEST [6]), and coalescentbased species tree estimation is a vibrant field of research, with many recent examples of successful biological analyses [7–9] (see [10–14] for criticism of these methods, especially their sensitivity to gene tree error).
Inferring trees using pairwise distances is a wellstudied general method of phylogenetic reconstruction [15–18], and several summary methods are distancebased. These methods first compute a pairwise distance between species based on input gene trees and then use a distance method (e.g., neighbor joining [17]) to build the species tree; examples of distancebased summary methods are STAR [19], GLASS [20], NJst [21], and its new implementation, ASTRID [22].
Another powerful general approach to phylogenetic reconstruction is analyzing quartets, which are subsets of four leaves in a tree. Quartet methods first infer a set of quartet trees and then combine them to build a tree on the full dataset [16, 23, 24]. Induced quartet trees have also been used [24–28] to combine a collection of input trees to build a socalled supertree [29]. Quartetbased phylogeny estimation has been revived in recent years [3, 5, 30–32] because of its connections to coalescentbased analyses [33–35]. Under the MSC model, for unrooted species trees with four leaves, the most likely unrooted gene tree is identical to the species tree [33] (but this is not true for larger trees [34, 36]). Furthermore, the length of the internal branch in a quartet species tree (in coalescent units) defines the probabilities of the three possible gene tree quartet topologies [34]. Some recent and statistically consistent quartetbased species tree estimation methods rely on these results. For example, ASTRAL seeks the species tree with the maximum number of quartet trees shared with input gene trees [3, 4].
In this paper, we introduce a new coalescentbased summary method, called DISTIQUE (Distancebased Inference of Species Trees from Induced QUartet Elements). Like ASTRAL, DISTIQUE is based on quartets, but instead of directly optimizing a quartet score, it uses quartets to compute pairwise distances, which are then used as input to a distance method. The innovative aspect of DISTIQUE is its method of calculating distances. It chooses two arbitrary “anchor” species and computes the frequency of quartet trees induced by gene trees that include the two anchors as sisters. We show that these frequencies can be transformed into an asymptotically additive distance matrix; using this matrix with a consistent distancebased method (e.g., neighbor joining) gives a statistically consistent summary method. This method would generate a species tree on all species except the two anchors in Θ(n ^{2} k) (for n species and k gene trees). However, using multiple anchor pairs can increase accuracy and can ensure all species are included in the final tree. Various strategies for choosing anchors and combining their results are introduced, with running times ranging between Θ(n ^{2} k) and Θ(n ^{4} k).
After describing DISTIQUE, we show that the anchoring approach can be generalized to any tree inference problem. Assume we have a way to compute the topology and the internal branch length for any quartet of leaves. We show that as long as this quartet estimator is consistent, our anchoring mechanism and a certain family of transformations can be used to compute an additive distance matrix, which in turn can be used to infer the correct tree topology but not correct branch lengths. This result is rather surprising because, for any pair of anchors and a pair of other leaves, the quartet internal branch length will often be very different from the distance between nonanchor leaves. Thus, anchoring produces incorrect pairwise distances that are nevertheless additive for the correct tree topology. DISTIQUE uses anchoring because for the MSCbased species tree inference, pairwise species distances are not straightforward to define but inferring quartet trees is easy. We evaluate the accuracy of DISTIQUE on simulated and biological data and show that its accuracy is competitive with the best alternative methods even when used with relatively small subsets of all possible anchors.
Methods
Notation and background: Let \(\mathcal {L}\) denote the leafset of size n. For an unrooted tree T on \(\mathcal {L}\), the set of quartet trees induced on all possible \({n \choose 4}\) quartets of leaves is denoted by \(\mathcal {Q}^{T}\). We use a b.c d to denote that a and b are sisters in the quartet tree on {a,b,c,d}. A tree T is equivalent to a distance matrix D ^{T}, computed by summing lengths of the edges between pairs of leaves, and a distance matrix that corresponds to a tree is called additive [37]. We refer to the unique tree [37] associated with the additive distance matrix D as T ^{D} or T. Also, \(T\mathcal {L}'\) and \(D\mathcal {L}'\) denote T and D restricted to the leafset \(\mathcal {L}'\).
To test for the additivity of a distance matrix D, we can use the four point condition [37]. For a quartet of leaves \(Q=\{a,b,c,d\}\subset \mathcal {L}\), the median and the maximum of the following three values should be the same: {D[a,b]+D[c,d],D[a,c]+D[b,d],D[a,d]+D[b,c]}. When internal branch lengths are assumed positive, as we do throughout this paper, the minimum value is strictly smaller than the median. Assuming w.l.o.g. D[a,b]+D[c,d] is the smallest value, we can infer a b.c d is the topology induced by T ^{D}. Let τ(Q)>0 denote the length of the single internal branch in this quartet tree, which we call its “quartet length”; i.e., if \(ab.cd \in \mathcal {Q}^{T}\), then \(\tau (Q)= \frac {1}{2} (D[a,c] + D[b,d]  D[a,b]  D[c,d])\).
General theoretical results
Definition 1
Given two positive constants α,βand a monotonically increasing function f(x) bounded above by β for positive x (i.e., 0<f(x)<β for x>0), two “anchor” leaves \(u,v\in \mathcal {L}\), and a tree T equivalent to distance matrix D with the corresponding quartet length function τ(Q), we define:
\(D^{\prime }, D^{\prime }_{u}\), and \(D^{\prime }_{uv}\) are distance matrices on leafsets \(\mathcal {L}, \mathcal {L}\{v\}\), and \(\mathcal {L}\{u,v\}\), respectively, and are called “allpairs anchored”, “single anchored”, and “double anchored”. We say \(D^{\prime }_{uv}\) is induced from D anchored by u,v. D ^{′′} is called an “allpairs anchored maximum distance matrix” and is defined on the leafset \(\mathcal {L}\).
Theorem 1
Let D ^{T} be an additive distance matrix. A double anchored distance matrix \(D^{\prime }_{uv}\) induced from D ^{T} anchored by arbitrary leaves \(u,v\in \mathcal {L}\) is an additive distance matrix for the leafset \(\mathcal {L}^{\prime }=\mathcal {L}\{u,v\}\) and corresponds to a tree that is topologically identical to \(T\mathcal {L}^{\prime }\). Similarly, a single anchored distance matrix \(D^{\prime }_{v}\) induced from D ^{T} anchored by an arbitrary leaf and an allpairs anchored distance matrix D ^{′} induced from D ^{T} are additive distance matrices for the leafsets \(\mathcal {L}\{v\}\) and \(\mathcal {L}\), respectively, and correspond to trees that are topologically identical to \(T\mathcal {L}\{v\}\) and T, respectively.
Theorem 2
An Allpairs anchored maximum distance matrix D ^{′′} induced from additive matrix D ^{T} is additive and corresponds to a tree with the identical topology and internal branch lengths to T.
Both theorems are proved in the appendix. Theorem 2 is similar to a result given by Brodal et al. [38], and is easy to prove. The basic idea is that for any two nonsister leaves {a,b}, there is a pair of anchors such that in the resulting quartet, a and b are not sisters, and the quartet length is exactly the same as the distance between the two leaves minus their terminal branches. We note that similar to us, Brodal et al. use the concept of anchors, but instead of using anchors to define distances, they use anchors to efficiently build Buneman trees from given distances. Thus, despite some parallels, our anchoring mechanism is novel; In particular, Brodal et al. do not prove our surprising result that a single arbitrarily chosen pair of anchors gives additive distances for the correct topology.
Theorem 1 states anchored distances induced from an additive matrix will correspond to the same topology as the initial matrix (albeit with wrong branch lengths). This result is surprising, but its usefulness might be less clear. Theorem 1 enables new estimators of the tree topology that rely on quartets to compute pairwise distances. Let \(\mathcal {D}\) denote the input data to be used for inferring a phylogeny. Regardless of the nature of \(\mathcal {D}\), we require having a quartet estimator. A quartet estimator is a function that given a quartet of leaves Q, uses \(\mathcal {D}\) to estimate the quartet tree topology and the quartet length τ(Q), and is statistically consistent if, as the size of \(\mathcal {D}\) increases, the estimated quartet topology and length both converge in probability to correct values. Statistically consistent quartet estimators can be designed for various models (e.g., sequence evolution [39] and the MSC [33, 34]).
Given a statistically consistent quartet estimator, a family of statistically consistent tree inference algorithms can be designed (Additional file 1: Algorithm S1). Details and proofs are given in the (Additional file 1: Section 2.4). The basic idea is the following. We can use the quartet estimator to infer a distance matrix that asymptotically can be made arbitrarily close to an additive distance matrix for the true tree topology. Using a method such as neighborjoining that infers the correct tree for additive distance matrices with a safety radius will give a consistent estimator of the tree [40].
DISTIQUE (theory)
Problem statement: Given an input dataset \(\mathcal {G}\) of a collection of k unrooted gene trees, we seek to find the unrooted species tree topology, assuming gene trees are generated by the MSC model [2].
Next, we first describe anchored distances based on the MSC model used in DISTIQUE. We then describe the algorithmic design of DISTIQUE, including its strategies for selecting anchors, combining results from multiple anchors, and dealing with long branches.
Definition 2
Let p(a b.u v)denote the true probability of observing the quartet topology a b.u v in gene trees generated according to the MSC model. We define MSCbased double, single, and allpairs anchored distance matrices \(D^{*}_{u,v}, D^{*}_{v}\), and D ^{∗}, respectively on leafsets \(\mathcal {L}\{u,v\}, \mathcal {L}\{v\}\) and \(\mathcal {L}\)as:
Lemma 1
For species tree estimation under the MSC model, Eq. (1) simplifies to Eq. (5) for β= ln3,α=1, and f(x)= ln(3−2e ^{−x}). Thus \(D^{\prime }_{uv}[a,b] = D^{*}_{uv} [a,b] =\ln p(ab.uv).\)
Theorem 3
Given true quartet probabilities \(p(ab.uv), D^{*}_{uv}, D^{*}_{v}\), and D ^{∗} become additive distance matrices that correspond to the true species tree topology on leafsets \(\mathcal {L}\{u,v\}, \mathcal {L}\{v\}\), and \(\mathcal {L}\), respectively.
Lemma 1 is proved in the appendix. From Lemma 1, it follows that Eq. (5) is a special case of Eq. (1); Theorem 3 follows directly from Theorem 1.
It may be surprising that \(D^{*}_{uv}\), which is a special case of \(D^{\prime }_{uv}\), depends only on quartet topologies and not branch lengths. To see why, readers should recall that p is the quart frequency in gene trees, and relates to both the quartet topology and the quartet length in the species tree.
True quartet probabilities are not known. Instead, we empirically use \(\overline {p}(ab.uv)=\frac {1}{k}\{t:\mathcal {G}ab.uv\in \mathcal {Q}^{t}\}\). Empirical frequencies inferred from gene trees converge in probability to true values as the number of genes increases; thus, it is easy to show (proof omitted):
Corollary 1
\(D^{*}_{uv}, D^{*}_{v}\), and D ^{∗} computed using empirical frequencies in a random sample of errorfree gene trees converge in probability to an arbitrarily small radius of an additive matrix identical in topology to the true species tree; a consistent distance method with a safety radius [ 40 ] run on these matrices is a consistent estimator of the species tree topology.
Computing anchored matrices require Θ(n ^{2} k),Θ(n ^{3} k), and Θ(n ^{4} k) time, respectively for \(D^{*}_{uv}, D^{*}_{v}\), and D ^{∗}. Among these matrices, only D ^{∗} includes all species.
DISTIQUE (algorithmic design)
DISTIQUE uses double anchored matrices, which can be each computed in Θ(n ^{2} k). It uses multiple anchors and combines the trees or matrices produced by different anchors. A careful selection of anchors can ensure the final DISTIQUE tree includes all species, and can control its running time between Θ(n ^{2} k) and Θ(n ^{4} k). Before presenting our anchoring strategy, we first need to show how DISTIQUE deals with long branches.
Long branches: smoothing and consensus
Smoothing For species tree branches that are even moderately long, expected frequencies of alternative quartet topologies become exceedingly close to zero. For example, a species tree quartet length of 12 in coalescent units [41] results in a 99.6 % chance of observing no discordance among 1000 genes. Thus, our simple empirical frequency estimator \(\overline {p}\) can easily be equal to zero, resulting in distances of infinity (Eq. 5). To avoid this problem, we use KrichevskyTrofimov [42] (i.e., addhalf estimator), which adds a pseudocount of 0.5 for each of three possible quartet topologies. This estimator has been shown to reach the minmax cumulative loss for KL divergence asymptotically [42].
Consensus Smoothing does not fix the larger problem of distinguishing between long distances. For example, branches of length 12, 24, or 48 are all very likely to result in no gene tree discordance given 1000 genes; thus, even with smoothing, it remains impossible to distinguish between branches with these very different distances. This limitation makes it impossible to compute distances that reflect the true topology from limited data when the species tree includes adjacent long branches (resembling the saturation problem in phylogenetics [43]). We can construct examples when all gene trees are likely identical, yet our smoothed distances are misleading (Additional file 1: Section 2.2; Figure S7). However, long branches are easy to recover because they appear in most gene trees. A simple majority rule (50 %) consensus of gene trees would return all long branches. Thus, we simply compute the majority consensus and resolve its polytomies using DISTIQUE (Additional file 1: Algorithms S2 and S3). Because the majority consensus is proved not positively misleading under the MSC [44], our method remains statistically consistent.
To resolve a polytomy, Additional file 1: Algorithm S2 first assigns a cluster label to each branch pendant to it, and then builds a tree using DISTIQUE with the cluster labels as leaves; this tree defines a resolution of the polytomy. Given anchor species u,v from two distinct clusters, we compute distances between other pairs of clusters A and B using Eq. (5), defining the quartet frequencies as: \(\overline {p}(uv.AB) = \frac {1}{AB}\sum _{a\in A}\sum _{b\in B}{\overline {p}(uv.ab)}.\) When all clusters in the consensus tree are correct (expected asymptotically), p(u v.a b) values are identical; thus, all \(\overline {p}(uv.ab)\) values are empirical estimates of the same true value, and using their average is justified.
Choosing anchors
Additional file 1: Algorithm S4 shows DISTIQUE’s targeted sampling strategy for choosing a subset of all possible anchor pairs. Let d _{1}…d _{ r } denote the degree of polytomies in the consensus tree, indexed arbitrarily. For each polytomy i, we randomly partition its d _{ i } clusters into sets of size two; if d _{ i } is odd, we randomly choose a cluster and pair it with the remaining cluster. Then, we randomly choose one species from each cluster. This produces \(\lceil \frac {d_{i}}{2}\rceil \) pairs of anchors for each polytomy i. The total number of anchors is \(m={\sum _{1}^{r}} \lceil \frac {d_{i}}{2}\rceil =O(n)\) (Additional file 1: Lemma S2). Each anchor pair is used to resolve all polytomies on the path between them in the consensus tree. This processes may be repeated several rounds (a userspecified input parameter).
Polytomies of degree 4 or 5 cannot be handled using the double anchored approach because once two clusters are chosen as anchors, only two or three clusters remain which cannot be resolved as unrooted trees. For these small polytomies, we always use allpairs distance matrices; thus, we choose all \({4 \choose 2}\) or \({5 \choose 2}\) possible pairs of clusters around the polytomy. We need O(n) anchors in this scenario as well (Additional file 1: Lemma S2).
Combining anchors
Once m anchor pairs are selected, DISTIQUE computes m doubleanchored matrices and then combines them using one of two methods.
Treesum:
We first compute m trees, each on n−2 leaves using the double anchored method (Corollary 1) and then combine these m trees using a supertree method. Using a compatibility supertree (i.e., one that given a set of compatible input trees, outputs a tree that refines all input trees) would make the approach statistically consistent (Theorem S2, Additional file 1).
We also use the following approach to filter out outlier anchors. We compute an initial supertree from m anchored trees, then find the RF distance between m trees and the supertree, remove those with an RF distance at least two standard deviations larger than the mean, and recompute the supertree.
Distancesum:
The distancesum approach creates a summary distance matrix and runs neighbor joining on the summary matrix. The summary distance is simply the average distance of each pair in the set of m double anchored matrices. Note that some of the m double anchored matrices might not have a value for a given pair of leaves; we treat those as missing values and ignore them when averaging values. The presence of missing values jeopardizes our proofs of statistical consistency.
Let \(D^{*}_{uv}\) and \(D^{*}_{wz}\) be two double anchored matrices produced using two disjoint pairs of anchors. If the two matrices are reduced to the n−4 leaves common between them (i.e., \(\mathcal {L}^{\prime }=\mathcal {L}\{u,v, w,z\}\)), we get two matrices that asymptotically converge to an additive matrix for the same tree topology (Corollary 1). The sum of two additive distance matrices that correspond to the same tree topology is also additive for the same topology. Thus, \(D^{*}_{uv}\mathcal {L}^{\prime }+D^{*}_{wz}\mathcal {L}^{\prime }\) is asymptotically additive for the correct species tree. This provides a theoretical justification for our distancesum approach. However, distances between four anchors and other leaves are missing in one of the matrices, and thus, their correct placement cannot be guaranteed.
If all \({n \choose 2}\) anchors are used, the distancesum approach becomes equivalent to the allpairs approach and is provably statistically consistent (Theorem 3). On the other hand, using only two pairs of anchors makes the placement of anchors dependent on averages of two numbers, one of which is missing, a clearly problematic scenario. Choosing an intermediate number of anchors, while insufficient for giving proofs of consistency, clearly reduces the impact of missing values. For example, assume we have m anchors and each species is included in at most only one of those anchors. The summary distance between each pair of leaves becomes an average of m values, among which at most one may be missing.
For large enough m, we conjecture that the impact of that single missing value is negligible. In the results section, we provide empirical evidence for this conjecture, but future work should explore theoretical proofs. Due to its superior empirical performance, distancesum is used by default in the DISTIQUE (see Additional file 1: Algorithm S2 for all details).
Running time analysis:
Using allpairs or allpairsmax clearly require Θ(n ^{4} k) time to build the distance matrix and using the default O(n ^{3}) neighbor joining algorithm [45] would result in Θ(n ^{4} k) total running time. The running times of treesum and distancesum depend on the selection of anchors, and also the exact distance method and supertree method used. Building each double anchored distance matrix requires Θ(n ^{2} k); thus, building m matrices requires Θ(n ^{2} m k). Using a fast neighbor joining algorithm (e.g., FNJ [46], or NINJA [18]), the running time of distance method can be O(n ^{2}).
Clearly, any function between Θ(n ^{2} k) and Θ(n ^{4} k) can be obtained by adjusting m. DISTIQUE’s default strategy requires O(n) anchors and therefore results in O(n ^{3} k) total running time. For the treesum approach, the running time of the supertree method needs to be also added. MRL, which we use here, doesn’t have running time guarantees, but ML methods tend to have average running time close to O(n ^{2}) [47].
Experimental setup
We use simulated and real datasets to evaluate the accuracy and scalability of DISTIQUE. We measure species tree accuracy using False Negative (FN) rate, which is equivalent to normalized RF distance [48] here because all estimated species trees are fully resolved.
Datasets
For biological analyses, we reanalyzed a dataset of 2022 supergene trees from an avian dataset [7 , 11]. We also use three sets of simulated datasets we used before: a 37taxon mammalian dataset [12], a 45taxon avian dataset [11], and datasets used for evaluating ASTRALII [4]. The first two datasets are based on biological data and have a single species tree topology, whereas the last dataset is simulated using SimPhy [49] and has a different species tree per replicate and has heterogeneous parameters. Avian and mammalian datasets enable us to evaluate performance for relatively small numbers of species, varying ILS and the number of genes. The amount of ILS is changed by multiplying or dividing branch lengths by 2 or 5; shorter branches (0.2X and 0.5X) produce more ILS and longer branches reduce ILS (Additional file 1: Table S1). We create two collections for these datasets, one where we fix the number of genes (200 for mammalian and 1000 for avian) and vary the amount of ILS, and a second collection, where we fix the amount of ILS (to very high or 0.2X for mammalian and default 1X for avian) and vary the number of genes (200 to 3200 for mammalian and 200 to 2000 for avian). The simPhy dataset [4] has two collections, and is simulated to capture the range of reasonable biological datasets. In the simPhyILS collection, we fix the number of species to 201 and show three levels of ILS, ranging from moderate (10 million generations) to very high (500K generations), and for each case, we vary the number of genes (50, 200, 1000). For each case, we have 100 replicates, half with a speciation rate of 10^{−6} and the other half with 10^{−7}. In the simPhysize, we fix ILS to moderate and speciation rate to 10^{−6}, and change the number of species from 10 to 500, with 50 replicates per dataset.
Methods
We compare various versions of DISTIQUE, described below, against each other, and against ASTRALII [4], which is a quartetbased method, the ASTRID [22] (a new implementation of the NJst algorithm [21]), which is a distancebased method, and concatenation using RAxML [50] (CAML). ASTRAL and NJst are statistically consistent summary methods and, like DISTIQUE, work on unrooted gene trees and species trees (most other approaches such as MPEST and STAR need rooted input). Also, these two are among the most accurate summary methods [3 , 4 , 21 , 22 , 51].
DISTIQUE:
We explore variants of DISTIQUE, changing the distance matrix (comparing allpairs, allpairsmax, treesum, and distancesum; see Additional file 1: Algorithm S1), the number of anchoring rounds (2 to 8), and the use of consensus. To compare to other methods, we use the default distancesum DISTIQUE (Additional file 1: Algorithm S2), with 2 or 8 rounds of anchoring. DISTIQUE is implemented in python and uses the Dendropy library [52] and uses the FastME [53] as its distance method (but we also tested PhyD* [54]).
Results
Comparison between DISTIQUE variants
We start by comparing allpairs and allpairsmax variants, each applied to either the entire set of species or to polytomies of a 50 % majority rule consensus (default), limiting our study to the 37taxon and 45taxon avian and mammalian datasets where Θ(n ^{4} k) methods could run. On both datasets, a surprising pattern emerges. Without the use of consensus, the error unexpectedly goes up with decreased ILS, a pattern that is more pronounced for allpairsmax (Additional file 1: Figures S1 and S2). As discussed before, we attribute this pattern to difficulties of estimating long quartet lengths. When consensus is used within DISTIQUE, the accuracy improves with decreased ILS, as expected (Additional file 1: Figures S1 and S2). Depending on the level of ILS, the consensus tree is unresolved for 25 to 95 % of branches, leaving much to DISTIQUE to resolve. Overall, allpairs methods has better accuracy than allpairsmax, a result that we do not find surprising. Based on these results, hereafter, we only show results for DISTIQUE applied to a majority consensus, and we omit allpairsmax.
We compared the three algorithms, allpairs, treesum, and distancesum (the last two with eight rounds of anchor sampling), and observed that the distancesum is competitive with allpairs and outperforms treesum (Table 1). The difference between allpairs and distancesum was never more than 1 %. Distancesum consistently outperformed treesum, by as much as 5 % in some cases, despite the fact that treesum is provably consistent and distancesum has not been proved consistent. Thus, we chose to set the default DISTIQUE implementation to distancesum.
We next evaluated the impact of anchor sampling by changing the number of rounds of targeted sampling between 1 and 8 on the avian and mammalian datasets (Additional file 1: Figures S3 and S4). The distancesum method had substantial improvements when going from one to two rounds, and generally much smaller improvements after that. We show results for both 2 and 8 rounds when comparing DISTIQUE to other methods.
Finally, we checked the impact of the exact distance method used inside DISTIQUE (Additional file 1: Figure S5), using a variety of methods implemented inside FastME [53] and PhyD* [54] on both mammalian and avian datasets. There were substantial variations of accuracy among distance methods, especially on the avian dataset. PhyD* tended to have more error, and among methods implemented in FastME, balanced minimum evolution (BME) with SPR moves had the highest accuracy. We chose this option of FastME in the default DISTIQUE.
DISTIQUE versus other methods
simPhysize: On this simulated dataset, we compare running time and tree accuracy across methods. Generally, all the methods we studied had similar patterns of accuracy on the simPhysize dataset, and the mean errors of different methods tended to be within the standard error of each other (Fig. 1 a). According to a twoway ANOVA test with FDR correction [55] for multiple testing (n=24; see caption of Additional file 1: Table S3) with α=0.05, the error rate of DISTIQUE8 was statistically indistinguishable from both ASTRAL and ASTRID (Additional file 1: Table S3). In the few cases where the differences seemed substantial, for example on 500 species and 1000 genes, ASTRAL tended to be the best, followed by both versions of DISTIQUE (but there were exceptions; e.g., 50 species and 1000 genes). Unlike the accuracy, running times of summary methods were quite different (Fig. 2). ASTRID was by far the fastest, followed by DISTIQUE2 and DISTIQUE8, and ASTRAL was the slowest. For example, with 500 species and 1000 genes, DISTIQUE2 and DISTIQUE8 ran in about 1.1 and 2.2 hours, while ASTRAL took 5 hours, and ASTRID took only 7.5 minutes.
simPhyILS: On the simPhyILS dataset where the number of species is fixed to 201, differences between various summary methods were generally small (Fig. 1 b), but overall, ASTRAL was significantly better than DISTIQUE8 (p<0.001). However, DISTIQUE8 and ASTRID were indistinguishable (Additional file 1: Table S3). The magnitude of the difference between ASTRAL and DISTIQUE8 significantly depended on the level of ILS (p=0.001), where with low or medium ILS levels, the two methods had a similar error, but with increased ILS, ASTRAL outperformed DISTIQUE; the differences were more pronounced when we had fewer gene trees (significant: p=0.039; Additional file 1: Table S3).
Avian On the avian dataset (Fig. 3 a), ASTRID was generally the best method, followed by DISTIQUE8 (which was significantly worse; p=0.004) and then ASTRAL; CAML was the worst. Differences between ASTRAL and DISTIQUE8 were not statistically significant (Additional file 1: Table S3). The largest difference between DISTIQUE8 and the best method was for 0.5X ILS, where DISTIQUE8 had 2.9 % more error than ASTRID.
Mammalian On this dataset (Fig. 3 b), overall, ASTRAL was the best method, and was significantly better than DISTIQUE (p=0.025). DISTIQUE and ASTRID were overall statistically indistinguishable (Additional file 1: Table S3). The relative error of concatenation depended on the level of ILS, which was much worse than summary methods for high levels of ILS, but better for low levels of ILS.
Biological results
On the avian dataset, we ran ASTRAL, ASTRID, and DISTIQUE8 and used both bootstrapping [56] and local posterior probability (pp) [57] to quantify branch support (Additional file 1: Figures S8 and S9). Bootstrap support was generally high, but the local pp was low for many branches. DISTIQUE and ASTRID differed on three branches. Of these, one, related to the first neoavan split, had high local pp support in ASTRID (0.98) but very low local pp in DISTIQUE; the remaining conflicts had local pp below 0.58 in both trees. ASTRAL and DISTIQUE differed in six branches, and all of these had local pp below 0.58 in DISTIQUE, and all but one also had low local pp (≤ 0.9) in ASTRAL. None of these conflicting relationships have been well resolved in the literature. Interestingly, many of conflicting branches with low local pp had high bootstrap support. It can be argued that conflicts are due to uncertainties resulting from insufficient data, but bootstrapping misleadingly computes high support [57].
Discussion
We compared three statistically consistent summary methods, ASTRAL, ASTRID, and DISTIQUE; overall, ASTRAL was at least as good as other methods on most datasets, but ASTRID was occasionally the best. DISTIQUE was often as good as and never more than 3 % worse than the best method. The choice of the best method depended on the level of ILS and the number of genes, suggesting when the level of ILS is expected to be very high, ASTRAL might be the best choice. On the other hand, the running time of DISTIQUE grows more slowly with increased numbers of genes; for datasets with large number of species and tens of thousands of genes, DISTIQUE and ASTRID provide fast alternatives to ASTRAL.
Despite having strong competition in ASTRAL and ASTRID, we believe DISTIQUE is a promising approach, for several reasons. Because of its speed, DISTIQUE can be used for a very fast estimation of species trees, for example, as a starting point for an extensive hillclimbing search. DISTIQUE can also generate a set of trees instead of a single tree, and we plan to study whether these sets of trees can be utilized for defining the search space of ASTRAL.
DISTIQUE is essentially a method for 1) defining distances based on quartets, and 2) subsampling the space of all Θ(n ^{4}) quartets. The first aspect of DISTIQUE can be replaced by improved ways of defining distances, for example those that better handle gene tree estimation error. Coestimation of gene trees and the species tree [58] is a computationally challenging problem in general. However, it is reasonable to think that a similar problem defined on quartets, and addressed using distances becomes easier, as some recent theoretical results suggest [32 , 59]. DISTIQUE provides a general way for using anchoring introduced in this paper to implement novel distancebased gene tree species tree coestimation in a scalable fashion. Simpler approaches of taking into account gene tree uncertainty, for example weighting various quartets according to coalescent expectations, might also result in improvements. Finally, we note that DISTIQUE’s anchoring strategy can be paired with sitebased ILS methods such as SVDQuartets [35], and more broadly for other tree inference problems.
Conclusions
We introduced a general approach for computing tree leaf distances by inferring topologies and internal branch lengths for quartets of leaves. We used our novel anchoring to design DISTIQUE, a new statistically consistent summary method for species tree estimation. DISTIQUE has variants, with several strategies for choosing and combining anchors. The default version of DISTIQUE requires O(n ^{3} k) running time and is much faster than ASTRAL. In terms of accuracy, DISTIQUE was nearly as accurate as ASTRAL with differences that were rarely substantial.
Appendix
Proof of theorems
Proof of Theorem 1
Let \(\{a,b,c,d\}\subset \mathcal {L}\) be four arbitrary leaves and \(\mathcal {L}^{\prime }=\mathcal {L} \{a,b,c,d\}\). W.l.o.g assume \(ab.cd \in \mathcal {Q}^{T}\). We prove that the four point conditions hold for this arbitrarily chosen quartet in \(D^{\prime }_{uv},D^{\prime }_{v},\) and D ^{′}; we also prove that the four point conditions are true for a tree compatible with the tree T. Proving these conditions for arbitrary quartets completes the proof by results of Buneman [37].
We start with the doubleanchored matrix. The four point condition can be written in three ways, but only one of them is compatible with the tree T. Since we assumed w.l.o.g that \(ab.cd \in \mathcal {Q}^{T}\), the four point condition compatible with T is:
Figure 4 shows all ways of placing anchors {u,v} on the quartet tree a b.c d. Anchors can be sisters, placed on the internal branch (Case 1) or on a tip branch (Case 2; w.l.o.g, we pick the branch pending to d). When anchors are not sisters, they can be both placed on the internal branch (Case 3), or one on the internal branch and the other on a tip branch (Case 4), or they can be both on terminal branches, which can be done in three ways: u and v can be on the same terminal branch (Case 5), on different but adjacent branches (Case 6), or on nonadjacent branches (Case 7).
In Table 2, for each of the seven cases, we compute L,R1,R2. We use Eq. (1) to derive \(D^{\prime }_{uv}[x,y]\) values. Where x y.u v is induced by the tree shown in Fig. 4, we use [β−f(t)] and otherwise we use [β+α t], where t=τ(x,y,u,v) is the length of the internal branch for the quartet tree induced by {x,y,u,v}. For example, for Case 1, \(D^{\prime }_{uv}[a,b]=[\beta f(e_{1}+e_{3})]\) because a b.u v is induced by the tree, and the length of the edge on the a b.u v quartet tree is e _{1}+e _{3}; in Case 7, \(D^{\prime }_{uv}[a,b]=\beta +\alpha e_{1}\) because a b.u v is not induced by the tree and τ(a,b,u,v)=e _{1}.
We need to show that L<R1 and R1=R2. We remind the reader that all branches are assumed to be strictly positive and that f is a positive and monotonically increasing function bounded from above by β. In all cases, the equality of R1 and R2 is immediately clear from the Table 2. The inequality L<R1 follows directly from the fact that f(x) is monotonically increasing in Cases 1, 2, and 5. For Case 3, because of positivity of f(x) and α, we have L<2β<R. Similarly, for Case 4, L<2β+α e _{1}<2β+α e _{1}+2α e _{2}=R. Case 6 follows from the positivity of f, and Case 7 is trivially correct for positive branch lengths. Thus, we have shown in all possible relationships between {u,v} and the quartet tree, the four point condition holds for the topology consistent with tree T. Therefore, the proof is complete for the double anchored case.
Now consider the “single anchored” distance matrix \(D^{*}_{v}\) on the leafset \(\mathcal {L}\{v\}\) (for a single \(v\in \mathcal {L}\)). To prove additivity of the single anchored distance matrix, we need to prove the following four point condition:
We divide each sum to terms with \(u \in \mathcal {L}^{\prime }\) and \(u \notin \mathcal {L}^{\prime }\):
For \(u \in \mathcal {L}^{\prime }\) terms, the sums are exactly those we analyzed for double anchored distances; thus, the additivity is already proved. Since the sum of two additive distances is additive, it suffices to prove additivity for u∈{a,b,c,d} cases, marked as L,R1, and R2 above.
A single anchor v can be placed (Fig. 4) either on the internal branch (Case 8) or on a terminal branch (Case 9) of a quartet tree. We prove L<R1=R2 for these: In Case 8, we have:
and in case 9,
Note that the four point condition proved above is for the topology that corresponds to the tree T. The proof for singleanchored distances follows from additivity of sum of additive matrices.
We now prove the additivity for the allpairs matrix. Equation (3) has three types of terms: {u,v}∩{a,b,c,d} may have (I) both anchors, (II) one anchor, or (III) none. The four point condition can be written:
For terms of type (III) and (II), the additivity is already proved in double and single anchored cases, respectively. Thus, we need to prove additivity only for terms of type (I), which have no anchors. Let x=τ(a,b,c,d).
Thus, for all three types, the four point conditions hold for the topology found in T. Proof follows from the fact that the sum of additive terms is additive. □
Proof of Theorem 2
We prove that Eq. (4) returns the sum of internal branch lengths on the path from a to b on the tree T (we denote this by D T _{ ab }). The theorem immediately follows because a distance matrix compatible with the tree T has to be by definition additive and compatible with it (note that the theorem also claims that D ^{′′} gives internal branch lengths). For simplicity, we prove with α=1; extension to other values is simple. If a and b are not sisters in T, there exists an anchor pair (u,v) with quartet topology a u.b v and \(\tau (a,b,u,v)=D^{T}_{ab}\); to find such u and v, the following procedure can be followed. Pick u arbitrarily from the sister group of a after rooting T on b and pick v arbitrarily from the sister group of b after rooting T on a. With this choice, it’s easy to see that τ(a,b,u,v) becomes simply the sum of internal branches between a and b; thus, from the first case of Eq. (1), we have \(D^{\prime }_{uv}[a,b]\beta =\frac {\tau (a,b,u,v)}{\alpha }+\beta \beta =D^{T}_{ab}\). Moreover, \(D^{\prime }_{wz}[a,b]\beta \) for two other anchors w,z cannot be bigger than \(D^{T}_{ab}\). That is because if \(ab.wz\in \mathcal {Q}^{T}\), then \(D^{\prime }_{wz}[a,b]<\beta \); else, τ(a,b,w,z) will give the length for a subpath from a to b. Thus, the max function in Eq. (4) returns \(D^{T}_{ab}\), as desired. When (a,b) are sisters, \(D^{T}_{ab}=0\); also \(D^{\prime }_{uv}[a,b]<0\) for any (u,v), and thus, the max function returns D ^{′′}[a,b]=0; this is what we want, since for sisters, the length of the internal branch length is zero. Thus, as desired, Eq. (4) always returns the length of the internal branches in the T between a and b; this completes the proof. □
Proof of Lemma 1
For x>0, ln(3−2e ^{−x}) is clearly positive, monotonic, and bounded from above by ln3, as required by Definition 1. Let Q={a,b,u,v} and let T be the true species tree. To prove that Eq. (1) simplifies to (5), consider two cases. If anchors u,v are not sisters in the species tree quartet on Q (i.e., \(ab.uv\notin \mathcal {Q}^{T}\)), by the MSC model, \(p(ab.uv)=\frac {1}{3}e^{\tau (Q)}\) and thus, τ(Q)=− ln3p(a b.u v). In the first case in (1), \(D^{\prime }_{uv}=\beta + \alpha. \tau (Q) = \ln 3+ \tau (Q)= \ln 3  \ln 3p(ab.uv)= \ln p(ab.uv)\). In the second case, u,v are sisters (i.e., \(ab.uv\in \mathcal {Q}^{T}\)), and by the MSC model, \(p(au.bv)=1\frac {2}{3}e^{\tau (Q)}\); thus, \(\tau (Q)=\ln \frac {3}{2}(1p(au.bv))\). In the second case in (1), the distance is β−f(τ(Q))= ln3− ln(3−2e ^{−τ(Q)})=− lnp(a b.u v). Thus, in both cases, \(D^{\prime }_{uv} = D^{*}_{uv}\). □
Abbreviations
 ANOVA:

Analysis of variance
 ASTRAL:

Accurate species tree algorithm
 ASTRID:

Accurate species trees from Internode distances
 CAML:

Concatenated analysis using maximum likelihood
 DISTIQUE:

Distancebased inference of species trees from induced quartet elements
 FN:

False negative
 ILS:

Incomplete lineage sorting
 MSC:

Multi species coalescent
 RF distance:

Robinsonfoulds distance
 RAxML:

Randomized axelerated maximum likelihood
 SOM:

Supplementary online material
References
 1
Maddison WP, Url S. Gene Trees in Species Trees. Syst Biol. 1997; 46(3):523. doi:http://dx.doi.org/10.2307/2413694.
 2
Rannala B, Yang Z. Bayes estimation of species divergence times and ancestral population sizes using DNA sequences from multiple loci. Genetics. 2003; 164(4):1645–56.
 3
Mirarab S, Reaz R, Bayzid MS, Zimmermann T, Swenson MS, Warnow T. ASTRAL: GenomeScale CoalescentBased Species Tree. Bioinformatics. 2014; 30(17):541–8. doi:http://dx.doi.org/10.1093/bioinformatics/btu462.
 4
Mirarab S, Warnow T. ASTRALII: coalescentbased species tree estimation with many hundreds of taxa and thousands of genes. Bioinformatics. 2015; 31(12):44–52. doi:http://dx.doi.org/10.1093/bioinformatics/btv234.
 5
Larget BR, Kotha SK, Dewey CN, Ané C. BUCKy: Gene tree/species tree reconciliation with the Bayesian concordance analysis. Bioinformatics. 2010; 26(22):2910–11.
 6
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.
 7
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 MH, 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 MJ, 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 JE, Burt DW, 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. doi:http://dx.doi.org/10.1126/science.1253451.
 8
Song S, Liu L, Edwards SV, Wu S. Resolving conflict in eutherian mammal phylogeny using phylogenomics and the multispecies coalescent model,. Proc Natl Acad Sci USA. 2012; 109(37):14942–7. doi:http://dx.doi.org/10.1073/pnas.1211733109.
 9
Wickett NJ, Mirarab S, Nguyen N, Warnow T, Carpenter E, Matasci N, Ayyampalayam S, Barker MS, Burleigh JG, Gitzendanner MA, Ruhfel BR, Wafula E, Der JP, Graham SW, Mathews S, Melkonian M, Soltis DE, Soltis PS, Miles NW, Rothfels CJ, Pokorny L, Shaw AJ, DeGironimo L, Stevenson DW, Surek B, Villarreal JC, Roure B, Philippe H, dePamphilis CW, Chen T, Deyholos MK, Baucom RS, Kutchan TM, Augustin MM, Wang J, Zhang Y, Tian Z, Yan Z, Wu X, Sun X, Wong GKS, LeebensMack J. Phylotranscriptomic analysis of the origin and early diversification of land plants. Proc Natl Acad Sci. 2014; 111(45):4859–68. doi:http://dx.doi.org/10.1073/pnas.1323926111. http://www.pnas.org/content/111/45/E4859.full.pdf.
 10
Gatesy J, Springer MS. Phylogenetic Analysis at Deep Timescales: Unreliable Gene Trees, Bypassed Hidden Support, and the Coalescence/Concatalescence Conundrum. Mol Phylogenet Evol. 2014; 80:231–66. doi:http://dx.doi.org/10.1016/j.ympev.2014.08.013.
 11
Mirarab S, Bayzid MS, Boussau B, Warnow T. Statistical binning enables an accurate coalescentbased estimation of the avian tree. Science. 2014; 346(6215). doi:http://dx.doi.org/10.1126/science.1250463. http://science.sciencemag.org/content/346/6215/1250463.full.pdf.
 12
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. doi:http://dx.doi.org/10.1093/sysbio/syu063.
 13
Patel S, Kimball RT, Braun EL. Error in phylogenetic estimation for bushes in the tree of life. J Phylogenet Evol Biol. 2013; 1(2):110. doi:http://dx.doi.org/10.4172/23299002.1000110.
 14
Springer MS, Gatesy J. The gene tree delusion. Mol Phylogenet Evol. 2016; 94(Part A):1–33. doi:http://dx.doi.org/10.1016/j.ympev.2015.07.018.
 15
Bruno WJ, Socci ND, Halpern AL. Weighted neighbor joining: a likelihoodbased approach to distancebased phylogeny reconstruction. Mol Biol Evol. 2000; 17(1):189–97.
 16
Erdos P, Steel M, Szekely L, Warnow T. A few logs suffice to build (almost) all trees: Part II. Theor Comput Sci. 1999; 221(12):77–118. doi:http://dx.doi.org/10.1016/S03043975(99)000286.
 17
Saitou N, Nei M. The neighbourjoining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol. 1987; 4(4):406–25.
 18
Wheeler TJ. Largescale neighborjoining with ninja. In: International Workshop on Algorithms in Bioinformatics. Springer Berlin Heidelberg: Springer: 2009. p. 375–89.
 19
Liu L, Yu L, Pearl DK, Edwards SV. Estimating species phylogenies using coalescence times among sequences. Syst Biol. 2009; 58(5):468–77. doi:http://dx.doi.org/10.1093/sysbio/syp031.
 20
Mossel E, Roch S. Incomplete lineage sorting: consistent phylogeny estimation from multiple loci. IEEE/ACM Trans Comput Biol Bioinforma. 2010; 7(1):166–71. doi:http://dx.doi.org/10.1109/TCBB.2008.66.
 21
Liu L, Yu L. Estimating species trees from unrooted gene trees. Syst Biol. 2011; 60:661–7. doi:http://dx.doi.org/10.1093/sysbio/syr027.
 22
Vachaspati P, Warnow T. ASTRID: Accurate Species TRees from Internode Distances. BMC Genom. 2015; 16(Suppl 10):3.
 23
Strimmer K, von Haeseler a. Quartet puzzling  a quartet maximumlikelihood method for reconstructing tree topologies. Mol Biol Evol. 1996; 13:964–9. doi:http://dx.doi.org/10.1093/oxfordjournals.molbev.a025664.
 24
Snir S, Rao S. Quartets MaxCut: A divide and conquer quartets algorithm. IEEE/ACM Trans Comput Biol Bioinforma. 2010; 7(4):704–18. doi:http://dx.doi.org/10.1109/TCBB.2008.133.
 25
Avni E, Cohen R, Snir S. Weighted Quartets Phylogenetics. Syst Biol. 2015; 64(2):233–42.
 26
Bryant D, Steel M. Constructing Optimal Trees from Quartets. J Algorithm. 2001; 38:237–59. doi:http://dx.doi.org/10.1006/jagm.2000.1133.
 27
Jiang T, Kearney P, Li M. A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application. SIAM J Comput. 2001; 30(6):1942–61. doi:http://dx.doi.org/10.1137/S0097539799361683.
 28
Quartet Supertrees In: BinindaEmonds OP, editor. Phylogenetic Supertrees SE  9. Computational Biology, vol. 4. Springer Science & Business Media: Springer: 2004. p. 173–191. doi:http://dx.doi.org/10.1007/9781402023309_9.
 29
BinindaEmonds ORP, (ed).Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life vol. 4. The Netherlands: Kluwer Academic Publishers; 2004.
 30
Roch S, Snir S. Recovering the Treelike Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis. J Comput Biol. 2013; 20(2):93–112. doi:http://dx.doi.org/10.1089/cmb.2012.0234.
 31
Stenz NW, Larget B, Baum DA, Ané C. Exploring treelike and nontreelike patterns using genome sequences: An example using the inbreeding plant species arabidopsis thaliana (l.) heynh. Syst Biol. 2015; 64(5):809–23.
 32
Roch S, Warnow T. On the Robustness to Gene Tree Estimation Error (or lack thereof) of CoalescentBased Species Tree Methods. Syst Biol. 2015; 64(4):663–76. doi:http://dx.doi.org/10.1093/sysbio/syv016.
 33
Allman ES, Degnan J, Rhodes JA. Identifying the rooted species tree from the distribution of unrooted gene trees under the coalescent. J Math Biol. 2011; 62:833–62.
 34
Degnan J. Anomalous unrooted gene trees. Syst Biol. 2013; 62:574–90.
 35
Chifman J, Kubatko LS. Quartet Inference from SNP Data Under the Coalescent Model. Bioinformatics. 2014; 30(23):3317–24. doi:http://dx.doi.org/10.1093/bioinformatics/btu530.
 36
Rosenberg NA. Discordance of species trees with their most likely gene trees: a unifying principle. Mol Biol Evol. 2013; 30(12):2709–13.
 37
Buneman P. A note on the metric properties of trees. J Comb Theory Ser B. 1974; 17(1):48–50. doi:http://dx.doi.org/10.1016/00958956(74)900471.
 38
Brodal GS, Fagerberg R, Östlin A, Pedersen CNS, Rao SS. Computing Refined Buneman Trees in Cubic Time. Lect Notes Comput Sci. 2003; 2812:259–70.
 39
Steel M. Recovering a tree from the leaf colourations it generates under a Markov model. Appl Math Lett. 1994; 7(2):19–23. doi:http://dx.doi.org/10.1016/08939659(94)900248.
 40
Atteson K. The Performance of NeighborJoining Methods of Phylogenetic Reconstruction. Algorithmica. 1999; 25(23):251–78. doi:http://dx.doi.org/10.1007/PL00008277.
 41
Degnan J, Rosenberg NA. Gene tree discordance, phylogenetic inference and the multispecies coalescent. Trends Ecol Evol. 2009; 24(6):332–40. doi:http://dx.doi.org/10.1016/j.tree.2009.01.009.
 42
Krichevsky RE, Trofimov VK. The performance of universal encoding. Inf Theory, IEEE Trans. 1981; 27(2):199–207.
 43
Jeffroy O, Brinkmann H, Delsuc F, Philippe H. Phylogenomics: the beginning of incongruence?Trends Genet. 2006; 22(4):225–31. doi:http://dx.doi.org/10.1016/j.tig.2006.02.003.
 44
Degnan JH, DeGiorgio M, Bryant D, Rosenberg NA. Properties of Consensus Methods for Inferring Species Trees from Gene Trees. Syst Biol. 2009; 58(1):35–54. doi:http://dx.doi.org/10.1093/sysbio/syp008.
 45
Studier JA, Keppler KJ. A note on the neighborjoining algorithm of Saitou and Nei. Mol Biol Evol. 1988; 5(6):729–31. doi:http://dx.doi.org/10.1161/HYPERTENSIONAHA.111.186106.
 46
Elias I, Lagergren J. Fast neighbor joining. Theor Comput Sci. 2009; 410:1993–2000. doi:http://dx.doi.org/10.1016/j.tcs.2008.12.040.
 47
Price MN, Dehal PS, Arkin AP. Fasttree 2 – approximately maximumlikelihood trees for large alignments. PLoS ONE. 2010; 5(3):1–10. doi:http://dx.doi.org/10.1371/journal.pone.0009490.
 48
Robinson D, Foulds L. Comparison of phylogenetic trees. Math Biosci. 1981; 53(12):131–47.
 49
Mallo D, Martins dOL, Posada D. SimPhy: Phylogenomic Simulation of Gene, Locus and Species Trees. Syst Biol. 2016; 65(2):334–44. doi:http://dx.doi.org/10.1093/sysbio/syv082.
 50
Stamatakis A. RAxML version 8: A tool for phylogenetic analysis and postanalysis of large phylogenies. Bioinformatics. 2014; 30(9):1312–3. doi:http://dx.doi.org/10.1093/bioinformatics/btu033. http://arxiv.org/abs/bioinformatics/btu033.
 51
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:http://dx.doi.org/10.1016/j.ympev.2015.05.011.
 52
Sukumaran J, Holder M. Dendropy: a Python library for phylogenetic computing. Bioinformatics. 2010; 26(12):1569–71.
 53
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. doi:http://dx.doi.org/10.1093/molbev/msv150.
 54
Criscuolo A, Gascuel O. Fast njlike algorithms to deal with incomplete distance matrices. BMC Bioinforma. 2008; 9(1):166.
 55
Benjamini Y, Hochberg Y. Controlling the false discovery rate: a practical and powerful approach to multiple testing. J R Stat Soc. 1995; 57:289–300.
 56
Seo TK. Calculating bootstrap probabilities of phylogeny using multilocus sequence data. Mol Biol Evol. 2008; 25(5):960–71. doi:http://dx.doi.org/10.1093/molbev/msn043.
 57
Sayyari E, Mirarab S. Fast CoalescentBased Computation of Local Branch Support from Quartet Frequencies. Mol Biol Evol. 2016; 33(7):1654–68. doi:http://dx.doi.org/10.1093/molbev/msw079.
 58
Szöllõsi GJ, Tannier E, Daubin V, Boussau B. The inference of gene trees with species trees. Syst Biol. 2015; 64(1):42–62. doi:http://dx.doi.org/10.1093/sysbio/syu048. http://sysbio.oxfordjournals.org/content/64/1/e42.full.pdf+html.
 59
Dasarathy G, Nowak R, Roch S. Data requirement for phylogenetic inference from multiple loci: a new distance method. IEEE/ACM Trans Comput Biol Bioinforma (TCBB). 2015; 12(2):422–32.
Acknowledgements
This work was supported by the NSF grant IIS1565862 to SM. Computations were performed on the San Diego Supercomputer Center (SDSC) through XSEDE allocations, which is supported by the NSF grant ACI1053575.
Declarations
Publication charges for this work were funded by National Science Foundation (NSF) grant IIS1565862 to SM. This article has been published as part of BMC Genomics Vol 17 Suppl 10, 2016: Proceedings of the 14th Annual Research in Computational Molecular Biology (RECOMB) Comparative Genomics Satellite Workshop: genomics. The full contents of the supplement are available online at https://bmcgenomics.biomedcentral.com/articles/supplements/volume17supplement10.
Availability of data and materials
The code, and data sets analyzed during the current study are available in the GitHub repository, http://esayyari.github.io/DISTIQUE.
Authors’ contributions
SM and ES both designed the algorithm, proved theoretical results, analyzed the data, and wrote the manuscript. ES implemented the code and performed simulation studies. Both authors read and approved the final manuscript.
Competing interests
The authors declare that they have no competing interests.
Consent for publication
Not applicable.
Ethics approval and consent to participate
Not applicable.
Author information
Additional file
Additional file 1
Supplementary.pdf. The Supplementary Material for the paper. (PDF 426 KB)
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. 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.
About this article
Published
DOI
Keywords
 Incomplete lineage sorting
 Quartet methods
 Multispecies coalescent
 Species tree