 Research article
 Open Access
 Published:
Phylogenomics with incomplete taxon coverage: the limits to inference
BMC Evolutionary Biology volume 10, Article number: 155 (2010)
Abstract
Background
Phylogenomic studies based on multilocus sequence data sets are usually characterized by partial taxon coverage, in which sequences for some loci are missing for some taxa. The impact of missing data has been widely studied in phylogenetics, but it has proven difficult to distinguish effects due to error in tree reconstruction from effects due to missing data per se. We approach this problem using a explicitly phylogenomic criterion of success, decisiveness, which refers to whether the pattern of taxon coverage allows for uniquely defining a single tree for all taxa.
Results
We establish theoretical bounds on the impact of missing data on decisiveness. Results are derived for two contexts: a fixed taxon coverage pattern, such as that observed from an already assembled data set, and a randomly generated pattern derived from a process of sampling new data, such as might be observed in an ongoing comparative genomics sequencing project. Lower bounds on how many loci are needed for decisiveness are derived for the former case, and both lower and upper bounds for the latter. When data are not decisive for all trees, we estimate the probability of decisiveness and the chances that a given edge in the tree will be distinguishable. Theoretical results are illustrated using several empirical examples constructed by mining sequence databases, genomic libraries such as ESTs and BACs, and complete genome sequences.
Conclusion
Partial taxon coverage among loci can limit phylogenomic inference by making it impossible to distinguish among multiple alternative trees. However, even though lack of decisiveness is typical of many sparse phylogenomic data sets, it is often still possible to distinguish a large fraction of edges in the tree.
Background
Ready access to vast sequence databases and new data emerging from largescale sequencing efforts is transforming efforts to infer the phylogenetic history of species. Efforts to build ever larger subtrees of the "tree of life" are pushing the field to grapple with highly speciesrich data sets (plants: 2538 taxa [1]; legumes: 2228 taxa [2]; Asterales: 13,533 taxa [3]; eukaryotes: 73,060 taxa [4]). At the same time, some recent studies exploiting complete genome sequences or genomic libraries include 100s  1000s of loci [5–11]. The former tend to be data sets with many taxa and few loci; the latter few taxa and many loci. However, the distinction is blurring as larger data sets of both kinds have been constructed using semiautomated assembly pipelines [3, 10] and high performance phylogenetic inference packages (e.g. [12]).
Although such vast data sets have effectively solved certain phylogenetic problems, such as the broad outline of yeast phylogeny [5], in other taxa they have uncovered a surprisingly high level of incongruence and uncertainty (reviewed in [13]). Case studies in Drosophila [14], rice [1, 11, 15], house mouse [16], and primates [17] document processes generating incongruence among gene trees in different parts of the genome that contribute nearly as much to the signal as the true species history does. Phylogenetic methods are struggling to keep pace with inferential complications arising from these processes, such as the potential for statistical inconsistency when sequences are concatenated [18, 19]. Indeed, a minor paradigm shift appears to be occurring toward retaining the individuality of signals associated with small genomic regions ("gene trees") rather than simply concatenating all sequence data into an overall analysis [20–24]. This approach comprises socalled "supertree" methods [25] in the broadest sense of that term. In phylogenomic contexts this includes methods that explicitly try to build species trees while reconciling gene trees by modeling processes at the interface between phylogenetics and population genetics, such as lineage sorting [24, 26, 27], recombination [28] and hybridization [29, 30].
In addition to biological processes which evidently confound phylogenomic inference are complexities that stem from the origin of the data themselves. One of the hallmarks of typical phylogenomic data sets is partial taxon coverage among loci–by which we mean not merely missing nucleotides within an alignment but loci for which an entire sequence is missing for some taxa (Sanderson et al. [31]; also referred to as "taxon occupancy" by Hejnol et al. [10]). Missing data arise from causes including biases in sequence databases, the technicalities of sequencing strategies, and real evolutionary processes of sequence divergence or gene loss. Whenever sequences from genomic libraries such as ESTs or BACends provide only partial coverage of a genome, the mismatch between regions covered in different species will generate missing data. Whole genome shotgun sequencing using technologies that assemble at low coverage values will likewise entail missing data, especially at broader phylogenetic scales. Even finished whole genomes can fail to have homologs in a collection of species for various reasons ranging from accelerated sequence divergence to gene loss [32]. It is not unusual for finished genomes to have numerous genes with no detectable homologs in any other taxon (e.g., the maize genome has 2000 unique genes not found in close relatives: [33]).
The consequences of missing data for phylogenetic inference were first studied in the context of integrating fossil taxa, in which there are typically large subsets of missing morphological data, with more complete extant taxa [34–37]. More recently the impact of missing data on accuracy of inferred trees has been examined in the more general context of molecular and phylogenomic data sets [11, 38–41] where missing data arises for a variety of reasons. Collectively this body of work treats missing data at the scale of individual cells in a taxon by character data matrix or sequence alignment up to entirely missing sequences for some taxa in a supermatrix or supertree setting, which is the phylogenomic context we consider here. Conclusions about the negative impact of missing data on accuracy have ranged from optimistic [37, 42, 43] to somewhat more cautious [38, 41]; it is possibly fair to say that many empirical studies have argued that the impact of missing data tends to be unbiased and can be ameliorated by sufficient overall quantity of data (e.g., [10]), and most simulation work agrees (see exceptions: [35, 41]). However, there has been frequent speculation about the distribution of missing data in the matrix (e.g. its "evenness", [38]: page 546; [10]: SOM). General conclusions have remained elusive both because of lack of characterization of this distribution and the difficulty of separating the usual problems of phylogenetic inference–error and bias caused by the data–from the simple absence of data.
In the phylogenomic context of multiple loci, a natural question is when can phylogenetic information from different loci be combined to produce a good tree with all taxa present, even when taxa are missing for some loci? Ideally this question should be abstracted away from the details of tree reconstruction methods. We derived some formal results recently for a relatively simple notion of combinability  "decisiveness" ([44]; note, Goloboff [45] used this term with a very different definition). A pattern of taxon coverage is decisive for some tree on all the taxa in a multilocus data set if that tree is uniquely defined by combining the (correctly inferred and perfectly concordant) trees from the separate loci. Our previous paper [44] focused on a strong sense of decisiveness: decisiveness for all trees. In this paper we also consider weaker notions of decisiveness, derive further results on decisiveness in the important context of sampling from genomescale data, and examine the utility of the concept in real phylogenomic data sets. The theory will permit us to make relatively precise statements about matters such as the amount and distribution of missing entries, at least within bounds. The scale of phylogenomic data sets and the sampling properties of genomic sequencing protocols is likely to increase the relevance of our mathematical theory.
Methods
Overview
This section outlines several mathematical results, so we begin with an intuitive description of its main point. We assume a phylogenomic data set consists of k loci (however defined) and n taxa. Loci with data present for fewer than n taxa have "missing data". Missing data across the entire data set can thus be characterized by the pattern of "taxon coverage", the set of sets of taxa present for each locus or tree (Figure 1). The basic idea of the paper is that we would like taxon coverage to be "decisive" for the true tree of all n taxa. This means that, taken together, all the subtrees of the true tree corresponding to the partial taxon sets at the different loci should be sufficient to uniquely define the true tree. Surprisingly, this is not true for many patterns of partial taxon coverage. This goal is independent of the sequence data, i.e., whether the loci agree on one tree or contain sufficient data to infer any tree. Setting those issues aside lets us isolate the effects of taxon coverage itself. Without sufficient coverage, even the best data will fail to recover a tree even if the underlying data themselves are of impeccable quality.
Questions about taxon coverage arise in at least two contexts. In the first, taxon coverage is given a priori. This might happen when a data matrix has already been assembled from GenBank, or in an examination of a data set from the literature. In this case, the true tree is unknown, and the key question is whether the data set is decisive for all trees, some trees, or no trees. In the second context, taxon coverage can be modeled as the outcome of a sampling process. This might result from a sequencing strategy, for example, that induces a certain quantity of missing data, but for which those data are more or less randomly distributed. Here the pertinent question is how many loci must be sampled to guarantee decisiveness for the unknown true tree.
Definitions
We begin by recalling some basic definitions from phylogenetic theory. Following Semple and Steel [46], given a set X of taxa, a phylogenetic Xtree is a (unrooted) tree T in which the leaves, or terminal taxa, of T consist of the label set X (taxon names) and all the remaining vertices (nodes) of T are unlabelled and have at least three incident edges. T is binary (completely bifurcating) if every internal vertex has exactly three incident edges. For a phylogenetic tree T and a subset Y of X, let TY denote the induced phylogenetic tree on leaf set Y (the tree obtained from the minimal subtree connecting Y by suppressing any vertices of degree two). We will let n = X throughout. A quartet tree is a binary phylogenetic tree on four leaves. For such a tree with leaves a, b, c, d, we write abcd if the internal edge of the tree separates the pair a, b from c, d.
A rooted phylogenetic tree is a tree obtained from a phylogenetic tree by deleting some leaf and its incident edge and regarding the other endpoint of that edge as a root vertex. Rather than defining the notions that follow for both rooted and unrooted phylogenetic trees separately, we will define them just for unrooted trees; the analogous definitions for rooted trees follow immediately by regarding any rooted tree on a set of n taxa as an unrooted phylogenetic tree on n+1 taxa, the additional taxon being some fixed reference outgroup (real or hypothetical).
We now define some key concepts. Let Y be the (label) set of taxa with nonmissing data for some locus (Y_{ i }if locus i is specified).

