 Review article
 Open Access
 Published:
A priori assessment of data quality in molecular phylogenetics
Algorithms for Molecular Biology volume 9, Article number: 22 (2014)
Abstract
Sets of sequence data used in phylogenetic analysis are often plagued by both random noise and systematic biases. Since the commonly used methods of phylogenetic reconstruction are designed to produce trees it is an important task to evaluate these trees a posteriori. Preferably, however, one would like to assess the suitability of the input data for phylogenetic analysis a priori and, if possible, obtain information on how to prune the data sets to improve the quality of phylogenetic reconstruction without introducing unwarranted biases. In the last few years several different approaches, algorithms, and software tools have been proposed for this purpose. Here we provide an overview of the state of the art and briefly discuss the most pressing open problems.
Introduction
Ideally, the evolutionary process generates data that conform to an additive tree structure. This ideal, however, is rarely if ever reached in practice. A diversity of natural processes conspire with imperfect models and methods of data analysis to cause sometimes large deviations. An unavoidable confounding factor is noise, introduced by the stochastic nature of sequence evolution itself, leading to a degradation of the phylogenetic signal when divergence times become very large and when data sets are small. Systematic biases are introduced by deviations from treelike evolution, such as recombination and lateral gene transfer, as well as by violations of the model assumptions on which the data analysis is based, such as parallel evolution.
Nearly all methods of molecular phylogenetics, furthermore, use sequence alignments to obtain estimates of the divergence between taxa. For the purpose of phylogenetic reconstruction, each column of a multiple sequence alignment (MSA) is a character. In other words, the the letters in a column are treated as if they have arisen from a common ancestral state. All the algorithms for computing MSAs, however, explicitly or implicitly optimize cost functions (such as a sum of pair score) that are unaware of the detailed phylogenetic structure of the data set. This optimization problems, furthermore, are NP hard [1],[2] and hence can be solved only with (heuristic) approximation algorithms. MSAs, thus, are necessarily only approximations to a perfect assignment of homologous sequence positions. As most alignment methods internally use a guide tree representing a rough estimate of the particular phylogeny to determine the order in which taxa are treated, MSAs incorporate an implicit phylogenetic assumption that can be biased relative to the unknown true phylogenetic tree.
At the current state of the art, these issues are unavoidable at least in the analysis of large data set, although for small examples it may be feasible to employ methods that concurrently estimate alignments and trees directly from unaligned sequence data [3],[4]. Even in these cases biases from nontreelike evolution and insufficient knowledge remain. This is in particular true for the mechanisms of in/del formation.
It is good practice in phylogenetic studies, therefore, to estimate the reliability of the phylogenetic reconstructions a posteriori. Most commonly, measures such as the bootstrap or jackknife support or parameters such as the consistency index or the retention index, see e.g. [5] are used. The latter estimate the prevalence of homoplastic characters relative to the reconstructed tree.
An alternative approach, which is less frequently employed in phylogenetic studies, is to investigate the data set for its information content and possible source of problems already before even starting to compute trees. In this chapter we briefly review the most promising approaches for a priori quality control, focusing on recent developments.
Measures of treelikeness
Distancebased measures
Tree reconstruction based on uncorrected distances obtained from discrete characters can lead to incorrect trees. Effects such as long branch attraction [6] have long been known and continue to be discussed in the literature, see e.g. [7]. The corresponding distances often deviate from additivity as indicated by conflicting support for alternative trees, and hence indications for misleading signals can be obtained from measures of treelikeness.
A fundamental theorem of mathematical phylogenetics asserts that a metric d on a finite set X of taxa forms an additive tree if and only if every quartet (set of four taxa) has this property [8],[9]. It appears natural, therefore, to use quartets to measure treelikeness of a data set. Among four taxa {A,B,C,D} there are six distances which can be grouped into three pairs: d(A,B)+d(C,D), d(A,C)+d(B,D), and d(A,D)+d(B,C). Ordering these three sums by magnitude, we obtain three parameters L?M?S, from which in turn we derive two split lengths ?=(L?S)/2 and ?=(L?M)/2, see Figure 1A. The quadruple is a tree if and only if L=M, i.e., ?=0.
The basic idea of statistical geometry[11],[12] is to consider quadruples first in terms of distances and then in terms of sequence patterns. Three types of quadruple geometries can be distinguished based on distances alone:

1.
L=M=S. In this case ?=?=0, the quadruple is an ideal bundle.

2.
L=M>S. In this case ?>0 and ?=0 so that the quadruple defines a single split.

3.
L>M>S. In this generic case the data deviate from tree structure.
It can be shown that the ratio ?/? approaches 0.5 for random sequences, i.e., complete loss of phylogenetic signal. Averaging the parameters ? and ? over all quadruples that can be formed from a data set thus provide already a good measure for its treelikeness.
The ?plots[13] build upon statistical geometry and represent the treelikeness ?/? of quartets in terms of a histogram. For an individual taxon a measure for treelikeness can be obtained by considering the treelikeness of all quartets to which it belongs. As suggested e.g. in [13], removing taxa with poor individual treelikeness can result in increased accuracy of tree estimation.
It is important to note that the assessment of distance measures is not necessarily sufficient. Perfectly treelike distances can still support an incorrect tree in realistic examples. Instructive cases are discussed in detail in [14]. A possible source of such biases is in particular the use of an incorrect model for the transformation of character differences to distances. A more detailed picture is obtained when the alignment columns for a sequence quadruple are inspected.
Characterbased methods
Recording for each column of a given alignment of four sequences only which of the sequences have the same character states we distinguish 16 column types that fall into just five classes k: all equal (1), one triple (4), two pairs (3), one pair (6), and all different (1). For alphabets with less than 4 letters not all of these can be realized. Given a model of evolution it is then possible to compute the expected values of the numbers d_{ k } of occurrences of columns of type k, 0?k?4, as a function of the divergence (number of substitution events per site). From these value one can then obtain refined parameters for tree and bundlelikeness, see [11],[12] for more details.
An alternative approach is to interpret the 16 column types as support for one of the three possible unrooted trees. Each quadruple, thus, can be associated with a relative support (p_{1},p_{2},p_{3}) for the three geometries. Properly normalized these values can be plotted in simplicial coordinates, Figure 1B. This idea underlies the Quartet Mapping method [15] and its special case Likelihood Mapping[16], where the values of p_{ i } are computed as maximum likelihood estimates for the probabilities of the three tree topologies. Quartet mapping can also be used to resolve the relationships between four groups A, B, C, and D that are a priori known to be monophyletic. A special case, in which A={x} is just a single sequence is the problem of assigning individual genes to paralog groups. This technique, implemented in the software tool quartmquartm, has been used successfully e.g. to analyze short PCR fragments of homeobox sequences [10],[17],[18]. Figure 1 deliberately shows an example of extremely informationpoor data.
A generalization to five taxa has been attempted more recently [19]. Finding the best planar visualization of the space representing the 15 possible unrooted trees for a given set of input data is a rather difficult optimization problem. PentaPlotPentaPlot[20] uses a genetic algorithm for this purpose.
On a set X of n taxa there are 2^{n?1}?1 distinct splits, i.e., bipartitions of the taxa into exactly two nonempty sets. Weight vectors $\stackrel{?}{q}$ over the set of splits are related to pattern probability vectors $\stackrel{?}{p}$ assigning probabilities to characters by means of the Hadamard transform $\stackrel{?}{p}={\mathbf{H}}^{?1}exp\left[\phantom{\rule{0.3em}{0ex}}\mathbf{H}\stackrel{?}{q}\right]$, where vector exponentiation is interpreted componentwise [21], see [22] for a modern presentation. Intuitively, the Hadamard transformation accounts for multiple state changes of a given character and provides a direct link between observed character states and splits in the underlying data. This connection can be used assess treelikeness of the data by analyzing the splitspectrum. In addition to a support value q_{ s } for a given split an incompatibility score can be defined as the sum of the supports for all splits s that cannot occur together with s in the same tree. This information is conveniently summarized in socalled Lentoplots [23]. SpectronetSpectronet provides an implementation [24]. A related method summarizes the Hadamard weight spectrum into three categories: the splits supporting external and internal branches of the optimal tree as well as the splits contradicting this tree. Plotting the relative weights of these three categories in barycentric coordinates produces a treeness triangle [25], from which deviation from treelikeness can be assessed visually.
Alignment quality
Large evolutionary distances inevitably entail a large number of homoplastic sites. As most proteincoding genes show dramatic variations in substitution rates that are not uncorrelated across the sequence, this often leads to a patchwork pattern of phylogenetically informative and effectively randomized regions. Alignment errors accumulate in highly variable regions and may produce effectively homoplastic sites. Both simulation studies [26] and evaluations of reallife data [27] demonstrated that alignment errors can significantly change the outcome of phylogenetic analyses. There is no consensus in the literature, furthermore, how tolerant phylogenetic methods are to multiple substitutions [28][30].
Consequently, one may try to improve the accuracy of tree reconstruction by eliminating all putative homoplastic or otherwise corrupted sites. A simple approach towards this end is to exclude all thirdcodon positions of proteincoding sequences. Since the quality of tree reconstruction decreases with decreasing sequence length, it is important not to remove too many sites from an alignment, however. For example, while certain first and secondcodon positions may be essentially constant (and therefore phylogenetically useless) or hypervariable (and hence even misleading), thirdcodon positions of proteincoding genes can well be informative and thus they should not be discarded outright [31]. Instead, one would like to distinguish clearly homoplastic or otherwise corrupted sites from putative phylogenetically informative sites so that they and no others can be excluded or downweighted.
The complication with such an endeavor, however, is that, formally, homoplasy is defined relative to a given phylogenetic tree, the very object that molecular phylogenetics is attempting to derive from the alignment. Measures such as the consistency index (the minimum possible number character changes divided by the number of steps observed along the tree) thus cannot be computed prior to estimating the phylogenetic tree itself. Consequently, the a priori is a difficult problem since a useful method has to ensure that its approach to homoplasy detection does not implicitly presuppose a phylogenetic tree later to be derived from the same data.
Historically the first tool for removing suspicious parts of alignments was GblocksGblocks[32],[33], which selects blocks from an input alignment using a set of rules that mimic many researchers strategy in manually pruning alignments. Userdefined parameters set cutoffs so that the retained regions do not contain large segments of contiguous nonconserved positions, are depleted in gap positions, and exhibit high levels of conservation of flanking positions. While intuitively plausible, these rules are not based in some underlying theory. Nevertheless, this approach can lead to better trees, which, surprisingly, often exhibit reduced bootstrap support, indicating that divergent and problematic alignment regions may lead, when present, to apparently better supported although, in fact, more biased topologies [33].
ESTbased phylogenomic studies are in particular plagued by incomplete sequences and thus by missing data in MSAs. This can introduce surprisingly large biases and substantially compromised phylogenetic accuracy [34],[35]. As a remedy, reapreap[34] masks (i) alignment columns containing many gaps and/or highly diverse amino acids and (ii) sequences that either have little overlap with other sequences or appear to be systematically misaligned. The cutoffs used in reapreap were determined empirically to strike the best compromise between topological accuracy and sequence retention [34
Noisy
The noisynoisy[36] method is based on the observation that distances derived from pairwise sequence comparisons give rise to fairly robust circular split systems [37]. Circular splits systems can be represented as a circular ordering of the taxa and are consistent with a large number of possible tree topologies [38],[39], namely all those that can be inscribed in the circularly ordered taxa without crossings of tree edges. The utility of circular orderings computed e.g. by the NeighborNetNeighborNet[40] or QnetQnet[41] algorithms for our purposes is that phylogenetically more closely related taxa are preferentially placed closer together in the cyclic ordering. Conversely, similar trees necessarily correspond to similar cyclic orderings. Thus, if a character, i.e., an alignment column, is phylogenetically useful, its character states will appear clustered along the cyclic ordering underlying any tree that is a reasonable approximation of the true phylogeny, independent of the details of the branching order in individual subtrees. In contrast, if a character is completely randomized, we will observe that character states are randomly arranged along the cycle.
For a given cyclic ordering ?, the amount of clustering in alignment column i is conveniently quantified as the number ?(?,i) of break points, i.e., adjacent distinct character states. For constant alignment columns ?(?,i)=0, for nonconstant sites we have ?(?,i)?2. This number has to be compared with the numbers expected for a random permutation of the letters observed in alignment column i. This background distribution is easily generated by means of shuffling, i.e., by replacing ? with a random permutation ?^{?} drawn from a uniform distribution. We then measure the fraction q(?,i) of sampled random permutations with ?(?^{?},i)>?(?,i). The value of q(?,i) is thus an estimate for the probability that the column i is not randomized. The noisynoisy program removes all alignment columns with q<q
cutoff. It is reassuring to observe that the number of sites that are deemed randomized is minimized by phylogenetically plausible circular orderings ?, Figure 2(A).
Two effects have to be considered. On the one hand, columns with small values of qcontribute little useful information. On the other hand, a large absolute number of informative sites is necessary to obtain reliable trees. Thus q_{cutoff} must not be too large. The most effective values of q_{cutoff} also depend on the tree topology. As shown in Figure 2(B) caterpillar trees admit larger improvements in bootstrap support than the balanced trees.
The analysis of artificial data sets suggests a set of simple rules that allow the user to decide under which conditions it makes sense to use noisynoisy to process MSAs prior to using them for phylogenetic reconstruction:

(1)
If the original alignment already yields trees with very high average bootstrap support, there is nothing to be gained.

(2)
Datasets with less than about 10 taxa are unlikely to improve.

(3)
The best cutoff value for q depends on the tree topology and in particular on the number of taxa. It pays in general to determine the maximum of the gain in some parameter of tree stability as a function of q and to use the corresponding optimal cutoff value.
The current release [42] of noisynoisy can process DNA, RNA, and protein sequences.
Aliscore
In contrast to noisynoisy, aliscorealiscore has been designed to detect random sequence similarity in MSAs based on pairwise similarity profiling of sequences [43],[44]. It is based on the fact that observed sequence motive similarity between a pair of sequences can be distinguished from random similarity by generating a null distribution of random similarity given the motive size and base/aminoacid composition of the sequences. The null distribution is generated by permutations of the original observed sequences generating random similarity. A sliding window is used to generate a profile score of the inferred randomization between pairs of sequences. This can be done with all possible pairwise comparisons within a MSA generating a suite of pairwise profile scores. Finally, these profile scores are used to average over each MSA alignment site in order to generate a consensus profile of sequence similarity within a MSA. This consensus profile informs whether alignment sections contain predominantly random similarity or not, Figure 3. The principle of aliscorealiscore is thus entirely different to sitefocused approaches like noisynoisy, reapreap[34] or gblocksgblocks[32],[33]. For a detailed explanation of the algorithm we refer to [43].
The aliscorealiscore approach has been shown to work well in simulations [43],[44], single gene [45][49] and multigene approaches [50]. However, as for every masking program arbitrary decisions have to be made as well. For example, the sliding window size has to be set by the user. A larger window size makes the algorithm less sensitive to small sections of randomization. A natural minimal window size is 4, below this window size a distinction between random or nonrandom similarity is not possible.
A big advantage of the approach is that single splits can be directly evaluated. aliscorealiscore offers the possibility to define a split in the MSA from which pairwise comparisons are drawn. It thus offers the possibility to generate a consensus profile for just the split under consideration. This tool can become particularly important, if different outgroup taxa are compared with a set of ingroup species. The best outgroup choice is the set of taxa which minimizes the extent of randomization between outgroup and ingroup. The current release of aliscorealiscore can process DNA, RNA, and protein sequences.
Quality of a data matrix: MARE
A typical feature of phylogenomic data is the frequent occurrence of missing data in concatenated supermatrices up to the point where more than 80% of the data are missing [51],[52]. The effect of missing data on tree inference is still unclear and it appears that a general rule can not be derived from several simulation and empirical studies [51],[53],[54]. The takehome message of these studies is that data masking, which can increase data saturation, seems advisable. In its simplest form, we are given a bipartite graph G=(X?Y,E) describing by its edges {x,y}?E which gene x?X is present in which species y?Y. An ideal data set is a maximal biclique, i.e., a maximal complete subgraph of G[55],[56]. Since this would lead to the removal of too many genes and taxa, in a relaxed version, one seeks a quasibiclique[57], requiring that each gene is present at least in a prescribed fraction of taxa, and each taxon is represented by a minimum fraction of genes. It is worth noting that the same problem appears in the analysis of proteinprotein interaction networks and has received considerable attention in this context [58]. Although the maximum vertex biclique problem is solvable in polynomial time [59], many of its variants [60] and in particular the more relevant quasibiclique problems are NPcomplete [58],[61]. Thus exact algorithms are applicable only to to relatively small data. In addition, earlier methods do not consider differences in the information content of taxa and genes, which might be a major drawback.
In simulation studies we were able to show that the likelihood of reconstructing a correct tree dramatically decreases if data saturation is below 30%. Selection of a data subset of less genes and taxa but with higher data saturation can potentially alleviate the problem. However, it seems advisable that during the process of data selection, potential phylogenetic signal of each single gene and taxon should be considered in order not to only maximize data saturation but also information content of the data set. The proposed algorithm implemented in the software package maremare does exactly this, Figure 4. It is designed in a way that (1) the potential information content of genes and taxa is evaluated using geometry mapping [15] and (2) this information is used in combination with information on missing data to select an optimal data subset. The selection of the optimal data subset is based on a simple optimization algorithm in which the reduction of the total data matrix is penalized and the increase in total information content of the matrix favored. The selected optimal data subset corresponds to a quasibiclique with high information content. Simulations show that the chance to reconstruct the correct tree increases tremendously when the raw data are processed in this manner [62]. The current implementation of maremare handles protein sequences only.
Concluding remarks
Although many studies have been directed at a better understanding of artifacts in phylogeny reconstruction such as long branch attraction or homoplasy [7],[63],[64], we still lack a comprehensive understanding of how biases can be recognized in data sets prior to the estimation of a phylogenetic tree. Instead, often time extensive computational resources are expended to reconstruct phylogenies with disappointing results that can be identified only a posteriori as artifacts. It is then problematic at best to distinguish artefactual input data from issues such as inadequate models of evolution.
In this minireview we have briefly discussed first attempts at an a priori assessment of different aspects of data quality that aim at the identification of potentially problematic taxa or characters. It is of utmost importance to ensure that such methods do not make any assumptions on phylogenetic relationships, because such implicit information may then inadvertently be enforced in the “data cleaning” step, and thus transmitted to the phylogenetic reconstruction methods.
Despite very encouraging results obtained with tools such as noisynoisy, aliscorealiscore, and maremare, much additional research focused on dissecting confounding signal will be necessary for a comprehensive understanding of analyses artifacts. NoisyNoisy and aliscorealiscore address the decay of phylogenetic signal induced by multiple saturation, the aliscorealiscore algorithm can deal with heterogeneous composition of nucleotide sequences, and maremare indirectly scores the influence of missing data as well. However, all of these approaches do not directly dissect the separate influence of these confounding factors on tree reconstructions. This must be a focus of future work, because substitutional saturation, heterogeneous sequence composition, nonstationary substitution processes, and the nonrandom distribution of missing data can constitute strong confounding factors, in particular in phylogenomic analyses. It surprising, therefore, that a standard canon of tools to study these effects a priori to tree reconstructions is still missing.
Authors' contributions
BM and PFS wrote the first draft of this review. All authors read and approved the final manuscript.
References
 1.
Just W:Computational complexity of multiple sequence alignment with SPscore. J Comput Biol. 2001, 8: 615623.
 2.
Wang L, Jiang T:On the complexity of multiple sequence alignment. J Comput Biol. 1994, 1: 337348.
 3.
Lunter G, Miklo?s I, Drummond A, Jensen JL, Hein J:Bayesian coestimation of phylogeny and sequence alignment. BMC Bioinformatics. 2005, 6: 83
 4.
Redelings BD, Suchard MA:Joint bayesian estimation of alignment and phylogeny. Syst Biol. 2005, 54: 401418.
 5.
Farris JS:The retention index and the rescaled consistency index. Cladistics. 1989, 5: 417419. 10.1111/j.10960031.1989.tb00573.x.
 6.
Felsenstein J:Cases in which parsimony or compatibility methods will be positively misleading. Syst Zool. 1978, 27: 401410. 10.2307/2412923.
 7.
Telford MJ, Copley RR:Animal phylogeny: fatal attraction. Curr Biol. 2005, 15: 296299. 10.1016/j.cub.2005.04.001.
 8.
SimõesPereira JMS:A note on the tree realizability of a distance matrix. J Combin Theory. 1969, 6: 303310. 10.1016/S00219800(69)80092X.
 9.
Buneman P:A note on the metric property of trees. J Combin Theory Ser B. 1974, 17: 4850. 10.1016/00958956(74)900471.
 10.
Chambers KE, McDaniell R, Raincrow JD, Deshmukh M, Stadler PF, Chiu Ch:Hox cluster duplication in the basal teleost Hiodon alosoides (Osteoglossomorpha). Theory Biosci. 2009, 128: 109120.
 11.
Eigen M, WinklerOswatitsch R, Dress AWM:Statistical geometry in sequence space: a method of quantitative comparative sequence analysis. Proc Natl Acad Sci USA. 1988, 85: 59135917.
 12.
NieseltStruwe K:Graphs in sequence spaces: a review of statistical geometry. Biophys Chem. 1997, 30: 111131. 10.1016/S03014622(97)000641.
 13.
Holland BR, Huber KT, Dress AWM, Moulton V:?plots: A tool for analyzing phylogenetic distance data. Mol Biol Evol. 2002, 19: 20512059.
 14.
Huson D, Steel M:Distances that perfectly mislead. Syst Biol. 2004, 53: 327332.
 15.
NieseltStruwe K, von Haeseler A:Quartetmapping, a generalization of the LikelihoodMapping procedure. Mol Biol Evol. 2001, 18: 12041219.
 16.
Strimmer K, von Haeseler A:Likelihoodmapping: a simple method to visualize phylogenetic content of a sequence alignment. Proc Natl Acad Sci USA. 1997, 94: 68156819.
 17.
Stadler PF, Fried C, Prohaska SJ, Bailey WJ, Misof BY, Ruddle FH, Wagner GP:Evidence for independent Hox gene duplications in the hagfish lineage: A PCRbased gene inventory ofEptatretus stoutii. Mol Phylog Evol. 2004, 32: 686692. 10.1016/j.ympev.2004.03.015.
 18.
Raincrow JD, Dewar K, Stocsits C, Prohaska SJ, Amemiya CT, Stadler PF, Chiu Ch:Hox clusters of the bichir (Actinopterygii,Polypterus senegalus), highlight unique patterns of sequence evolution in gnathostome phylogeny. J Exp Zool. 2011, 316: 451464. 10.1002/jez.b.21420.
 19.
Zhaxybayeva O, Hamel L, Raymond J, Gogarten JP:Visualization of the phylogenetic content of five genomes using dekapentagonal maps. Genome Biol. 2004, 5: 2010.1186/gb200453r20.
 20.
Hamel L, Zhaxybayeva O, Gogarten JP:PentaPlotPentaPlot: A software tool for the illustration of genome mosaicism. BMC Bioinformatics. 2005, 6: 139
 21.
Hendy M, Penny D:A framework for the quantitative study of evolutionary trees. Syst Zool. 1989, 38: 297309. 10.2307/2992396.
 22.
Bryant D:Hadamard phylogenetic methods and thentaxon process. Bull Math Biol. 2009, 71: 339351.
 23.
Lento GM, Hickson RE, Chambers GK, Penny D:Use of spectral analysis to test hypotheses on the origin of pinnipeds. J Mol Biol Evol. 1995, 12: 2852. 10.1093/oxfordjournals.molbev.a040189.
 24.
Huber KT, Langton M, Penny V, Moulton D, Hendy M:Spectronet: a package for computing spectra and median networks. Appl Bioinform. 2002, 1: 20412059.
 25.
White T, Hills SF, Gaddam R, Holland BR, Penny D:Treeness triangles: Visualizing the loss of phylogenetic signal. Mol Biol Evol. 2007, 24: 20292039.
 26.
Ogden TH, Rosenberg M:Multiple sequence alignment accuracy and phylogenetic inference. Syst Biol. 2006, 55: 314328.
 27.
Landan G, Graur D:Heads or tails: a simple reliability check for multiple sequence alignments. Mol Biol Evol. 2007, 24: 13801383.
 28.
Yang Z:On the best evolutionary rate for phylogenetic analysis. Syst Biol. 1998, 47: 125133.
 29.
Wägele JW: Foundations of Phylogenetic Systematics. 2005, Verlag Dr Friedrich Pfeil, Munich, Germany
 30.
Kück P, Mayer C, Wägele JW, Misof B:Long branch effects distort maximum likelihood phylogenies in simulations despite selection of the correct model. PLoS ONE. 2012, 7: 3659310.1371/journal.pone.0036593.
 31.
Björklund M:Are third positions really that bad? a test using vertebrate cytochrome b. Cladistics. 1999, 15: 9197.
 32.
Castresana J:Selection of conserved blocks from multiple alignments for their use in phylogenetic analysis. Mol Biol Evol. 2000, 17: 540552.
 33.
Talavera G, Castresana J:Improvement of phylogenies after removing divergent and ambiguously aligned blocks from protein sequence alignments. Syst Biol. 2007, 56: 564577.
 34.
Hartmann S, Vision TJ:Using ESTs for phylogenomics: Can one accurately infer a phylogenetic tree from a gappy alignment. BMC Evol Biol. 2008, 8: 95
 35.
Roure B, Baurain D, Philippe H:Impact of missing data on phylogenies inferred from empirical phylogenomic data sets. Mol Biol Evol. 2013, 30: 197214.
 36.
Dress AWM, Flamm C, Fritzsch G, Grünewald S, Kruspe M, Prohaska SJ, Stadler PF:Identification of homoplastic characters in multiple sequence alignments. Alg Mol Biol. 2008, 3: 710.1186/1748718837.
 37.
Bandelt HJ, Dress AWM:A canonical decomposition theory for metrics on a finite set. Adv Math. 1992, 92: 47105. 10.1016/00018708(92)90061O.
 38.
Huson DH:SplitsTreeSplitsTree: analyzing and visualizing evolutionary data. Bioinformatics. 1998, 14: 6873.
 39.
Semple C, Steel M:Cyclic permutations and evolutionary trees. Adv Appl Math. 2004, 32: 669680. 10.1016/S01968858(03)000988.
 40.
Bryant D, Moulton V:Neighbornet: An agglomerative method for the construction of phylogenetic networks. Mol Biol Evol. 2004, 21: 255265.
 41.
Grünewald S, Forslund K, Dress AWM, Moulton V:QNet: an agglomerative method for the construction of phylogenetic networks from weighted quartets. Mol Biol Evol. 2007, 24: 532538.
 42.
Dress AWM, Flamm C, Fritzsch G, Grünewald S, Kruspe M, Prohaska SJ, Stadler PF: noisySoftware2011. [], http://www.bioinf.unileipzig.de/Software/noisy/
 43.
Misof B, Misof K:A Monte Carlo approach successfully identifies randomness of multiple sequence alignments: A more objective approach of data exclusion. Syst Biol. 2009, 58: 2134.
 44.
Kück P, Meusemann K, Raupach M, von Reumont B, Wägele W, Misof B:Parametric and nonparametric masking of randomness in sequence alignments can be improved and leads to better resolved trees. Frontiers Zool. 2010, 7: 1010.1186/17429994710.
 45.
von Reumont BM, Meusemann K, Szucsich NU, Dell'Ampio E, Bartel D, Simon S, Letsch HO, Stocsits RR, Luan Y, Wägele JW, Pass G, Hadrys H, Misof B:Can comprehensive background knowledge be incorporated into substitution models to improve phylogenetic analyses? a case study on major arthropod relationships. BMC Evol Biol. 2009, 9: 119
 46.
Wägele JW, Letsch H, KlussmannKolb A, Mayer C, Misof B, Wägele H:Phylogenetic support values are not necessarily informative: the case of the Serialia hypothesis (a mollusk phylogeny). Frontiers Zool. 2009, 6: 1210.1186/17429994612.
 47.
Schwarzer J, Misof B, Tautz D, Schliewen UK:The root of the East African cichlid radiations. BMC Evol Biol. 2009, 9: 186
 48.
Letsch HO, Kück P, Schmidt C, Fleck G, Stocsits RR, Misof B:The impact of rRNA secondary structure consideration in alignment and tree reconstruction: simulated data and a case study on the phylogeny of hexapods. Mol Biol Evol. 2010, 27: 25072521.
 49.
Murienne J, Edgecombe GD, Giribet G:Including secondary structure, fossils and molecular dating in the centipede tree of life. Mol Phylog Evol. 2010, 57: 301313. 10.1016/j.ympev.2010.06.022.
 50.
Meusemann K, von Reumont , Kueck P, Ebersberger I, Strauss S, Walzl M, Pass G, Breuers S, Achter V, Wägele JW, Hadrys H, Burmester T, von Haeseler A, Misof B:A phylogenomic approach to resolve the arthropod tree of life. Mol Biol Evol. 2010, 27: 24512464.
 51.
Sanderson MJ, Driskell AC:The challenge of constructing large phylogenetic trees. Trends Plant Sci. 2003, 8: 374379.
 52.
Driskell AC, Anë C, Burleigh JG, McMahon MM, Meara BC, Sanderson MJ:Prospects for building the tree of life from large sequence databases. Science. 2004, 306: 11721174.
 53.
Wiens JJ:Missing data, incomplete taxa, and phylogenetic accuracy. Syst Biol. 2003, 52: 528538.
 54.
Wiens JJ:Missing data and the design of phylogenetic analyses. J Biomed Inform. 2006, 39: 3442.
 55.
Alexe G, Alexe S, Crama Y, Foldes S, Hammer PL, Simeone B: Consensus algorithms for the generation of all maximal bicliques. DIMACS Technical Reports 200252, Rutgers University, Piscataway, NJ, USA, 2002. [], http://dimacs.rutgers.edu/TechnicalReports/2002.html
 56.
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.
 57.
Yan C, Burleigh JG, Eulenstein O:Identifying optimal incomplete phylogenetic data sets from sequence databases. Mol Phylogenet Evol. 2005, 30: 528535. 10.1016/j.ympev.2005.02.008.
 58.
Liu X, Li J, Wang L:Modeling protein interacting groups by quasibicliques: complexity, algorithm, and application. IEEE/ACM Trans Comput Biol Bioinform. 2010, 7: 354364.
 59.
Yannakakis M:Node deletion problems on bipartite graphs. SIAM J Comput. 1981, 10: 310327. 10.1137/0210022.
 60.
Peeters R:The maximum edge biclique problem is NPcomplete. Discrete Appl Math. 2003, 131: 651654. 10.1016/S0166218X(03)003330.
 61.
Chang WC, Vakati S, Krause R, Eulenstein O:Exploring biological interaction networks with tailored weighted quasibicliques. BMC Bioinformatics 2012. 2012, 13 (S10): 1610.1186/1471210513S10S16.
 62.
Misof B, Meyer B, von Reumont BM, Kück P, Misof K, Meusemann K: Selecting informative subsets of sparse supermatrices increases the chance to find correct trees BMC Bioinformatics. 2013, 14: 348
 63.
Gribaldo S, Philippe H:Ancient phylogenetic relationships. Theor Popul Biol. 2002, 61: 391408.
 64.
Wake DB, Wake MH, Specht CD:Homoplasy: from detecting pattern to determining process and mechanism of evolution. Science. 2011, 331: 10321035.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.
The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
To view a copy of this licence, visit https://creativecommons.org/licenses/by/4.0/.
The Creative Commons Public Domain Dedication waiver (https://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data.
About this article
Cite this article
Misof, B., Meusemann, K., von Reumont, B.M. et al. A priori assessment of data quality in molecular phylogenetics. Algorithms Mol Biol 9, 22 (2014). https://doi.org/10.1186/s1301501400224
Received:
Accepted:
Published:
Keywords
 Phylogenomics
 Treelikeness
 Phylogenetic networks
 Multiple sequence alignments
 Quartets
 Biases