• We are sorry, but NCBI web applications do not support your browser and may not function properly. More information
Logo of pnasPNASInfo for AuthorsSubscriptionsAboutThis Article
Proc Natl Acad Sci U S A. Nov 12, 1996; 93(23): 13429.
PMCID: PMC24110
Evolution

Bootstrap confidence levels for phylogenetic trees

Abstract

Evolutionary trees are often estimated from DNA or RNA sequence data. How much confidence should we have in the estimated trees? In 1985, Felsenstein [Felsenstein, J. (1985) Evolution 39, 783–791] suggested the use of the bootstrap to answer this question. Felsenstein’s method, which in concept is a straightforward application of the bootstrap, is widely used, but has been criticized as biased in the genetics literature. This paper concerns the use of the bootstrap in the tree problem. We show that Felsenstein’s method is not biased, but that it can be corrected to better agree with standard ideas of confidence levels and hypothesis testing. These corrections can be made by using the more elaborate bootstrap method presented here, at the expense of considerably more computation.

The bootstrap, as described in ref. 1, is a computer-based technique for assessing the accuracy of almost any statistical estimate. It is particularly useful in complicated nonparametric estimation problems, where analytic methods are impractical. Felsenstein (2) introduced the use of the bootstrap in the estimation of phylogenetic trees. His technique, which has been widely used, provides assessments of “confidence” for each clade of an observed tree, based on the proportion of bootstrap trees showing that same clade. However Felsenstein’s method has been criticized as biased. Hillis and Bull’s paper (3), for example, says that the bootstrap confidence values are consistently too conservative (i.e., biased downward) as an assessment of the tree’s accuracy.

Is the bootstrap biased for the assessment of phylogenetic trees? We will show that the answer is no, at least to a first order of statistical accuracy. Felsenstein’s method provides a reasonable first approximation to the actual confidence levels of the observed clades. More ambitious bootstrap methods can be fashioned to give still better assessments of confidence. We will describe one such method and apply it to the estimation of a phylogenetic tree for the malaria parasite Plasmodium.

Bootstrapping Trees

Fig. Fig.11 shows part of a data set used to construct phylogenetic trees for malaria. The data are the aligned sequences of small subunit RNA genes from 11 malaria species of the genus Plasmodium. The 11 × 221 data matrix we will first consider is composed of the 221 polytypic sites. Fig. Fig.11 shows the first 20 columns of x. There are another 1399 monotypic sites, where the 11 species are identical.

Figure 1
Part of the data matrix of aligned nucleotide sequences for the malaria parasite Plasmodium. Shown are the first 20 columns of the 11 × 221 matrix x of polytypic sites used in most of the analyses below. The final analysis of the last section ...

Fig. Fig.22 shows a phylogenetic tree constructed from x. The tree-building algorithm proceeds in two main steps: (i) an 11 × 11 distance matrix D is constructed for the 11 species, measuring differences between the row vectors of x; and (ii) D is converted into a tree by a connection algorithm that connects the closest two entries (species 9 and 10 here), reduces D to a 10 × 10 matrix according to some merging rule, connects the two closest entries of the new D matrix, etc.

Figure 2
Phylogenetic tree based on the malaria data matrix; species are numbered as in Fig. Fig.1.1. The numbers at the branches are confidence values based on Felsenstein’s bootstrap method. B = 200 bootstrap replications.

We can indicate the tree-building process schematically as

equation M1

the hats indicating that we are dealing with estimated quantities. A deliberately simple choice of algorithms was made in constructing Fig. Fig.2:2: D was the matrix of the Euclidean distances between the rows of x, with (A, G, C, T) interpreted numerically as (1, 2, 5, 6), while the connection algorithm merged nodes by maximization. Other, better, tree-building algorithms are available, as mentioned later in the paper. Some of these, such as the maximum parsimony method, do not involve a distance matrix, and some use all of the sites, including the monotypical ones. The discussion here applies just as well to all such tree-building algorithms.

Felsenstein’s method proceeds as follows. A bootstrap data matrix x* is formed by randomly selecting 221 columns from the original matrix x with replacement. For example the first column of x* might be the 17th column of x, the second might be the 209th column of x, the third the 17th column of x, etc. Then the original tree-building algorithm is applied to x*, giving a bootstrap tree equation M2*,

equation M3