Whenever Y ⊆ X, we say that a binary phylogenetic Xtree T displays a binary phylogenetic Ytree, T' if TY = T'. More generally, for Y ⊆ X, we say that a phylogenetic Xtree T displays a phylogenetic Ytree, T' if TY either equals T' or is a resolution of that tree (i.e. all the splits of T' are contained in TY).

We say that a collection of phylogenetic trees T_{1},...,T_{ k }defines a phylogenetic Xtree T if X is the union of the leaf sets of the trees T_{1},...,T_{ k }and there exists one, and only one phylogenetic Xtree that displays these trees, and this tree is T. This implies T that must be binary.

An internal edge e of a binary tree T is said to be distinguished by some other tree if both trees display a quartet tree xywz but the tree T/e (the tree obtained from T by collapsing e) does not display this quartet (this means that x, y, w, z comes from each of the four subtrees of T incident with e). There is an analogous notion of 'distinguished' for rooted trees based on rooted triples rather than quartet trees. For example, in Figure 2A the internal edge below the clade C, D of the original tree (left) is not distinguished by either of the two subtrees (middle) shown; however in Figure 2B all three interior edges of the original tree (left) are distinguished by the subtrees (middle).

For a collection S = {Y_{1}, ..., Y_{ k }} of subsets of X, we say that S is the pattern of taxon coverage or just taxon coverage (Figure 1). Any taxon found in all k subsets is called a reference taxon. The taxon coverage density is .

We say that S is decisive for a phylogenetic tree T provided TY_{1},...,TY_{ k }defines (Figure 2).

We say that S is phylogenetically decisive for all trees if it satisfies the following property: If T and T' are binary phylogenetic Xtrees, with TY = T'Y for all Y ∈ S then T = T'. In other words, for any binary phylogenetic Xtree T, the collection of induced subtrees {TY:Y ∈ S} defines T.
These last two definitions are from [44], although we now adopt the convention of saying "decisive for all trees" instead of merely "decisive". Notice that a pattern of taxon coverage that is decisive for a given tree can involve far fewer loci than any pattern of taxon coverage that is decisive for all trees; for instance, for every binary phylogenetic tree T, there is a set S of just n  3 quadruples (set of four taxa) for which S is decisive for T [47] but any set of quadruples that is decisive for all trees must have size that is at least cubic in n (this follows from Theorem 1, below).
Notice that there is a subtle but fundamental distinction between questions about whether an arbitrary collection of input trees, T_{1},...,T_{ k }, defines a unique tree, T, on the one hand, and whether a pattern of taxon coverage, S = {Y_{1},...,Y_{ k }}, together with a tree, T, induces a set of subtrees, TY_{1},...,TY_{ k }, that uniquely defines T. Intuitively, in the first case the focus is on the subtrees, whereas in the second the focus is the pattern of taxon coverage. The term "define" refers to the first context; "decisive" to the second. What does it mean when taxon coverage is not decisive for all trees? Then there exists two or more distinct trees which cannot be differentiated from one another based only on the subtrees induced by the taxon coverage pattern, because these trees induce the same set of subtrees. Of course, these may or may not include the "true tree" for any given problem in phylogenetic inference, but surely it is risky to be unable to distinguish among possibilities in case the true tree is involved.
Context 1: Taxon coverage is fixed a priori
In this context, we assume S is given. Steel and Sanderson [44] established exact conditions for when a pattern of taxon coverage, S, is decisive for all (unrooted) trees. Briefly, for every fourelement partition of the label set, there must be a quadruple of taxa in some set in S such that each element of the quadruple is found in a different element of the partition. In general testing this "fourway partition" condition is computationally expensive, as the number of fourway partitions is exponential in the size of the label set. Easier to compute are (i) a necessary condition, which is that for each triple (set of three taxa) there must be at least one taxon set in S containing that triple [48], and (ii) a sufficient condition, which requires that, assuming a reference taxon exists, every quadruple containing that reference taxon has at least one taxon set in S containing this quadruple. See Figure 3 for some simple examples. The necessary condition can be quickly used to determine when taxon coverage is not decisive for all trees, and the fraction of triples present may provide an indication of the impact of low taxon coverage. Below we give several empirical examples.
It is also possible to derive some lower bounds on the number of loci required for phylogenetic decisiveness for all trees. We begin with the simpler case of subtrees defining a tree. A necessary condition for an arbitrary collection of subtrees to define a tree is given by [49]: if T_{1},...,T_{ k }define a phylogenetic tree with n leaves then:
where ι(T_{ j }) refers to the number of internal edges of T_{ j }. For example, at least n3 quartet trees are needed to define a tree with n leaves. A similar necessary condition holds for decisiveness for a given tree. Since ι(T_{ j }) is at most the number of leaves of T_{ j }minus 3 it follows that if S = {Y_{1},...,Y_{ k }} is phylogenetically decisive for T then:
[50], where n_{ j }= Y_{ j }. As noted in this last paper, Inequality (2) is not tight in the following sense: certain nineleaf binary trees cannot be defined by any two sixleaf subtrees, even though Inequality (2) is satisfied since (63) + (63)≥ (93).
A consequence of Inequality (2) is that if the sets Y_{1}, ..., Y_{ k }each have size at most m then a lower bound on the number of loci required for decisiveness for a given tree is:
Similar bounds can be obtained for phylogenetic decisiveness for all trees.
Theorem 1 If a collection S = {Y_{1}, ..., Y_{ k }} of subsets of X is phylogenetically decisive for all trees then:.
where n_{ j }= Y_{ j }. In particular, if each of the sets in S has size at most m then:
(See Appendix for proof). This provides a necessary condition, or lower bound, for phylogenetic decisiveness for all trees. Roughly speaking, if some fraction of taxa, f = m/n, is present for each locus, then we need at least (1/f)^{3} loci for decisiveness for all trees, while at least (1/f) loci are required for decisiveness for a given tree.
Partial decisiveness
If we knew T, it would be sufficient to use results on defining trees to describe the taxon coverage needed to define T from subtrees. In practice we do not, and to play it safe, we require sufficient taxon coverage for all T (decisiveness for all trees). This may be too strong a requirement. Perhaps it is sufficient for taxon coverage to be decisive for most trees, assuming then that the true tree is likely among this set of trees. Figure 4 shows an example in which taxon coverage is not decisive for all trees (easy to see because not all triples are present), but is decisive for 6 out of 15 possible rooted trees for 4 taxa. This example suggests it would be useful to enumerate or estimate the fraction of trees for which S is decisive.
Determining when taxon coverage is decisive for only some trees involves an important open question. When exactly does a set of subtrees define a tree? The bound stated earlier does not specify how to tell if some set of n3 or more quartet trees defines a tree. The answer is known for rooted [47], but not for unrooted trees. A collection of rooted trees defines a tree if two conditions are met: each subtree is displayed by the tree, and each internal edge of the tree is distinguished by an internal edge of at least one of the input trees ([47]: see definition above). In contrast to the rooted setting, distinguishing all the edges of an unrooted tree is only a necessary (but not sufficient) condition for a collection of unrooted trees to define that tree. To proceed, we therefore restrict attention to the rooted case, which is equivalent to assuming there exists in the data set a reference taxon which can provisionally be used to root the input trees (in an artificial but useful sense of "rooting").
For rooted trees, the fraction of trees, ∏_{ D }, that are decisive for a given pattern of taxon coverage could be determined by checking these conditions for all possible trees. For small sets of taxa complete enumeration is feasible. For larger data sets, the true fraction of trees for which the taxon coverage is decisive can be estimated from the fraction in a large random sample of trees (under a uniform/equiprobable distribution of trees).
However, the condition of distinguishability of edges suggests a potentially more sensitive measure of "partial" decisiveness: the probability of an edge being distinguished on a tree for a given pattern of taxon coverage, ∏_{ d }. This is the fraction of edges on the tree that are distinguished by subtrees induced by the taxon coverage pattern, averaged across all trees, or a random sample of trees. We examine these measures of partial decisiveness in empirical examples below.
Context 2: Taxon coverage is the product of a random sampling process
In this context the taxon coverage is not fixed but instead is determined by a random process of sampling. This might be a reasonable model for data assembled from partial genomic coverage, for example. The question we want to address is how many loci must be sampled to guarantee with some high probability that the taxon coverage will be decisive for some unknown tree T. In this context we need not require that it be decisive for all trees, because the results we derive will hold for any tree T and the true tree will be one of these. This is a subtle difference compared to the first context of a fixed taxon coverage pattern, where it made sense to require decisiveness simultaneously for most if not all trees. One way to understand this is to realize that because the sampling scheme is generating random patterns of taxon coverage, there is a chance that they are decisive for any particular true tree, and the probability calculations will be derived on this assumption. [If there were reason to think that two or more trees are "correct", and we want to require the random taxon coverage will define all of them, we might insist on decisiveness for all trees in this context too–see Discussion for possible examples.]
Let T be an unknown binary phylogenetic Xtree, and suppose we independently sample k random subsets S_{1},...,S_{ k }of X according to the following process: For each i, taxon x is included in S_{ i }with probability p(x), independently of other taxa. We will first consider two cases:

Uniform coverage (UC): p(x) = p for all taxa x in X;

Uniform (+1 complete) coverage( UC^{+1}): p(y) = 1 for one taxon y in X, and p(x) = p for all other taxa x in X. This is the case in which a reference taxon is present. Later we will discuss possible extensions of this model to allow variable taxon coverage probabilities across a tree.
Recall that taxon coverage pattern leads to a set of induced subtrees for each locus, TS_{1},...,TS_{ k }. Previously we assumed there was no conflict among these induced trees–they could be reconstructed accurately, but here we can obtain some results even if these induced trees are not fully resolved. We use a simple random model for lack of resolution in the induced trees. It does not explicitly model the possible sources of this loss of resolution, such as multiple hits in sequence data, but it provides a tractable starting point. Assume for some fixed probability q that each edge in TS_{ i }(for each i) is retained with probability q or collapsed with probability 1q, and this is done independently across the edges of TS_{ i }, and across the different induced trees. Let denote the resulting set of partiallyresolved induced subtrees of T. Let E_{ k }(T) be the event that defines T.
We are interested in computing bounds on the probability P(E_{ k }(T)) of this event that depend just on p, q and the total number of taxa n =X. It is useful to distinguish two further cases:

Rooted: T (and thereby the induced subtrees) are rooted trees;

Unrooted: T (and thereby the induced subtrees) are unrooted trees.
Let R(n) denote the set of rooted binary trees on n leaf taxa, and U(n) the set of unrooted binary trees on n leaf taxa. Note that by rooting a tree on an arbitrary taxon we can view U(n+1) as equivalent to R(n). Moreover, in what follows the UC condition applied to R(n) is essentially equivalent to the UC^{+1} condition applied to U(n+1).
Theorem 2 (i). For any rooted tree T in R(n), under UC (or an unrooted tree T in U(n+1) under UC^{+1}) we have: P(E_{ k }(T))≥ 1(n2) · (1p^{3}q)^{k}. Consequently, for ε > 0, if .
Moreover, for any unrooted tree T in U(n+1) under UC, P(E_{ k }(T)) ≥ 1  ε holds if the term p^{3} in the above inequality is replaced by p^{4}.
(ii). Conversely, for any ε > 0, if then there exist (exponentially many) choices of T ∈ R(n) under UC (and trees in U(n+1) under UC or UC^{+1}) for which P(E_{ k }(T)) < 1  ε (See Appendix for proof).
Together these conditions give (respectively) upper and lower bounds on the number of loci needed for decisiveness relative to a single (unknown) tree. The precise number depends on the shape of the tree.
Remarks
When q = 1 the event E_{ k }(T) is equivalent to the event that S = {S_{1},...,S_{ k }}is phylogenetically decisive for T, but for q < 1 the event is a stronger condition. Also, Theorem 2 readily extends to allow the probabilities of taxon coverage to vary across the tree, albeit at the expense of more complicated formulae. However, there is one simple case where the same formulae apply: Part (i) holds as stated if, in the Uniform Coverage conditions, the equality p(x) = p for all taxa x is weakened to p(x) ≥ p for all x (similarly, part (ii) holds if we impose an inequality in the reverse direction).
We can also consider models that explicitly reflect how taxon coverage is often much more thorough within a clade than across the entire tree, by considering the following cladespecific condition:

Variable coverage ( VC ): p(x) ≥ p for all taxa x in clade C, and p(x) ≥ p' for any taxon x not in C (where p' <p).
Suppose that we have a rooted tree T in R(n), and for each of its n2 nontrivial clades, we independently generate at least r taxon sets, where each taxon is included or not in each taxon set indepedently with a probability p(x) that satisfies the VC condition for that clade. Repeat this independently for all the n2 clades of T (thus the resulting total number k of taxon sets must be at least r(n2)). Then the proof of Theorem 2(i) easily modifies to show that P(E_{ k }(T)) ≥ 1 ε provided that .
Empirical examples
We explore these theoretical results in several data sets derived from a diversity of phylogenomic data. We assess whether necessary and sufficient conditions for decisiveness for all trees are satisfied using our theoretical results. We also estimate the partial decisiveness quantities ∏_{ D }and ∏_{ d }using simulations, because no analytical results are known. We estimated these quantities for each data set using 1000 replicate simulated random trees generated using PAUP*'s equiprobable option [51]. Since the two measures of partial decisiveness can only be estimated on rooted trees, we estimate these quantities in a "reference subset" of the original data set. A reference subset is found by first identifying the taxon with the most loci present in the taxon coverage pattern, pruning all loci not present in this taxon from the entire matrix, and then removing any taxa that have been rendered dataless by this operation. This generates a data set with a reference taxon in the sense defined earlier, which can then be used to artificially "root" the analysis. Finally, we assess the bounds on data set size implied under random sampling of loci. In those analyses we assume the unrooted case without a reference taxon and require an error probability no greater than 5%.
Data mining examples
Driskell et al. [6] mined GenBank to build a sparse data set of 251 loci and 69 green plant taxa with a coverage density of 15% (Table 1). A necessary condition for decisiveness for all trees is the presence of all triples: since only 84% are present, the taxon coverage cannot be decisive for all trees. Indeed for the reference subset the coverage is only decisive for 2% of trees, so the probability of decisiveness for the true tree is quite low. However, on average 95% of internal edges across all trees can be distinguished by the taxon coverage. Thus, the coverage is likely inadequate to build the complete binary tree, but there is reason to be optimistic about most of it, at least from the perspective of missing data.
We also examined three data sets extracted from the PhyLoTA database [52], a tool for phylogenomic data mining of GenBank. These were Pleurodira (sidenecked turtles: see Figure 5), Cactaceae (the cacti), and Amorpheae (a clade of legumes), all based on data from GenBank release 168 (Table 1). None of the three were phylogenetically decisive for all trees, because none exhibited all possible triples of taxa. The probability of the taxon coverage pattern being decisive for a random tree for their reference subsets was quite small, ranging from 0 to 1.7%. On the positive side, the fraction of edges that can be distinguished on average for a random tree is quite high, ranging from 61% to 95%.
However, the structure of the largest matrix, for Cactaceae is sobering. If we were to continue sampling loci with the same coverage density (14%) in the hopes of constructing a data set with high probability of being decisive for the true tree (Theorem 2, with perfect resolution), 2932 loci would be minimally necessary, and 23,891 would suffice. Of course, these results presuppose something like a uniform distribution of sampling effort across taxa, which is more likely to be found in genomic data sets than database mining studies. Nonetheless, these bounds are suggestive.
Finally, in this category we turn to several studies with very large taxon sets, for which we can only apply some of the simple results in Theorem 1. Goloboff et al. [4] assembled a supermatrix of 13 loci and 70,060 taxa. The locus with largest taxon coverage included ~20,000 taxa. By Theorem 1 the number of loci would have had to exceed 43 for phylogenetic decisiveness for all trees. Since most of the loci were sampled for far fewer than this number of taxa, a more accurate lower bound is probably higher.
This analysis, with coverage density of 8%, may be characteristic of taxon rich phylogenetic analyses published recently in which overall density is low, but a few loci have high coverage densities. For example, in [2] (2228 taxa of Leguminosae) and [3] (4954 taxa of Asterales) the locus with best coverage, nuclear ribosomal ITS, actually covered more than 73% and 84% of the label sets respectively, such that by Theorem 1 the lower bound on the number of loci is small, less than 3. However, in both cases, the ITS sequences were aligned by relatively "heroic" methods, and a more conservative procedure might have kept many separate taxonomically overlapping ITS alignments instead of one large one. We reported results from such an analysis (socalled "sparse" analysis in [2]) that ultimately included 1794 taxa in 72 loci. By Theorem 1 the lower bound for decisiveness for all trees in this case, assuming n/m = 1794/286, where 286 is the largest cluster (trnL), would have been 247 loci, far more than we had.
Partial genome sequences from shallow libraries
Hejnol et al. [10] constructed a large, sparse phylogenomic matrix of 94 taxa and 1487 loci derived mainly from ESTs. This is an expanded analysis of the widely cited phylogenomic study of 70 metazoan taxa [8]. Mean taxon coverage density is 18% across all loci, with the maximum density of 83% in one locus and a long tail of very low coverage loci. The given taxon coverage is not decisive for all trees, because it only includes 96% of possible triples (Table 1). Homo sapiens is present in 1351 of the loci. If we restrict the data to this reference subset, we can "root" the analysis with Homo as a reference taxon and test for a sufficient condition for decisiveness for all trees (a reference taxon plus all triples present: see above). For these loci there are still 94 taxa and 96% of possible triples are present. This fraction might have increased to 1 if the number of taxa in the new matrix had been less. This data set stands out by having a relatively high probability of decisiveness for random trees (34%), and a 99% chance of distinguishing a random edge in a tree. Under random taxon coverage (perfect resolution), by Theorem 2 the lower and upper bounds on loci are 1095 and 7148, which spans the actual data set.
Partial genome sequences from deep genomic libraries
Some genomic libraries are "deep", providing 10s to 100s of thousands of sequences, but still only partially cover a genome. Cranston et al. [11] analyzed data from BACend sequences from 10 species of Oryza including the complete genome of O. sativa and nine deep libraries averaging ~90,000 sequences per species. Collectively, these covered 44% of the CDS (coding regions) in O. sativa, but because of the random nature of library construction, of course, the pattern of overlap varied from species to species. The data were further filtered to include only single copy exonic regions with homology to O. sativa and having taxon coverage of at least four taxa, a total of 9481 exonic regions.
A posteriori the pattern of taxon coverage is trivially decisive for all trees because there are 6 loci (out of 9481) that have complete coverage–which automatically satisfies the fourway condition described earlier. An additional 60 loci are only missing one taxon. However, on average the taxon coverage among these exons averaged 48.3%. By Theorem 2 this value under random sampling and full resolution implies lower and upper bounds of 35 and 91 loci for decisiveness. However, if we consider partial resolution and if only one internal branch is present on average out of the 8 internal branches, the bounds increase to 292 and 742. Among a subset of loci most relevant for 6 of the species (the AA genome group) fully one quarter produced completely unresolved trees (the mean length of aligned exons was only 350 nt), so this is clearly an issue.
Complete genome sequences
Phylogenomic data sets constructed from complete genome sequences should suffer least from taxon coverage problems. We used Hahn et al.'s [32] analysis of gene families constructed from the 12 Drosophila complete genome sequences then available. Data were downloaded from Hahn's FRB Database http://www.indiana.edu/~hahnlab/fly/DfamDB/drosophila_frb.html and parsed to quantify taxon coverage. Loci for which there was at most a single copy of a gene present were retained. Of these 13,677 loci, 6979 had some taxa missing. The average taxon coverage was 66.3%. Note that this number is somewhat inflated because all loci that had only one taxon sampled (singletons) were excluded (Hahn et al. suggested many of these represent annotation errors). Clearly with 6698 loci having complete taxon coverage, there is no problem with phylogenetic decisiveness for all trees. Moreover, at this rate of taxon coverage on average, by Theorem 2, the number of randomly sampled loci needed for decisiveness for the true tree is bounded by 12  25 loci for 12 taxa, and even if resolution among trees were dismal (say one branch only out of 9 internal branches) we would have bounds of 127 and 246 loci. Thus if one were setting out to build a phylogenomic matrix with these data, this simple analysis suggests there are plenty of loci available. Interestingly the fractional taxon coverage is so high that even were one able to do this across 1000 species of Drosophila, the number of loci is still bounded by 26  47.
Results and Discussion
Impact of missing data on multilocus phylogenetic inference
Assessing the effect of missing data on phylogenetic inference has received substantial attention from phylogeneticists over many years (reviewed in [53]), but unambiguous conclusions have been elusive. For some amounts and patterns of missing data, simulation and empirical studies support the conclusion that its impact can be reduced to tolerable levels [37, 38]; for other cases, significant problems remain [39–41]. Properties of the data themselves, such as rates of evolution, stationarity, etc., can have a strong impact on the accuracy of inference, irrespective of the amount or pattern of missing data, so attempts to understand the problem at a comprehensive level taking all impacts into account have had poor predictive success.
Our results relate the taxon coverage–the amount and pattern of missing data–to the ability of data to define an unambiguous phylogenetic tree for all the taxa in the input, by separating the impact of missing data from tree reconstruction errors per se. To simplify the problem, we have defined a notion of phylogenetic decisiveness [44], which is separate from any notion of correctness of the individual gene trees based on individual loci.
We infer limits (bounds) on decisiveness. In both the context of a fixed pattern of taxon coverage and a random pattern generated by sampling, there are lower bounds to how many loci must be included for a given fraction of missing data. For the sampling case it is also possible to identify upper bounds so that it is clear when sufficient data are present. For a fixed (i.e., observed) taxon coverage pattern, it is possible to characterize whether it is decisive for some or all possible trees, but computing the latter is nontrivial.
Our results may help clarify why some arguments in the literature appear at odds with each other. On the one hand, Wiens [37] has suggested that it is not the fraction of missing data that is most important, but the overall amount of character data present. The most direct support from this in our results is seen in the random sampling context. According to Theorem 2 (i), for any fraction of missing data (1  p), there will be a number of loci that is sufficient to guarantee decisiveness. Another suggestive bit of evidence is seen in Table 1: Cactaceae and Metazoa have about the same fraction of missing data overall, but because Metazoa have so many more loci, the fraction of triples seen in that coverage pattern is much closer to the minimum level necessary for decisiveness (96% vs. 22%). A caveat is that the number of loci required can be quite large if the fraction of missing data is large or the number of taxa large (when p << 1 and or q << 1, the lower bound on number of loci k scales as 1/(p^{3}q) (expanding the expression Theorem 2 part (ii) in a Taylor series approximation)).
On the other hand, Hartmann et al. [39] and Lemmon et al. [41] discuss cases in which missing data are more problematic. Both studies simulated missing data at the sequence level occurring in blocks, which in our context we can think of as "loci". Both attributed errors in phylogenetic inference in part to these patterns of taxon coverage, often in combination with other factors. Our results on phylogenetic decisiveness for a fixed pattern of taxon coverage make it clear that some patterns of taxon coverage can be pathologically bad. Once we cannot count on random taxon coverage to ultimately sample all 4way partitions, it is easy to imagine patterns in which certain important 4way partitions are never seen and thus ambiguity remains a real possibility even as the number of loci gets arbitrarily large. The obvious case is just to suppose that we sample many loci but all of them either have {A, B, C, D} or {A, B, C, F} taxon coverage. This will never be decisive according to the 4way partition condition. Some of Hartmann et al.'s [39] ESTlike patterns of missing data are reminiscent of this case because of blocks of missing data at the ends in many alignments.
Implications in the context of gene tree discordance
Evidence is mounting that high levels of gene tree discordance is driven in part by real biological processes of lineage sorting, hybridization and recombination [14, 16, 17, 28]. Our analyses have by design set aside the latter issue, and by necessity the former, but incongruence is obviously real. Intuitively, since the lower bounds on the number of loci needed to infer a single tree decisively under random taxon coverage were derived assuming just one tree (see Appendix), we expect it would require many more loci to simultaneously be able to recover more than one tree. Interestingly in the Cranston et al. [11] analysis of rice phylogenomics, 118 out of 236 possible rooted 5taxon trees were found among the collection of gene trees (some undoubtedly due to error rather than lineage sorting). If lineage sorting is this rampant in a data set, we would need to know bounds not on decisiveness for one tree under random sampling but decisiveness for all trees. In an a posteriori analysis of a given pattern of coverage (as with rice), we can check decisiveness for all trees after the fact, and gene tree discordance provides a strong motivation for requiring this property.
Implications for nextgen sequencing strategies
Next generation sequence technologies are currently characterized by assembly of a large number of small reads. In phylogenomic analyses in which de novo assembly (without a reference genome) with limited coverage may be unavoidable, partial taxon coverage in the final data set may be the rule rather than the exception [54]. For example, the 1KP project [55] aims to use a shortread highthroughput approach to sequence transcriptomes of 1000 green plant species across 1 billion years of evolutionary history. A combination of partial transcriptome coverage in the final assemblies and lack of homology across such deep divergences will certainly limit the overall taxon coverage densities. Given estimates of this fraction derived from pilot studies it should be possible to use Theorem 2 to predict how much of the transcriptome is needed to anticipate a decisive analysis.
Does conflict hurt or help?
A particular consequence of Inequality (1) is that a binary phylogenetic tree T for a large number of species cannot be defined by a small number of poorly resolved trees. For example, if T has 1000 leaves, then we require a total of 997 or more internal edges amongst any set of trees that defines T. Now suppose we use a supertree method like MRP (Matrix Representation with Parsimony, see review in [25]) on these input trees. An interesting question is whether Inequality (1) might still hold if we replace the condition that the trees "T_{1},...,T_{ k }define T" by "T_{1},...,T_{ k }have a unique MRP tree T".
This seems plausible since the two notions are equivalent when the input trees T_{1},...,T_{ k }are compatible, and it might be supposed that conflictfree data is in some sense 'optimal'. However, it turns out that such a modification to Inequality (1) fails. For example, there is an incompatible set of six trees for 12 taxa, each with just one internal edge, that has a unique MRP tree T on those 12 taxa (results not shown); by contrast if we wished to additionally require the input trees to be compatible, we would require at least nine trees (each having one internal edge), not six. In other words, allowing the trees to conflict can in some cases actually 'help' reduce the amount of data required to determine a unique supertree by a method such as MRP.
Relation to phylogenetic "groves"
Decisiveness for all trees is a strong condition. It is sometimes possible to glean information about a tree that includes all taxa even when the taxon coverage pattern is not decisive for any such tree. A weaker sense of decisiveness is embodied in the notion of a "grove" of phylogenetic trees ([56]; reviewed in a less mathematical exposition in [57]). Figure 6 illustrates a taxon coverage pattern that is not decisive for any tree. However, for some tree(s) it exhibits the property that the collection of trees that display the subtrees induced by the taxon coverage pattern agree on parts of the tree. In the example it is only the position of one taxon that is variable among the trees consistent with the induced subtrees. The induced subtrees in this case are said to form a grove, because the trees discovered have information in them that is not contained in any of the induced subtrees alone.
Future work
Several problems are suggested by this work and its application to empirical studies. First, many real taxon coverage patterns are sparse enough that they are not decisive for all trees. It would be useful to know what data should be obtained to convert an indecisive to a decisive data set, or to convert one that is decisive with low probability to one that is decisive with high probability. In both cases there are natural optimality problems that could be stated that would try to minimize the cost in additional sequencing. Second, along the lines of phylogenetic groves, when a taxon coverage pattern is not decisive for the entire label set, it might well be decisive for a large subset of it. What is the size of the largest label set for which a given pattern of taxon coverage is decisive? In some sense this conveys the "effective tree size" which a taxon coverage pattern can address.
Conclusions
We have characterized the impact of partial taxon coverage in multilocus phylogenomic data sets in the context of both fixed and random patterns of coverage. For fixed coverage patterns we have determined lower bounds on the number of loci needed for a coverage pattern to be phylogenetically decisive for all trees–that is to allow reconstruction of a unique tree on all taxa irrespective of what the tree is. Most real data sets having reasonably large numbers of taxa are not decisive for all trees, but in these cases we developed methods for assessing the fraction of trees for which they are decisive and the fraction of edges in those trees that can be distinguished. In general, the first measure is still low, but the second can be quite high. For random taxon coverage patterns, such as might be seen in data sets derived from EST or BAC libraries, upper and lower bounds on the number of loci needed for decisive tree inference were obtained. Some real data sets required relatively few loci for decisiveness, particularly those with few taxa and modest levels of missing data, whereas other data sets required tens of thousands of loci when the number of taxa and fraction of missing data was high. Clearly, the pattern of taxon coverage is a factor in large scale phylogenetic inference, regardless of the details of the sequence data themselves or tree reconstruction method.
Appendix: Proofs
Proof of Theorem 1. If S is phylogenetically decisive for all trees then:
In other words, all threetaxon subsets of must be present as a subset of some element Y of S (this is Lemma 6.2.1 of [48]). Thus:
from which the results stated now follow.
Proof of Theorem 2: Part (i). First suppose that T is in R(n). For each internal edge e of T let A_{ e }be the event that e is distinguished by at least one of the trees (for the definition of 'distinguished' see [46]). Let B_{e,i}be the event that edge e is distinguished by TS_{ i }. By Theorem 3 of [47]TS_{1},...,TS_{ k }defines T precisely if each internal edge of T is distinguished by at least one of these induced trees. Consequently:
where E_{ int }(T) is the set of internal edges of T, and
By the Bonferroni inequality:
where overline denotes the complementary event. Now, by (5), we have: and for fixed e, the events are independent events of equal probability; consequently:
Now, if n_{1}, n_{2}, n_{3} denotes the number of leaves (in X) in the three subtrees of T that are incident with e but which do not contain the root of T then:
where the inequality arises because n_{1}, n_{2}, n_{3} ≥ 1. Applying this inequality to (7) we obtain: and so, by (6):
since a tree in R(n) has precisely n  2 internal edges, as required. The resulting bound involving k now follows by routine algebra.
Turning to the case of an unrooted tree T ∈ U(n + 1), if condition UC^{+1} holds then we can directly apply the result for rooted trees under UC. However if the weaker condition UC holds for T ∈ U(n + 1)then we use the result (from [47]) that T is defined by any set of quartet trees that distinguishes every edge of T provided that each quartet contains a fixed leaf. We can then repeat the above argument but at the penalty of increasing the exponent on p from 3 to 4.
Proof of Part (ii): Let m = ⌊n/3⌋, and let T_{1} be any tree in R(m). Identify each leaf of T_{1} with the root of a separate 3leaf binary tree to obtain a tree in T_{2} in R(3m). Consider the set E' of the m newlycreated internal edges of this tree. If n > 3m then form an arbitrary rooted tree from the remaining n  3m leaves, adjoin its root, and the root of T_{2} to a new root to obtain a tree T ∈ R(n) (if n = 3m, we simply take T = T_{1}). Now each edge e ∈ E' has just one leaf in the three subtrees that are incident with the edge and that do not contain the root of T. Thus, for each of these m internal edges we have:
and so, by (5), and the independence of B_{e, j}for different j, we have:
Now, although for a general tree the events A_{ e }are not independent, for this particular tree, and for this set E' of m internal edges, these events are independent. Consequently, by (4),
from which part (ii) follows upon applying the inequality: This completes the proof.
References
 1.
Kallersjo M, Albert VA, Farris JS: Homoplasy increases phylogenetic structure. Cladistics. 1999, 15 (1): 9193.
 2.
McMahon MM, Sanderson MJ: Phylogenetic supermatrix analysis of GenBank sequences from 2228 papilionoid legumes. Syst Biol. 2006, 55: 818836. 10.1080/10635150600999150.
 3.
Smith SA, Beaulieu JM, Donoghue MJ: Megaphylogeny approach for comparative biology: an alternative to supertree and supermatrix approaches. BMC Evolutionary Biology. 2009, 9: 3710.1186/14712148937.
 4.
Goloboff PA, Catalano SA, Mirande JM, Szumik CA, Arias JS, Kallersjo M, Farris JS: Phylogenetic analysis of 73 060 taxa corroborates major eukaryotic groups. Cladistics. 2009, 25 (3): 211230. 10.1111/j.10960031.2009.00255.x.
 5.
Rokas A, Williams B, King N, Carroll S: Genomescale approaches to resolving incongruence in molecular phylogenies. Nature. 2003, 425: 798804. 10.1038/nature02053.
 6.
Driskell AC, Ané C, Burleigh JG, McMahon MM, O'Meara B, Sanderson MJ: Prospects for building the tree of life from large sequence databases. Science (Washington D C). 2004, 306: 11721174. 10.1126/science.1102036.
 7.