This whole process is independently repeated some large number B times, B = 200 in Fig. Fig.2,2, and the proportions of bootstrap trees agreeing with the original tree are calculated. “Agreeing” here refers to the topology of the tree and not to the length of its arms.

These proportions are the bootstrap confidence values. For example the 9-10 clade seen in Fig. Fig.22 appeared in 193 of the 200 bootstrap trees, for an estimated confidence value of 0.965. Species 7-8-9-10 occurred as a clade in 199 of the 200 bootstrap trees, giving 0.995 confidence. (Not all of these 199 trees had the configuration shown in Fig. Fig.2;2; some instead first having 8 joined to 9-10 and then 7 joined to 8-9-10, as well as other variations.)

Felsenstein’s method is, nearly, a standard application of the nonparametric bootstrap. The basic assumption, further discussed in the next section, is that the columns of the data matrix x are independent of each other and drawn from the same probability distribution. Of course, if this assumption is a bad one, then Felsenstein’s method goes wrong, but that is not the point of concern here nor in the references, and we will take the independence assumption as a given truth.

The bootstrap is more typically applied to statistics ^θ that estimate a parameter of interest θ, both ^θ and θ being single numbers. For example, ^θ could be the sample correlation coefficient between the first two malaria species, Pre and Pme, at the 221 sites, with (A, G, C, T) interpreted as (1, 2, 5, 6): ^θ = 0.616. How accurate is ^θ as an estimate of the true correlation θ? The nonparametric bootstrap answers such questions without making distributional assumptions.

Each bootstrap data set x* gives a bootstrap estimate ^θ*, in this case the sample correlation between the first two rows of x*. The central idea of the bootstrap is to use the observed distribution of the differences ^θ* − ^θ  to infer the unobservable distribution of ^θ − θ; in other words to learn about the accuracy of ^θ. In our example, the 200 bootstrap replications of ^θ* − ^θ were observed to have expectation 0.622 and standard deviation 0.052. The inference is that ^θ is nearly unbiased for estimating θ, with a standard error of about 0.052. We can also calculate bootstrap confidence intervals for θ. A well-developed theory supports the validity of these inferences [see Efron and Tibshirani (1)].

Felsenstein’s application of the bootstrap is nonstandard in one important way: the statistic equation M4, unlike the correlation coefficient, does not change smoothly as a function of the data set x. Rather, equation M5 is constant within large regions of the x-space, and then changes discontinuously as certain boundaries are crossed. This behavior raises questions about the bootstrap inferences, questions that are investigated in the sections that follow.

A Model For The Bootstrap

The rationale underlying the bootstrap confidence values depends on a simple multinomial probability model. There are K = 411 − 4 possible column vectors for x, the number of vectors of length 11 based on a 4-letter alphabet, not counting the 4 monotypic ones. Call these vectors X1, X2, . . ., XK, and suppose that each observed column of x is an independent selection from X1, X2, . . ., XK, equaling Xk with probability πk. This is the multinomial model for the generation of x.

Denote ˜π = (π1, π2,. . ., πK), so the sum of ˜π’s coordinates is 1. The data matrix x can be characterized by the proportion of its n = 221 columns equalling each possible Xk, say

equation M6

with ˜[pi] = ([pi]1, [pi]2, . . ., [pi]K). This is a very inefficient way to represent the data, since 411 − 4 is so much bigger than 221, but it is useful for understanding the bootstrap. Later we will see that only the vectors Xk that actually occur in x need be considered, at most n of them.

Almost always the distance matrix D is a function of the observed proportions ˜[pi], so we can write the tree-building algorithm as

equation M7

In a similar way the vector of true probabilities ˜π gives a true distance matrix and a true tree,

equation M8

D would be the matrix with ijth element {∑kπk(Xki Xkj)2}½ in our example, and TREE the tree obtained by applying the maximizing connection algorithm to D.

Fig. Fig.33 is a schematic picture of the space of possible ˜π vectors, divided into regions R1, R2, . . .. The regions correspond to different possible trees, so if equation M9 [set membership] Rj the jth possible tree results. We hope that equation M10 = TREE, which is to say that ˜π and ˜[pi] lie in the same region, or at least that equation M11 and TREE agree in their most important aspects.

Figure 3
Schematic diagram of tree estimation; triangle represents the space of all possible ˜π vectors in the multinomial probability model; regions R1, R2. . . correspond to the different possible trees. In the case shown ...