Wildman D, Uddin M, Opazo J, Liu G, Lefort V, Guindon S, Gascuel O, Grossman L, Romero R, Goodman M: Genomics, biogeography, and the diversification of placental mammals. Proceedings of the National Academy of Sciences. 2007, 104 (36): 1439514400. 10.1073/pnas.0704342104.
 8.
Dunn CW, Hejnol A, Matus DQ, Pang K, Browne WE, Smith SA, Seaver E, Rouse GW, Obst M, Edgecombe GD, et al: Broad phylogenomic sampling improves resolution of the animal tree of life. Nature. 2008, 452 (7188): 745U745. 10.1038/nature06614.
 9.
Zou XH, Zhang FM, Zhang JG, Zang LL, Tang L, Wang J, Sang T, Ge S: Analysis of 142 genes resolves the rapid diversification of the rice genus. Genome Biology. 2008, 9 (3): 10.1186/gb200893r49.
 10.
Hejnol A, Obst M, Stamatakis A, Ott M, Rouse GW, Edgecombe GD, Martinez P, Baguna J, Bailly X, Jondelius U, et al: Assessing the root of bilaterian animals with scalable phylogenomic methods. Proceedings of the Royal Society BBiological Sciences. 2009, 276 (1677): 42614270. 10.1098/rspb.2009.0896.
 11.
Cranston KA, Hurwitz B, Sanderson MJ, Ware D, Wing RA, Stein L: Phylogenomic analysis from deep BACend sequence libraries in rice. Syst Bot. 2010
 12.
Stamatakis A, Ott M: Efficient computation of the phylogenetic likelihood function on multigene alignments and multicore architectures. Philosophical Transactions of the Royal Society BBiological Sciences. 2008, 363 (1512): 39773984. 10.1098/rstb.2008.0163.
 13.
Galtier N, Daubin V: Dealing with incongruence in phylogenomic analyses. Philosophical Transactions of the Royal Society BBiological Sciences. 2008, 363 (1512): 40234029. 10.1098/rstb.2008.0144.
 14.
Pollard DA, Iyer VN, Moses AM, Eisen MB: Widespread discordance of gene trees with species tree in Drosophila: Evidence for incomplete lineage sorting. Plos Genetics. 2006, 2 (10): 16341647.
 15.
Cranston KA, Hurwitz B, Ware D, Stein L, Wing RA: Species Trees from Highly Incongruent Gene Trees in Rice. Syst Biol. 2009, 58 (5): 489500. 10.1093/sysbio/syp054.
 16.
White MA, Ane C, Dewey CN, Larget BR, Payseur BA: FineScale Phylogenetic Discordance across the House Mouse Genome. Plos Genetics. 2009, 5 (11): 10.1371/journal.pgen.1000729.
 17.