The bootstrap data matrix x* has proportions of columns say

equation M12

equation M13* = ([pi]1*, [pi]2*,  . , [pi]K*). We can indicate the bootstrap tree-building

equation M14

The hypothetical example of Fig. Fig.33 puts ˜π and ˜[pi] in the same region, so that the estimate equation M15 exactly equals the true TREE. However ˜[pi]* lies in a different region, with equation M16* not having the 9-10 clade. This actually happened in 7 out of the 200 bootstrap replications for Fig. Fig.22.

What the critics of Felsenstein’s method call its bias is the fact that the probability equation M17* = TREE is usually less than the probability equation M18 = TREE. In terms of Fig. Fig.3,3, this means that ˜[pi]* has less probability than ˜[pi] of lying in the same region as ˜π. Hillis and Bull (3) give specific simulation examples. The discussion below is intended to show that this property is not a bias, and that to a first order of approximation the bootstrap confidence values provide a correct assessment of equation M19’s accuracy. A more valid criticism of Felsenstein’s method, discussed later, involves its relationship with the standard theory of statistical confidence levels based on hypothesis tests.

Returning to the correlation example of the previous section, it is not true that ^θ* − θ (as opposed to ^θ* − ^θ) has the same distribution as ^θ − θ, even approximately. In fact ^θ* − θ will have nearly twice the variance of ^θ − θ, the sum of the variances of ^θ around θ and of ^θ* around ^θ. Similarly in Fig. Fig.33 the average distance from ˜[pi]* to ˜π will be greater than the average distance from ˜[pi] to ˜π. This is the underlying reason for results like those of Hillis and Bull, that ˜[pi]* has less probability than ˜[pi] of lying in the same region as ˜π. However, to make valid bootstrap inferences we need to use the observed differences between equation M20* and equation M21 (not between equation M22* and TREE) to infer the differences between equation M23 and TREE. Just how this can be done is discussed using a simplified model in the next two sections.

A Simpler Model

The meaning of the bootstrap confidence values can be more easily explained using a simple normal model rather than the multinomial model. This same tactic is used in Felsenstein and Kishino (4). Now we assume that the data x = (x1, x2) is a two dimensional normal vector with expectation vector μ = (μ1, μ2) and identity covariance matrix, written

equation M24

In other words x1 and x2 are independent normal variates with expectations μ1 and μ2, and variances 1. The obvious estimate of μ is [mu] = x, and we will use this notation in what follows. The μ-plane is partitioned into regions R1, R2, R3, . . . similarly to Fig. Fig.3.3. We observe that [mu] lies in one of these regions, say R1, and we wish to assign a confidence value to the event that μ itself lies in R1.

Two examples are illustrated in Fig. Fig.4.4. In both of them x = [mu] = (4.5,0) lies in R1, one of two possible regions. Case I has R2 = {μ : μ1 ≤ 3}, a half-plane, while case II has R2 = {μ : ||μ|| ≤3}, a disk of radius 3.

Figure 4
Two cases of the simple normal model; in both we observe [mu] = (4.5, 0) [set membership] R1, and wish to assign a confidence value to μ [set membership] R1. Case I, R2 is the region {μ1 ≤ 3}. ...

Bootstrap sampling in our simplified problem can be taken to be

equation M25

This is a parametric version of the bootstrap, as in section 6.5 of Efron and Tibshirani (1), rather than the more familiar nonparametric bootstrap considered previously, but it provides the proper analogy with the multinomial model. The dashed circles in Fig. Fig.4 4 indicate the bootstrap density of [mu]* = x*, centered at [mu]. Felsenstein’s confidence value is the bootstrap probability that [mu]* lies in R1, say

equation M26

The notation Prob[mu] emphasizes that the bootstrap probability is computed with [mu] fixed and only [mu]* random. The bivariate normal model of this section is simple enough to allow the [alpha] values to be calculated theoretically, without doing simulations,

equation M27

Notice that [alpha]II is bigger than [alpha]I because R1 is bigger in case II.

In our normal model, [mu]* − [mu] has the same distribution as [mu]μ, both distributions being the standard bivariate normal N2(0, I). The general idea of the bootstrap is to use the observable bootstrap distribution of [mu]* − [mu] to say something about the unobservable distribution of the error [mu]μ. Notice, however, that the marginal distribution of [mu]* − μ has twice as much variance,