Ebersberger I, Galgoczy P, Taudien S, Taenzer S, Platzer M, von Haeseler A: Mapping human genetic ancestry. Mol Biol Evol. 2007, 24 (10): 22662276. 10.1093/molbev/msm156.
 18.
Kubatko LS, Degnan JH: Inconsistency of phylogenetic estimates from concatenated data under coalescence. Syst Biol. 2007, 56 (1): 1724. 10.1080/10635150601146041.
 19.
Liu L, Yu LL, Pearl DK: Maximum tree: a consistent estimator of the species tree. Journal of Mathematical Biology. 2010, 60 (1): 95106. 10.1007/s0028500902600.
 20.
Ren FR, Tanaka H, Yang ZH: A likelihood look at the supermatrixsupertree controversy. Gene. 2009, 441 (12): 119125
 21.
Rannala B, Yang ZH: Phylogenetic inference using whole Genomes. Annual Review of Genomics and Human Genetics. 2008, 9: 217231. 10.1146/annurev.genom.9.081307.164407.
 22.
Edwards SV: Is a new and general theory of phylogenetic inference emerging?. Evolution. 2009, 63 (1): 119. 10.1111/j.15585646.2008.00549.x.
 23.
Degnan JH, Rosenberg NA: Gene tree discordance, phylogenetic inference and the multispecies coalescent. Trends Ecol Evol. 2009, 24 (6): 332340. 10.1016/j.tree.2009.01.009.
 24.
Knowles LL: Estimating Species Trees: Methods of Phylogenetic Analysis When There Is Incongruence across Genes. Syst Biol. 2009, 58 (5): 463467. 10.1093/sysbio/syp061.
 25.
BinindaEmonds ORP: The evolution of supertrees. Trends Ecol Evol. 2004, 19 (6): 315322. 10.1016/j.tree.2004.03.015.
 26.
Maddison WP, Knowles LL: Inferring phylogeny despite incomplete lineage sorting. Syst Biol. 2006, 55 (1): 2130. 10.1080/10635150500354928.
 27.
Edwards SV, Liu L, Pearl DK: Highresolution species trees without concatenation. Proc Natl Acad Sci USA. 2007, 104 (14): 59365941. 10.1073/pnas.0607004104.
 28.
Siepel A: Phylogenomics of primates and their ancestral populations. Genome Res. 2009, 19 (11): 19291941. 10.1101/gr.084228.108.
 29.
Kubatko LS: Identifying Hybridization Events in the Presence of Coalescence via Model Selection. Syst Biol. 2009, 58 (5): 478488. 10.1093/sysbio/syp055.
 30.
Meng C, Kubatko LS: Detecting hybrid speciation in the presence of incomplete lineage sorting using gene tree incongruence: A model. Theoretical Population Biology. 2009, 75 (1): 3545. 10.1016/j.tpb.2008.10.004.
 31.