equation M28

This generates the “bias” discussed previously, that [mu]* has less probability than [mu] of being in the same region as μ. But this kind of interpretation of bootstrap results cannot give correct inferences. Newton (5) makes a similar point, as do Zharkikh and Li (6) and Felsenstein and Kishino (4).

We can use a Bayesian model to show that [alpha] is a reasonable assessment of the probability that R1 contains μ. Suppose we believe apriori that μ could lie anywhere in the plane with equal probability. Then having observed [mu], the aposteriori distribution of μ given [mu] is N2([mu], I), exactly the same as the bootstrap distribution of [mu]*. In other words, [alpha] is the aposteriori probability of the event μ [set membership] R1, if we begin with an “uninformative” prior density for μ.

Almost the same thing happens in the multinomial model. The bootstrap probability that equation M29* = equation M30 is almost the same as the aposteriori probability that TREE = equation M31 starting from an uninformative prior density on ˜π [see section 10.6 of Efron (7)]. The same statement holds for any part of the tree, for example the existence of the 9-10 clade in Fig. Fig.2.2. There are reasons for being skeptical about the Bayesian argument, as discussed in the next section. However, the argument shows that Felsenstein’s bootstrap confidence values are at least reasonable and certainly cannot be universally biased downward.

Hypothesis-Testing Confidence Levels

Fig. Fig.55 illustrates another more customary way of assigning a confidence level to the event μ [set membership] R1. In both case I and case II, [mu]0 = (3, 0) is the closest point to [mu] on the boundary separating R1 from R2. We now bootstrap from [mu]0 rather than from [mu], obtaining bootstrap data vectors

equation M32

[The double star notation is intended to avoid confusion with the previous bootstrap vectors x* ~ N2([mu], I).] The confidence level [alpha] for the event μ [set membership] R1 is the probability that the bootstrap vector [mu]** = x** lies closer than [mu] to the boundary. This has a familiar interpretation: 1 − [alpha] is the rejection level, one-sided, of the usual likelihood ratio test of the null hypothesis that μ does not lie in R1. Here we are computing [alpha] numerically, rather than relying on an asymptotic χ2 approximation. In a one-dimensional testing problem, 1 − [alpha] would exactly equal the usual p value obtained from the test of the null hypothesis that the true parameter value lies in R2.

Figure 5
Confidence levels of the two cases in Fig. Fig.4; 4; [mu]0 = (3, 0) is the closest point to [mu] = (4.5, 0) on the boundary separating R1 from R2; bootstrap vector [mu]** ~ ...

Once again it is simple to compute the confidence level for our two cases, at least numerically,

equation M33

In the first case [alpha]I equals [alpha]I, the Felsenstein bootstrap confidence value. However [alpha]II = 0.914 is less than [alpha]II = 0.949.

Why do the answers differ? Comparing Figs. Figs.44 and and5,5, we see that, roughly speaking, the confidence value [alpha] is a probabilistic measure of the distance from [mu] to the boundary, while the confidence level [alpha] measures distance from the boundary to [mu]. The two ways of measuring distance agree for the straight boundary, but not for the curved boundary of case II. Because the boundary curves away from [mu], the confidence value [alpha] is increased from the straight-line case. However the set of vectors further than [mu] from the boundary curves toward [mu]0, which decreases [alpha]. We would get the opposite results if the boundary between R1 and R2 curved in the other direction.

The confidence level [alpha], rather than [alpha], provides the more usual assessment of statistical belief. For example in case II let θ = ||μ|| be the length of the expectation vector μ. Then [alpha] = 0.914 is the usual confidence level attained for the event {θ ≥ 3}, based on observing [theta w/ hat] = ||[mu]|| = 4.5. And {θ ≥ 3} is the same as the event {μ [set membership] R1}.

Using the confidence value [alpha] is equivalent to assuming a flat Bayesian prior for μ. It can be shown that using [alpha] amounts, approximately, to assuming a different prior density for μ, one that depends on the shape of the boundary. In case II this prior is uniform on polar coordinates for μ, rather than uniform on the original rectangular coordinates [see Tibshirani (8)].

The Relationship Between the Two Measures of Confidence