Sanderson MJ, Driskell AC, Ree RH, Eulenstein O, Langley S: Obtaining maximal concatenated phylogenetic data sets from large sequence databases. Mol Biol Evol. 2003, 20: 10361042. 10.1093/molbev/msg115.
 32.
Hahn MW, Han MV, Han SG: Gene family evolution across 12 Drosophila genomes. Plos Genetics. 2007, 3 (11): 21352146. 10.1371/journal.pgen.0030197.
 33.
Soderlund C, Descour A, Kudrna D, Bomhoff M, Boyd L, Currie J, Angelova A, Collura K, Wissotski M, Ashley E, et al: Sequencing, Mapping, and Analysis of 27,455 Maize FullLength cDNAs. Plos Genetics. 2009, 5 (11): 10.1371/journal.pgen.1000740.
 34.
Donoghue MJ, Doyle JA, Gauthier J, Kluge AG, Rowe T: The Importance of Fossils in Phylogeny Reconstruction. Annual Review of Ecology and Systematics. 1989, 20: 431460. 10.1146/annurev.es.20.110189.002243.
 35.
Huelsenbeck JP: When are fossils better than extant taxa in phylogenetic analysis?. Syst Zool. 1991, 40 (4): 458469. 10.2307/2992240.
 36.
Kearney M: Fragmentary taxa, missing data, and ambiguity: Mistaken assumptions and conclusions. Syst Biol. 2002, 51 (2): 369381. 10.1080/10635150252899824.
 37.
Wiens JJ: Missing data, incomplete taxa, and phylogenetic accuracy. Syst Biol. 2003, 52 (4): 528538. 10.1080/10635150390218330.
 38.
Philippe H, Snell E, Bapteste E, Lopez P, Holland P, Casane D: Phylogenomics of eukaryotes: Impact of missing data on large alignments. Mol Biol Evol. 2004, 21: 17401752. 10.1093/molbev/msh182.
 39.
Hartmann S, Vision TJ: Using ESTs for phylogenomics: Can one accurately infer a phylogenetic tree from a gappy alignment?. BMC Evolutionary Biology. 2008, 8: 9510.1186/14712148895.
 40.
Campbell V, Lapointe FJ: The Use and Validity of Composite Taxa in Phylogenetic Analysis. Syst Biol. 2009, 58 (6): 560572. 10.1093/sysbio/syp056.
 41.
Lemmon AR, Brown JM, StangerHall K, Lemmon EM: The Effect of Ambiguous Data on Phylogenetic Estimates Obtained by Maximum Likelihood and Bayesian Inference. Syst Biol. 2009, 58 (1): 130145. 10.1093/sysbio/syp017.
 42.
Philippe H, Delsuc F, Brinkmann H, Lartillot N: Phylogenomics. Annual Review of Ecology Evolution and Systematics. 2005, 36: 541562. 10.1146/annurev.ecolsys.35.112202.130205.
 43.
de Queiroz A, Gatesy J: The supermatrix approach to systematics. Trends Ecol Evol. 2007, 22 (1): 3441. 10.1016/j.tree.2006.10.002.
 44.
Steel M, Sanderson MJ: Characterizing phylogenetically decisive taxon coverage. Applied Mathematics Letters. 2010, 23 (1): 8286. 10.1016/j.aml.2009.08.009.
 45.
Goloboff PA: Homoplasy and the choice among cladograms. Cladisticsthe International Journal of the Willi Hennig Society. 1991, 7 (3): 215232. 10.1111/j.10960031.1991.tb00035.x.
 46.
Semple C, Steel M: Phylogenetics. 2003, New York: Oxford University Press
 47.
Steel M: The complexity of reconstructing trees from qualitative characters and subtrees. J Classif. 1992, 9: 91116. 10.1007/BF02618470.
 48.
Humphries PJ: Combinatorial aspects of leaflabelled trees. 2008, Christchurch, New Zealand: University of Canterbury
 49.
Böcker S, Bryant D, Dress AWM, Steel MA: Algorithmic aspects of tree amalgamation. J Algorithms. 2000, 37 (2): 522537. 10.1006/jagm.2000.1116.
 50.
Bryant D, Steel M: Extension operations on sets of leaflabelled trees. Advances in Applied Mathematics. 1995, 16 (4): 425453. 10.1006/aama.1995.1020.
 51.
Swofford DL: PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). 2002, Sunderland, MA: Sinauer, 4
 52.
Sanderson MJ, Boss D, Chen D, Cranston KA, Wehe A: The PhyLoTA Browser: Processing GenBank for Molecular Phylogenetics Research. Syst Biol. 2008, 57: 335346. 10.1080/10635150802158688.
 53.
Wiens JJ: Missing data and the design of phylogenetic analyses. Journal of Biomedical Informatics. 2006, 39 (1): 3442. 10.1016/j.jbi.2005.04.001.
 54.
Gibbons JG, Janson EM, Hittinger CT, Johnston M, Abbot P, Rokas A: Benchmarking NextGeneration Transcriptome Sequencing for Functional and Evolutionary Genomics. Mol Biol Evol. 2009, 26 (12): 27312744. 10.1093/molbev/msp188.
 55.
The 1kp Project. [http://www.onekp.com/essential.html]
 56.
Ane C, Eulenstein O, PiaggioTalice R, Sanderson MJ: Groves of phylogenetic trees. Annals of Combinatorics. 2009, 13: 139167. 10.1007/s000260090017x.
 57.
Sanderson MJ, Ane C, Eulenstein O, FernandezBaca D, Kim J, McMahon MM, PiaggioTalice R: Fragmentation of large data sets in phylogenetic analysis. Reconstructing evolution: new mathematical and computational advances. Edited by: Gascuel O, Steel M. 2007, Oxford: Oxford University Press
Acknowledgements
This research was supported by a US NSF grant to MJS and MMM. MS thanks the Allan Wilson Centre for Molecular Ecology and Evolution, and the NZ Royal Society (James Cook Fellowship). We thank Tandy Warnow for discussion.
Author information
Additional information
Authors' contributions
MJS, MMM, and MS conceived the initial problems, which were then formalized as theorems and proofs by MS. MJS and MMM designed and analyzed the empirical studies and formulated implementations of partial decisiveness measures. MMM wrote code to support the latter. MJS and MS wrote the manuscript, with editing by MMM. All authors read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Sanderson, M.J., McMahon, M.M. & Steel, M. Phylogenomics with incomplete taxon coverage: the limits to inference. BMC Evol Biol 10, 155 (2010) doi:10.1186/1471214810155
Received
Accepted
Published
DOI
Keywords
 Rooted Tree
 Phylogenetic Inference
 Internal Edge
 Input Tree
 Uniform Coverage