There is a simple approximation formula for converting a Felsenstein confidence value [alpha] to a hypothesis-testing confidence level [alpha]. This formula is conveniently expressed in terms of the cumulative distribution function Φ(z) of a standard one-dimensional normal variate, and its inverse function Φ−1: Φ(1.645) = 0.95, Φ−1(0.95) = 1.645, etc. We define the “z values” corresponding to [alpha] and [alpha],

equation M34

In case II, z = Φ−1(0.949) = 1.64 and z = Φ−1(0.914) = 1.37.

Now let [mu]** ~ N2([mu]0,I) as in Fig. Fig.5,5, and define

equation M35

For case I it is easy to see that z0 = Φ−1(0.50) = 0. For case II, standard calculations show that z0 = Φ−1(0.567) = 0.17.

In normal problems of the sort shown in Figs. Figs.44 and and55 we can approximate z in terms of z and z0:

equation M36
1

Formula 1 is developed in Efron (9), where it is shown to have “second order accuracy.” This means that in repeated sampling situations [where we observe independent data vectors x1, x2, . . . , xn ~ N2(μ, I) and estimate μ by [mu] = ∑in= xi/n] z0 is of order 1/equation M37, and formula 1 estimates z with an error of order only 1/n.

Second-order accuracy is a large sample property, but it usually indicates good performance in actual problems. For case I, Eq. 1 correctly predicts z = z, both equalling Φ−1(0.933) = 1.50. For case II the prediction is z = 1.64 − 0.34 = 1.30, compared with the actual value z = 1.37.

Formula 1 allows us to compute the confidence level [alpha] for the event {μ [set membership] R1} solely in terms of bootstrap calculations, no matter how complicated the boundary may be. A first level of bootstrap replications with [mu]* ~ N2([mu], I) gives bootstrap data vectors [mu]*(1), [mu]*(2), . . ., [mu]*(B), from which we calculate

equation M38

A second level of bootstrap replications with [mu]** ~ N2([mu]0,I), giving say [mu]**(1), [mu]**(2), . . ., [mu]**(B2), allows us to calculate

equation M39

Then formula 1 gives z = z − 2z0.

As few as B = 100, or even 50, replications [mu]* are enough to provide a rough but useful estimate of the confidence value [alpha]. However, because the difference between z = Φ−1([alpha]) and z = Φ−1([alpha]) is relatively small, considerably larger bootstrap samples are necessary to make formula 1 worthwhile. The calculations in section 9 of Efron (9) suggest both B and B2 must be on the order of at least 1000. This point did not arise in cases I and II where we were able to do the calculations by direct numerical integration, but it is important in the kind of complicated tree-construction problems we are actually considering.

We now return to the problem of trees, as seen in Fig. Fig.2.2. The version of formula 1 that applies to the multinomial model of Fig. Fig.3 3 is

equation M40
2

Here “a” is the acceleration constant introduced in ref. 9. It is quite a bit easier to calculate than z0, as shown in the next section. Formula 2 is based on the bootstrap confidence intervals called “BCa” in ref. 9.

If we tried to draw Fig. Fig.33 accurately we would find that the multi-dimensional boundaries were hopelessly complicated. Nevertheless, formula 2 allows us to obtain a good approximation to the hypothesis-testing confidence level [alpha] = Φ(z) solely in terms of bootstrap computations. How to do so is illustrated in the next section.

An Example Concerning the Malaria Data

Fig. Fig.22 shows an estimated confidence value of

equation M41

for the existence of the 9-10 clade on the malaria evolutionary tree. This value was based on B = 200 bootstrap replications, but (with some luck) it agrees very closely with the value [alpha] = 0.962 obtained from B = 2000 replications. How does [alpha] compare with [alpha], the hypothesis-testing confidence level for the 9-10 clade? We will show that

equation M42

(or [alpha] = 0.938 if we begin with [alpha] = 0.962 instead of 0.965). To put it another way, our nonconfidence in the 9-10 clade goes from 1 − [alpha] = 0.035 to 1 − [alpha] = 0.058, a substantial change.

We will describe, briefly, the computational steps necessary to compute [alpha]. To do so we need notation for multinomial sampling. Let P = (P1, P2, . . ., Pn) indicate a probability vector on n = 221 components, so the entries of the vector P are nonnegative numbers summing to 1. The notation

equation M43

will indicate that P* = (P1*, P2*,  , Pn*) is the vector of proportions obtained in a multinomial sample of size n from P. In other words we independently draw integers I1*, I2*, . . , In* from {1, 2, . . , n} with probability Pk on k, and record the proportions Pk* = #{Ii* = k}/n. This is the kind of multinomial sampling pictured in Fig. Fig.3,3, expressed more efficiently in terms of n = 221 coordinates instead of K = 411 − 4.

Each vector P* is associated with a data matrix x* that has proportion Pk* of its columns equal to the kth column of the original data matrix x. Then P* determines a distance matrix and a tree according to the original tree-building algorithm,

equation M44

The “central” vector

equation M45

corresponds to the original data matrix x and the original tree equation M46. Notice that taking P* ~Mult(P(cent)) amounts to doing ordinary bootstrap sampling, since then x* has its columns chosen independently and with equal probability from the columns of x.

Resampling from P(cent) means that each of the 221 columns is equally likely, but this is not the same as all possible 11 vectors being equally likely. There were only 149 distinct 11 vectors among the columns of x, and these are the only ones that can appear in x*. The vector TTTTCTTTTTT appeared seven times among the columns of x, so it shows up seven times as frequently in the columns of x*, compared with ATAAAAAAAAA which appeared only once in x.

Here are the steps in the computation of [alpha].

Step 1. B = 2000 first-level bootstrap vectors P*(1), P*(2), . . ., P*(B) were obtained as independent multinomials P* ~ Mult(P(cent)). Some 1923 of the corresponding bootstrap trees had the 9-10 clade, giving the estimate [alpha] = 0.962 = 1923/2000.

Step 2. The first 200 of these included seven cases without the 9-10 clade. Call the seven P* vectors P(1), P(2), . . ., P(7). For each of them, a value of w between 0 and 1 was found such that the vector

equation M47

was right on the 9-10 boundary. The vectors p(j) play the role of [mu]0 in Fig. Fig.55.

Finding w is easy using a one-dimensional binary search program, as on page 90 of ref. 10. At each step of the search it is only necessary to check whether or not the current value of wP(j) + (1 − w)P(cent) gives a tree having the 9-10 clade. Twelve steps of the binary search, the number used here, locates the boundary value of w within 1/212. The vectors p(j) play the role of [mu]0 in Fig. Fig.55.

Step 3. For each of the boundary vectors p(j) we generated B2 = 400 second-level bootstrap vectors

equation M48

computed the corresponding tree, and counted the number of trees having the 9-10 clade. The numbers were as follows for the seven cases:

equation M49

From the total we calculated an estimate of the correction term z0 in formula 2,

equation M50

Binomial calculations indicate that z0 = 0.0995 has a standard error of about 0.02 due to the bootstrap sampling (that is, due to taking 2800 instead of all possible bootstrap replications), so 2800 is not lavishly excessive. Notice that we could have started with the 77 out of the 2000 P* vectors not having the 9-10 clade, rather than the 7 out of the first 200, and taken B2 = 40 for each p(j), giving about the same total second-level sample.

Step 4. The acceleration constant “a” appearing in formula 2 depends on the direction from P(cent) to the boundary, as explained in section 8 of ref. 9. For a given direction vector U,

equation M51

Taking U = p(j) P(cent) for each of the seven cases gave

equation M52

Step 5. Finally we applied formula 2 with z = Φ−1(0.962) = 1.77, z0 = 0.0995, and a = 0.0129, to get z = 1.54, or [alpha] = Φ(z) = 0.938. If we begin with z = Φ−1(0.965) then [alpha] = 0.942.

Notice that in this example we could say that Felsenstein’s bootstrap confidence value [alpha] was biased upward, not downward, at least compared with the hypothesis-testing level [alpha]. This happened because z0 was positive, indicating that the 9-10 boundary was curving away from P(cent), just as in case 2 of Fig. Fig.5.5. The opposite can also occur, and in fact did for other clades. For example the clade at the top of Fig. Fig.22 that includes all of the species except lizard (species 2) had [alpha] = 0.775 compared with [alpha] = 0.875.

We carried out these same calculations using the more efficient tree-building algorithm employed in Escalante and Ayala (11); that is we used Felsenstein’s phylip package (12) on the complete RNA sequences, neighbor-joining trees based on Kimura’s (13) two-parameter distances.

In order to vary our problem slightly, we looked at the clade 7-8 (Pfr-Pkn), which is more questionable than the 9-10 clade. The tree produced from the original set is:

An external file that holds a picture, illustration, etc.
Object name is pq0060195006.gif

Step 1. B = 2000 first-level bootstrap vectors. Some 1218 of the corresponding bootstrap trees had the 7-8 clade, giving the estimate [alpha] = 0.609 = 1218/2000.

Step 2. We took, as before, seven cases without the 7-8 clade, and for each one found a multinomial vector near the 7-8 boundary.

Step 3. For each of the boundary vectors p(j) we generated B2 = 400 second-level bootstrap vectors

equation M53

computed the corresponding tree, and counted the number of trees having the 7-8 clade. The numbers were as follows for the seven cases:

equation M54

From the total we calculated an estimate of the correction term z0 in formula 2,

equation M55

Step 4. The acceleration constant “a” appearing in formula 2 was computed as before giving:

equation M56

Step 5. Finally we applied formula 2 with z = Φ−1(0.609) = 0.277 to get z = 0.417, or [alpha] = Φ(z) = 0.662. In this case [alpha] is bigger than [alpha], reflecting the fact that the 7-8 boundary curves toward the central point, at least in a global sense.

Computing [alpha] is about 20 times as much work as [alpha], but it is work for the computer and not for the investigator. Once the tree-building algorithm is available, all of the computations require no more than applying this algorithm to resampled versions of the original data set.

Discussion and Summary

The discussion in this paper, which has gone lightly over many technical details of statistical inference, makes the following main points about the bootstrapping of phylogenetic trees.

(i) The confidence values [alpha] obtained by Felsenstein’s bootstrap method are not biased systematically downward.

(ii) In a Bayesian sense, the [alpha] can be thought of as reasonable assessments of error for the estimated tree.

(iii) More familiar non-Bayesian confidence levels [alpha] can also be defined. Typically [alpha] and [alpha] will converge as the number n of independent sites grows large, at rate 1/equation M57.

(iv) The [alpha] can be estimated by a two-level bootstrap algorithm.

(v) As few as 100 or even 50 bootstrap replications can give useful estimates of [alpha], while [alpha] estimates require at least 2000 total replications. None of the computations requires more than applying the original tree-building algorithm to resampled data sets.

Acknowledgments

We are grateful to A. Escalante and F. Ayala (14) for providing us with these data. B.E. is grateful for support from Public Health Service Grant 5 R01 CA59039-20 and National Science Foundation Grant DMS95-04379. E.H. is supported by National Science Foundation Grant DMS94-10138 and National Institutes of Health Grant NIAID R29-A131057.

Footnotes

The publication costs of this article were defrayed in part by page charge payment. This article must therefore be hereby marked “advertisement” in accordance with 18 U.S.C. §1734 solely to indicate this fact.

References

1. Efron B, Tibshirani R. An Introduction to the Bootstrap. London: Chapman & Hall; 1993.
2. Felsenstein J. Evolution. 1985;39:783–791.
3. Hillis D, Bull J. Syst Biol. 1993;42:182–192.
4. Felsenstein J, Kishino H. Syst Biol. 1993;42:193–200.
5. Newton M A. Biometrika. 1996;83:315–328.
6. Zharkikh A, Li W H. Mol Biol Evol. 1992;9:1119–1147. [PubMed]
7. Efron, B. (1982) SIAM CBMS-NSF Monogr. 38.
8. Tibshirani R J. Biometrika. 1989;76:604–608.
9. Efron B. J Am Stat Assoc. 1987;82:171–185.
10. Press W, Flannery B, Teukolsky S, Vetterling W. Numerical Recipes. New York: Cambridge Univ. Press; 1987.
11. Escalante A, Ayala F. Proc Natl Acad Sci USA. 1995;92:5793–5797. [PMC free article] [PubMed]
12. Felsenstein, J. (1993) phylip (Univ. of Washington, Seattle).
13. Kimura M. J Mol Evol. 1980;16:111–120. [PubMed]
14. Escalante A, Ayala F. Proc Natl Acad Sci USA. 1994;91:11371–11377. [PMC free article] [PubMed]

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences
PubReader format: click here to try

Formats:

Related citations in PubMed

See reviews...See all...

Cited by other articles in PMC

See all...

Links

Recent Activity

Your browsing activity is empty.

Activity recording is turned off.

Turn recording back on

See more...