 Methodology article
 Open Access
 Published:
pplacer: linear time maximumlikelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
BMC Bioinformatics volume 11, Article number: 538 (2010)
Abstract
Background
Likelihoodbased phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihoodbased phylogenetic methods cannot be applied to large volumes of short reads from nextgeneration sequencing due to computational complexity issues and lack of phylogenetic signal. "Phylogenetic placement," where a reference tree is fixed and the unknown query sequences are placed onto the tree via a reference alignment, is a way to bring the inferential power offered by likelihoodbased approaches to large data sets.
Results
This paper introduces pplacer, a software package for phylogenetic placement and subsequent visualization. The algorithm can place twenty thousand short reads on a reference tree of one thousand taxa per hour per processor, has essentially linear time and memory complexity in the number of reference taxa, and is easy to run in parallel. Pplacer features calculation of the posterior probability of a placement on an edge, which is a statistically rigorous way of quantifying uncertainty on an edgebyedge basis. It also can inform the user of the positional uncertainty for query sequences by calculating expected distance between placement locations, which is crucial in the estimation of uncertainty with a wellsampled reference tree. The software provides visualizations using branch thickness and color to represent number of placements and their uncertainty. A simulation study using reads generated from 631 COG alignments shows a high level of accuracy for phylogenetic placement over a wide range of alignment diversity, and the power of edge uncertainty estimates to measure placement confidence.
Conclusions
Pplacer enables efficient phylogenetic placement and subsequent visualization, making likelihoodbased phylogenetics methodology practical for large collections of reads; it is freely available as source code, binaries, and a web service.
Background
Highthroughput pyrosequencing technologies have enabled the widespread use of metagenomics and metatranscriptomics in a variety of fields [1]. This technology has revolutionized the possibilities for unbiased surveys of environmental microbial diversity, ranging from the human gut to the open ocean [2–8]. The trade off for high throughput sequencing is that the resulting sequence reads can be short and come without information on organismal origin or read location within a genome.
The most common way of analyzing a metagenomic data set is to use BLAST [9] to assign a taxonomic name to each query sequence based on "reference" data of known origin. This strategy has its problems: when a query sequence is only distantly related to sequences in the database, BLAST can either err substantially by forcing a query into an alignment with a known sequence, or return an uninformatively broad collection of alignments. Furthermore, similarity statistics such as BLAST Evalues can be difficult to interpret because they are dependent on fragment length and database size. Therefore it can be difficult to know if a given taxonomic assignment is correct unless a very clear "hit" is found.
Numerous tools have appeared that assign taxonomic information to query sequences, overcoming the shortcomings of BLAST. For example, MEGAN (MEtaGenome ANalyzer) [10] implements a commonancestor algorithm on the NCBI taxonomy using BLAST scores. PhyloPythia [11], TACOA [12], and Phymm [13] use composition based methods to assign taxonomic information to metagenomic sequences. Recent tools can work with reads as short as 100 bp.
Phylogeny offers an alternative and complementary means of understanding the evolutionary origin of query sequences. The presence of a query sequence on a certain branch of a tree gives precise information about the evolutionary relationship of that sequence to other sequences in the tree. For example, a query sequence placed deep in the tree can indicate how the query is distantly related to the other sequences in the tree, whereas the corresponding taxonomic name would simply indicate membership in a large taxonomic group. On the other hand, taxonomic names are key to obtaining functional information about organisms, and the most robust and comprehensive means of understanding the provenance of unknown sequences will derive both from taxonomic and phylogenetic sources.
Likelihoodbased phylogenetics, with over 30 years of theoretical and practical development, is a sophisticated tool for the evolutionary analysis of sequence data. It has welldeveloped statistical foundations for inference [14, 15], tests for uncertainty estimation [16], and sophisticated evolutionary models [17, 18]. In contrast to distancebased methods, likelihoodbased methods can use both low and high variation regions of an alignment to provide resolution at different levels of a phylogenetic tree [19].
Traditional likelihoodbased phylogenetics approaches are not always appropriate for analyzing the data from metagenomic and metatranscriptomic studies. The first challenge is that of complexity: the maximum likelihood phylogenetics problem is NPhard [20, 21] and thus maximum likelihood trees cannot be found in a practical amount of time with many taxa. A remarkable amount of progress has been made in approximate acceleration heuristics [22–25], but accurate maximum likelihood inference for hundreds of thousands of taxa remains out of reach.
Second, accurate phylogenetic inference is not possible with fixed length sequences in the limit of a large number of taxa. This can be seen via theory [26], where lower bounds on sequence length can be derived as an increasing function of the number of taxa. It is clear from simulation [27], where one can directly observe the growth of needed sequence length. Such problems can also be observed in real data where insufficient sequence length for a large number of taxa is manifested as a large collection of trees similar in terms of likelihood [28]; statistical tools can aid in the diagnosis of such situations [16].
The lack of signal problem is especially pronounced when using contemporary sequencing methods that produce a large number of short reads. Some methodologies, such as 454 [29], will soon be producing sequence in the 600800 bp range, which is sufficient for classical phylogenetic inference on a moderate number of taxa. However, there is considerable interest in using massively parallel methodologies such as SOLiD and Illumina which produce hundreds of millions of short reads at low cost [30]. Signal problems are further exacerbated by shotgun sequencing methodology where the sequenced position is randomly distributed over a given gene. Applying classical maximumlikelihood phylogeny to a single alignment of shotgun reads together with fulllength reference sequences can lead to artifactual grouping of short reads based on the read position in the alignment; such grouping is not a surprise given that nonsequenced regions are treated as missing data (see, e.g. [19, 31]).
A third problem is deriving meaningful information from large trees. Although significant progress has been made in visualizing trees with thousands of taxa [32, 33], understanding the similarities and differences between such trees is inherently difficult. In a setting with lots of samples, constructing one tree per sample requires comparing trees with disjoint sets of taxa; such comparisons can only be done in terms of tree shape [34]. Alternatively, phylogenetic trees can be constructed on pairs of environments at a time, then comparison software such as UniFrac [35] can be used to derive distances between them, but the lack of a unifying phylogenetic framework hampers the analysis of a large collection of samples. "Phylogenetic placement" has emerged in the last several years as an alternative way to gain an evolutionary understanding of sequence data from a large collection of taxa. The input of a phylogenetic placement algorithm consists of a reference tree, a reference alignment, and a collection of query sequences. The result of a phylogenetic placement algorithm is a collection of assignments of query sequences to the tree, one assignment for each query (or more than one when placement location is uncertain). Phylogenetic placement is a simplified version of phylogenetic tree reconstruction by sequential insertion [36, 37]. It has been gaining in popularity, with recent implementations in 2008 [38, 39], and more efficient implementations in this paper and by Berger and Stamatakis [28]. A recent HIV subtype classification scheme [40] is also a type of phylogenetic placement algorithm that allows the potential for recombination in query sequences.
Phylogenetic placement sidesteps many of the problems associated with applying traditional phylogenetics algorithms to large, environmentallyderived sequence data. Computation is significantly simplified, resulting in algorithms that can place thousands to tens of thousands of query sequences per hour per processor into a reference tree on a thousand taxa. Because computation is performed on each query sequence individually, the calculation can be readily parallelized. The relationships between the query sequences are not investigated, reducing from an exponential to a linear number of phylogenetic hypotheses. Short and/or nonoverlapping query sequences pose less of a problem, as query sequences are compared to the fulllength reference sequences. Visualization of samples and comparison between samples are facilitated by the assumption of a reference tree, that can be drawn in a way which shows the location of reads.
Phylogenetic placement is not a substitute for traditional phylogenetic analysis, but rather an approximate tool when handling a large number of sequences. Importantly, the addition of a taxon x to a phylogenetic data set on taxa S can lead to reevaluation of the phylogenetic tree on S; this is the essence of the taxon sampling debate [41] and has recently been the subject of mathematical investigation [42]. This problem can be mitigated by the judicious selection of reference taxa and the use of wellsupported phylogenetic trees. The error resulting from the assumption of a fixed phylogenetic reference tree will be smaller than that when using an assumed taxonomy such as the commonly used NCBI taxonomy, which forms a reference tree of sorts for a number of popular methods currently in use [10, 43]. Phylogenetic placement, in contrast, is done on a genebygene basis and can thus accommodate the variability in the evolutionary history of different genes, which may include gene duplication, horizontal transfer, and loss.
This paper describes pplacer, software developed to perform phylogenetic placement with linear time and memory complexity in each relevant parameter: number of reference sequences, number of query sequences, and sequence length. Pplacer was developed to be userfriendly, and its design facilitates integration into metagenomic analysis pipelines. It has a number of distinctive features. First, it is unique among phylogenetic placement software in its ability to evaluate the posterior probability of a placement on an edge, which is a statistically rigorous way of quantifying uncertainty on an edgebyedge basis. Second, pplacer enables calculation of the expected distance between placement locations for each query sequence; this development is crucial for uncertainty estimation in regions of the tree consisting of many short branches, where the placement edge may be uncertain although the correct placement region in the tree may be relatively clear. Third, pplacer can display both the number of placements on an edge and the uncertainty of those placements on a single tree (Figure 1). Such visualizations can be used to understand if placement uncertainty is a significant problem for downstream analysis and to identify problematic parts of the tree. Fourth, the pplacer software package includes utilities to ease large scale analysis and sorting of the query alignment based on placement location. These programs are available in GPLv3licensed code and binary form http://matsen.fhcrc.org/pplacer/, which also includes a web portal for running pplacer and for visualizing placement results.
To validate pplacer's phylogenetic placement algorithm we implemented a framework that simulates reads from real alignments and tests pplacer's ability to place the read in the correct location. As described below, a primary focus of this effort is a simulation study of 631 COG alignments, where 10 reads were simulated from each taxon of each alignment, placed on their respective trees, and evaluated for accuracy. These tests confirm both that pplacer places reads accurately and that the posterior probability and the likelihood weight ratio (described below) both do a good job of indicating whether a placement can be trusted or not. We also use these simulations to understand how the distance to sister taxon impacts placement accuracy.
Results
Overview of phylogenetic placement using pplacer
Pplacer places query sequences in a fixed reference phylogeny according to phylogenetic posterior probability and maximum likelihood criteria. In Bayesian mode, pplacer evaluates the posterior probability of a fragment placement on an edge conditioned on the reference tree topology and branch lengths. The posterior probability has a clear statistical interpretation as the probability that the fragment is correctly placed on that edge, assuming the reference tree, the alignment, and the priors on pendant branch length. Because the reference tree is fixed, direct numerical quadrature over the likelihood function can be performed to obtain the posterior probability rather than relying on Markov chain MonteCarlo procedures as is typically done in phylogenetics [44, 45]. In maximum likelihood (ML) mode, pplacer evaluates the "likelihood weight ratio" [39], i.e. the ML likelihood values across all placement locations normalized to sum to one.
Because the reference tree is fixed with respect to topology and branch length, only two tree traversals are needed to precompute all of the information needed from the reference tree. From there all likelihood computation is performed on a collection of threetaxon trees, the number of which is linear in the number of reference taxa. Therefore the fragment placement component of our algorithm has linear time and space complexity in the number of taxa n in the reference tree (Figures 2 and 3). It is also linear in the length of the query sequence, as described in the section on algorithmic internals. Note that the fixing of branch lengths in the reference tree is an approximation that permits the linear time operation in n (typically all branch lengths are reoptimized when modifying the tree).
The pplacer binary is standalone; a single command specifying the reference tree, the reference alignment, a reference statistics file, and the aligned reads suffices to run the core pplacer analysis. Pplacer does not optimize sequence mutation model parameters, and instead obtains those values from PHYML [22] or RAxML [23] statistics output files. When analyzing protein sequences the user can choose between the LG [18] or WAG [46] models, and nucleotide likelihoods are computed via the general time reversible (GTR) model. Rate variation among sites is accomodated by the discrete Γ model [17]. For posterior probability calculation, the user can choose between exponential or uniform pendant branch length priors. Each pplacer run creates a .place file that describes the various placements and their confidence scores; analysis can be done directly on this file, or the user can run it through placeviz, our tool to visualize the fragment placements. The pplacer code is written in the functional/imperative language ocaml[47] using routines from the GNU scientific library (GSL) [48].
To accelerate placements, pplacer implements a twostage search algorithm for query sequences, where a quick first evaluation of the tree is followed by a more detailed search in highscoring parts of the tree. The more detailed second search is directed by pplacer's "baseball" heuristics, which limit the full search in a way that adapts to the difficulty of the optimization problem (described in detail in "Methods"). The balance between speed and accuracy depends on two parameters, which can be appropriately chosen for the problem at hand via pplacer's "fantasy baseball" mode. This feature places a subset of the query sequences and reports the accuracy of the parameter combinations within specified ranges, as well as information concerning runtime for those parameter combinations. The user can then apply these parameter choices for an optimized run of their data.
Quantifying uncertainty in placement location
Pplacer calculates edge uncertainty via posterior probability and the likelihood weight ratio. These methods quantify uncertainty on an edgebyedge basis by comparing the best placement locations on each edge. Such quantities form the basis of an understanding of placement uncertainty.
The Expected Distance between Placement Locations (EDPL) is used to overcome difficulties in distinguishing between local and global uncertainty, which is a complication of relying on confidence scores determined on an edgebyedge basis. This quantity is computed as follows for a given query sequence. Pplacer first determines the topscoring collection of edges; the optimal placement on each edge is assigned a probability defining confidence, which is the likelihood weight ratio (in ML mode) or the posterior probability (in Bayesian mode). The EDPL uncertainty is the weightedaverage distance between those placements (Figure 4), i.e. the sum of the distances between the optimal placements weighted by their probability (4). The EDPL thus uses distances on the tree to distinguish between cases where nearby edges appear equally good, versus cases when a given query sequence does not have a clear position in the tree. These measures of uncertainty can then be viewed with placeviz as described below.
Visualizing placements using placeviz and placement management using placeutil
Our package includes tools to facilitate placement visualization and management: placeviz and placeutil. Placeviz converts the placement files generated by pplacer into tree formats that are viewable by external viewers. The richest visualizations make use of the phyloXML format [49], which can be viewed using the freely available Archaeopteryx [32] Java software. Less informationdense visualizations are also available in the standard "Newick" format [19].
As shown in Figure 1, placeviz extends previous work on visualizations [39], representing placement density (branch thickness) and uncertainty (color) on a single tree. Specifically, it draws the reference tree such that the thickness of the branch is a linear function of the number of placements (this linear function has a nonzero yintercept so that the whole tree is visible); the weighted average EDPL uncertainty for the placements on the tree is expressed as a color gradient from the usual branch length color (white or black by choice) to red, with 100% red representing a userdefined uncertainty maximum. Yellow is used to denote edges whose average EDPL uncertainty is above the given maximum level. An example placeviz visualization can be viewed interactively at http://matsen.fhcrc.org/pplacer/visualization.html.
Placeviz also offers other visualization options, such as individually placing the query sequences on the tree, which is useful for a small number of placements. It also can sort query sequences by their best scoring edge into a .loc.fasta file; inspection can reveal if any specific features of the query sequences lead to placement on one edge or another. This sorting can also group query sequences as potentially coming from similar organisms, even if those query sequences do not overlap.
Placeutil is a utility for combining, splitting apart, and filtering placements, which can be useful when doing large scale analysis. For example, when a collection of query sequences are split apart to run in parallel, their placements can be brought back together using placeutil, while checking that they were run using the same reference tree and model parameters. Conversely, if a number of samples were run together, they can be split apart again using regular expressions on their names. Placements can also be separated by likelihood weight ratio, posterior probability, and EDPL.
A pplacer application: psbA in the Global Ocean Sampling (GOS) database
To demonstrate the use of pplacer for a metagenomic study, we analyzed the psbA and psbD gene for the D1 and D2 subunits of photosystem II in cyanobacterial and eukaryotic chloroplasts [50] from the Global Ocean Sampling (GOS) dataset [4]. The GOS database is the largest publicly available metagenomic database, and has been the subject of numerous studies. We choose the psbA and psbD genes because they are well defined, are found across domains, and can be used to differentiate cyanobacteria from eukaryotic phototrophs in a data set assuming sequence reads are accurately identified [51]. In addition, it has been shown in a number of studies that cyanophage virus genomes contain both psbA and psbD sequences [52–55], and that viruses are the source of a substantial number psbA and psbD sequences in GOS [56, 57]. BLAST searches using either a eukaryotic psbA query or a cyanobacterial psbA query sequence can yield the same collection of reads from GOS with similar Evalues  even very low values on the order of 10^{100}or smaller in some cases (Additional file 1: Table S1). This can make taxonomic assignment even at a high level difficult using BLASTbased comparisons. The use of pplacer on the closely related psbA and psbD genes demonstrates phylogenetic placement on closely related paralogs.
To identify psbA and psbD genes in the GOS dataset, we performed a HMMER [58] search of the GOS dataset using a 836 nucleotide reference alignment containing 270 reference sequences of cyanobacteria, eukaryotic plastids, and virus. The reference alignment included all possible reference sequences for psbA and psbD from published genomes, which is important for confident phylogenetic identification of new clades or strains. A total of 8535 metagenomic sequences were recruited by HMMER with an Evalue cut off of 10^{5}; these were then placed on the reference tree using pplacer (Figures 1 and 5). The expanded region of the trees shown in the figures highlights the Prochlorococcus clade, known to be one of the most abundant phototrophs in the global ocean. There are many sequences placed sister to the sequenced representatives but also many sequences placed at internal nodes, that could represent some as yet unsequenced strain of these cyanobacteria.
Simulation
Simulation experiments were conducted to verify overall accuracy and to determine the relationship between confidence scores and accuracy. The simulation removes one taxon at a time from a given reference tree, simulates fragments from that taxon, then evaluates how accurately the placement method assigns the simulated fragments to their original position. In order to evaluate the accuracy of the placements, a simple topological distance metric is used. We have not simulated homopolymertype errors in the alignments, because such errors should be treated by a preprocessing step and thus are not the domain of a phylogenetic placement algorithm. Furthermore, the emergence of more accurate very high throughput sequencing technology [30] refocuses our attention on the question of speed rather than error problems. Further details are given in the "Methods" section.
A broad simulation analysis of pplacer performance was done using 631 COG [59] alignments. The COG alignments had between 19 and 436 taxa, with a median of 41; they were between 200 and 2050 amino acids in length, with a median of 391 (supplemental Figures S1 and S2). Reference phylogenetic trees were built based on the fulllength gene sequences for each of these genes using PHYML [22] and the LG [18] protein substitution model (LG model chosen based on the evidence presented in the corresponding paper). Each taxon from each gene alignment was eliminated one at a time from the reference set as described in "Methods"; ten reads were simulated from each, leading to a total of 334,670 simulated reads, which were aligned to a hidden Markov model of the reference alignment. As is commonly done when analyzing a metagenome, the reads were filtered by their HMMER Evalue (in this case 10^{5}). Two normal distributions were used for read length: a "long" read simulation with amino acid sequence length of mean 85 and standard deviation of 20, and a "short" read simulation with mean 30 and standard deviation of 7. After the HMMER step, the "long" read simulation placed a total of 285,621 reads, and the "short" one placed a total of 148,969 reads on their respective phylogenetic trees.
The best resulting maximum likelihood placement edge was compared to the placement with the highest posterior probability to determine how well the confidence scores reflect the difference between accurate and inaccurate placements (Tables 1 and 2). Both methods provide similar results, implying that the likelihood weight ratio appears to be a reasonable proxy for the more statistically rigorous posterior probability calculation, although posterior probability does a slightly better job of distinguishing between accurate and inaccurate placements for the short reads. Overall, accuracy is high and there is a strong correlation between likelihood weight ratio, posterior probability, and accuracy. Many of the placements were placed with high confidence score and high accuracy in large and small trees (Figure 6). Reads from more closely related taxa are easier to accurately place than more distantly related taxa (Figure 7), although good placement is achieved even when sequences are only distantly related to the sequences in the reference tree.
Discussion
Likelihoodbased phylogeny is a well developed way to establish the evolutionary relationships between sequences. Phylogenetic placement is a simplified version of likelihoodbased phylogenetic inference that enables rapid placement of numerous short query sequences and sidesteps some of the problems inherent in applying phylogenetics to hundreds of thousands or millions of taxa. Phylogenetic placement is by no means a replacement for classical phylogenetic inference, which should be applied when query sequences are full length and moderate in number.
Phylogenetic placement software sits in a category distinct from taxonomic identification software such as MEGAN [10] or Phymm [13]. First, phylogenetic placement software does not assign names to query sequences, and instead returns an assignment of the query sequences to edges of a phylogenetic tree. Second, phylogenetic placement is designed to work with a single reference phylogenetic tree built on a single alignment. Thus it is well suited for finescale analysis of query sequences to provide detailed comparative and evolutionary information at the single gene level. This poses no problems when looking at a single marker gene such as such as 16 S, but some scripting and automation is necessary when there are many genes of interest. These challenges are somewhat mitigated through program design and pipeline scripts [60], but phylogenetic placement methods may always require more work than general purpose taxonomic classification software.
Phylogenetic placement is also different from packages that construct a phylogenetic tree de novo in order to infer taxonomic identity by clade membership. Such packages, such as CARMA [61] and SAP [43, 62], combine sequence search, alignment, and phylogeny into a complete pipeline to provide taxonomic information for an unknown query sequence. Because different query sequences will have different sets of reference taxa, these methods are not phylogenetic placement algorithms as described above. Also, because they are performing a full phylogenetic tree construction, they either use distancebased methods for faster results [43, 61] or are many orders of magnitude slower than phylogenetic placement methods [62].
Pplacer is not the only software to perform likelihoodbased phylogenetic placement. The first pair of software implementations were the "phylomapping" method of [38], and the first version of the "MLTreeMap" method of [39]. Both methods use a topologically fixed reference tree, and are wrappers around existing phylogenetic implementations: ProtML [63] for phylomapping, and TREEPUZZLE [64] for MLTreeMap. Neither project has resulted in software that is freely available for download (MLTreeMap is available as a web service, but as it is tied to a core set of bacterial genes it is not useful for scientists examining other genes or domains). Also, by using a generalpurpose phylogenetic computing engine, they miss on opportunities to optimize on computation and the resulting algorithm is not linear in the number of reference taxa. Both methods equip placement with a statistically justifiable but nontraditional confidence score: phylomapping adapts the RELL bootstrap [65] to their setting, and MLTreeMap uses the "expected maximum likelihood weight ratio," which has been discussed in [66]. AMPHORA also uses a hybrid parsimony and neighborjoining strategy to place query sequences in a fixed reference tree [67].
The only other software at present that performs likelihoodbased phylogenetic placement at speeds comparable of pplacer is the independentlydeveloped "evolutionary placement algorithm" (EPA) [28] available as an option to RAxML [23]. Pplacer and the EPA both cache likelihood information on the tree to accelerate placement, and both use twostage algorithms to quickly place many sequences. The two packages use different acceleration heuristics, but only pplacer offers guidance on parameter choices to use for those heuristics via its "fantasy baseball" feature as described below in the section on algorithmic internals. The EPA allows for one parameter more flexibility than pplacer for branch length optimization, and can perform placement on partitioned datasets and inference on binary, RNA secondary structure, and multistate data. The EPA offers singleprocess parallelization [68] (note both the EPA and pplacer can easily be run in parallel as multiple processes). The EPA leverages the efficient memory representation of RAxML, such that an equivalent run using the Gamma model of rate variation will use half the memory of pplacer, and a run using the CAT approximation will require one eighth of the memory. The EPA comes without a visualization tool such as placeviz, although it can be visualized if run on their webserver, or within the new MLTreeMap suite of Perl scripts for visualization [60].
We have compared the performance of EPA and pplacer in a study designed jointly by ourselves and the authors of [28]. Pplacer and the EPA showed comparable speed in placing metagenomic reads on reference trees of different sizes (Figure 8). For accuracy, we simulated from the 16 s alignments used for accuracy evaluation in [28]. As in their paper, we simulated nucleotide reads of normally distributed length with mean 200 and standard deviation 60. The error was evaluated using the same topological error metric in two ways: first, the error of the placement with the highest likelihood (Figure 9), and second, the total error weighted by the normalized likelhood weights (Figure 10). Each program was run with the fourcategory gamma model of rate heterogeneity. There was no clear difference in accuracy between EPA and pplacer for these alignments with either of these ways of evaluating the error. This is despite the fact that the "correct" placement was chosen to be that assigned by the EPA with the full length sequence.
In contrast to the EPA, pplacer placements all sit on a single reference tree with its associated branch lengths fixed. Thus it is easy to compare the relative location of placements, and to consider all placements on a single tree. Placement locations along a branch are useful in cases such as classification, where a placement close to the root of a clade may be assigned membership to that clade, whereas placements in the middle of the same edge may not. The EPA, on the other hand, optimizes the length of the branch of the reference tree as well as the placement location along that branch; thus each placement is done onto a slightly different reference tree. Presumably because the placement location does not happen on a single reference tree, the placement location is not reported by the program and this information is lost [28].
We did not compare the RAxML parsimony insertions wrapped by AMPHORA to these likelihood placements, because we would be scoring a parsimony insertion algorithm according to the original positions in a maximumlikelihood tree. The difference between these optimality criteria would naturally lead to some differences, which would be viewed by the scoring metric as error. The innovative bootstrapbased taxonomic assignment procedure in the AMPHORA package produces a name rather than a phylogenetic placement, and thus cannot be directly compared to the output of pplacer.
Conclusions
Pplacer enables efficient maximum likelihood and posterior probability phylogenetic placement of reads, making likelihoodbased phylogenetics methodology practical for largescale metagenomic or 16 S survey data. Pplacer can be used whenever a reference alignment and phylogenetic tree is available, and is designed for ease of use for both singlerun and pipelined applications. "Baseball" heuristics adapt to the difficulty of the phylogenetic placement problem at hand, and come with features which guide the user to an appropriate set of parameter choices. The EDPL metric helps users decide if edge uncertainty is a substantial problem for downstream analysis. Pplacer offers tightly integrated yet flexible visualization tools which can be used to view both the placements and their uncertainty on a single tree. Largescale simulations confirmed the accuracy of the pplacer results and the descriptive ability of the confidence scores. Pplacer is freely available, comes with a complete manual and tutorials, and can be used via a web service.
Pplacer forms the core of a body of work we are developing to facilitate and extend the utility of phylogenetic placement methodology. We have shown recently [69] that phylogenetic placements (and uncertainty measurements thereof) fit perfectly into a statistical framework generalizing weighted UniFrac [70] allowing for statistical comparison and visualization of differences between samples. In collaboration with another group, we have also implemented a preliminary version of software which automates the selection of appropriate reference sequences, as well as the assignment of taxonomic names based on phylogenetic placements.
Methods
Pplacer algorithmic internals
Here we survey pplacer algorithmic developments. The code implementing these algorithms is freely available on the github code repository [71]. The basic development that permits linear time and space scaling in the size of the reference tree is that of precalculation of likelihood vectors at either end of each edge of the reference tree; this development is shared by the EPA and SCUEAL [40] and the original idea goes back much earlier. Using these cached likelihood vectors, a naive algorithm might insert the query sequence into each edge of the tree and perform full branch length optimization using the cached likelihood vectors. However, a substantial speed improvement can be gained by performing a twostage algorithm, where the first stage does a quick initial evaluation to find a good set of locations, and the second stage does a more detailed evaluation of the results from the first stage.
Pplacer's "baseball" heuristics limit the full search on the tree in a way that adapts to the difficulty of the optimization problem. The first stage is enabled by calculating likelihood vectors for the center of each edge; these vectors can be used to quickly sort the edges in approximate order of fit for a given query sequence. This edge ordering will be called the "batting order." The edges are evaluated in the batting order with full branch length optimization, stopping as follows. Start with the edge that looks best from the initial evaluation; let L be the log likelihood of the branchlengthoptimized ML attachment to that edge. Fix some positive number D, called the "strike box." We proceed down the list in order until we encounter the first placement that has log likelihood less than L  D, which is called a "strike." Continue, allowing some number of strikes, until we stop doing detailed evaluation of what are most likely rather poor parts of the tree. An option restricts the total number of "pitches," i.e. full branch length optimizations.
The baseball heuristics allow the algorithm to adapt to the likelihood surface present in the tree; its behavior is controlled by parameters that can be chosen using pplacer's "fantasy baseball" feature. This option allows automated testing of various parameter combinations for the baseball heuristics. Namely, it evaluates a large fixed number of placements, and records what the results would have been if various settings for the number of allowed strikes and the strike box were chosen. It records both the number of full evaluations that were done (which is essentially linearly proportional to the run time) and statistics that record if the optimal placement would have been found with those settings, and how good the best found with those settings is compared to the optimal placement.
Placement speed can also be accelerated by using information gained about the placement of a given query sequence to aid in placement of closely related query sequences. Before placement begins, pairwise sequence comparisons are done, first in terms of number of mismatches and second in terms of number of matches to gaps. Specifically, each sequence s_{ i } is compared to previous sequences in order; the sequence s_{ j } that is most closely related to s_{ i } with j < i is found and assigned as s_{ i } 's "friend." If no sequence is above a certain threshold of similarity then no friend is assigned. If s_{ i } and s_{ j } are identical, then s_{ j } 's placement is used for s_{ i } . If they are similar but not identical, the branch lengths for s_{ j } are used as starting values for the branch length optimization of s_{ i } . This scheme is not a heuristic, but rather an exact way to accelerate the optimization process. On the other hand, such comparison is inherently an O(n^{2} ) operation and thus may slow placement down given more than tens of thousands of query sequences. In such a case the user may choose to forgo the friend finding process.
Pplacer's speed is also linearly proportional to the lengths of the query sequences, which is enabled because the reference tree is fixed with respect to topology and branch length. Specifically, as described below, likelihood computations are performed such that the sites without a known state (gaps or missing sites) cancel out of the computation of likelihood weight or posterior probability. These sites are masked out of pplacer's computation and thus do not compute to runtime.
Because of the extensive memory caching to accelerate placement, pplacer consumes a nontrivial amount of memory. The fixed contributions to memory use break down as follows: a factor of two for quick and full evaluation of placements, two nodes on each edge, four rate variation categories, four bytes per double precision floating point number, and four (nucleotide) or 20 (amino acid) states. To get a lower bound for total memory use, multiply this number, which is 128 bytes (nucleotide) or 640 bytes (amino acid), with two times the number of reference sequences minus three (the number of edges), times the number of columns in the reference alignment. Other data structures add on top of that (Figure 3).
Likelihood weight ratio, posterior probability, and EDPL
Posterior probability is calculated by first integrating out the possible attachment locations and branch lengths against a prior distribution of pendant branch lengths. Let ℓ_{ i } denote an edge of the reference tree, A_{ i } the length of that edge, a the attachment location along ℓ_{ i } , b the pendant branch length, ℒ the phylogenetic likelihood function (e.g. equation 16.9 of [19]), D the alignment, T_{ref} the reference phylogenetic tree, and P the prior probability of a pendant branch length. We obtain the Bayes marginal likelihood by direct twodimensional numerical integration:
The posterior probability can then be obtained by taking a ratio of these marginal likelihoods (summation is over branches j of the tree):
The likelihood weight ratio is defined corresponding ratio with marginal likelihood replaced by the ML likelihood:
where ℒ_{ML} is the maximal likelihood obtained by maximizing ℒ(DT_{ref} , ℓ_{ i }, a, b) with respect to branch length parameters a and b. The expected (under bootstrap replicates) likelihood weight ratio is the confidence score used in [39]. Some justification for using likelihood weight ratios is given in [66].
The expected distance between placement locations (EDPL) is a simple summation given probabilities from likelihood weight distributions or posterior probabilities. Let p_{ i } = ℙ(ℓ_{ i } T_{ref}, D) from either (2) or (3), let d_{ ij } denote the tree distance between the optimal attachment positions on edges ℓ_{ i } and ℓ_{ j } , and let L denote the total tree length. Then the EDPL is simply
An extension of these ideas would be to integrate the marginal likelihoods over the potential attachment positions on the edges of interest; we have not pursued such a calculation.
Simulation design and error metric
The simulation procedure for a single gene is as follows. Begin with an alignment A of fulllength sequences for the gene of interest, along with a phylogeny T derived from that alignment. T is assumed to be correct.
Simulated fragments from a given taxon X are replaced in the phylogenetic tree, and their location relative to X's original location is determined. The simulation pipeline repeats the following steps for every taxon X in the alignment A.

1.
remove X from the reference alignment, making an alignment A_{ X } .

2.
build a profile HMM out of A_{ X } .

3.
cut X and its pendant branch out of the tree T, suppressing the resultant degreetwo internal node. Reestimate branch lengths using A_{ X } , and call the resulting tree T_{ X } .

4.
simulate fragments from the unaligned sequence of X by taking sequences of normallydistributed length and uniformlydistributed position.

5.
align these simulated fragments using the profile HMM built from A_{ X } .

6.
place the simulated fragments in T_{ X } with respect to the reference alignment A_{ X } .

7.
compare the resulting placements to the location of X in T using our error metric described below.
Note that only branch lengths are reestimated; if we estimated T_{ X } de novo from A_{ X } then we would not be able to compare the placements to the taxon locations in T.
In order to evaluate the accuracy of the placements, a simple topological distance metric is used. To calculate this metric for the placement of a taxon X, highlight both the edge of T_{ X } corresponding to the correct placement and the edge of T_{ X } corresponding to the actual placement of the simulated fragment. The error metric then is the number of internal nodes between the two highlighted edges. Thus, if the fragment is placed in the correct position, then error is zero, and if it is placed sister to the correct position, then the error is one, and so on. This error metric is also used in [28].
Alignments and Reference Trees
Data for the analysis of speed and memory use was drawn from [72]. The data came partitioned into two files, the smaller of which was used for the reference set. Sequences with at least 1200 nongap characters were selected from the reference set and the sequence order was randomized. Reference trees were built on the first 200, 400, ..., 1600 sequences, and the other file was used as the query set.
The EPA to pplacer accuracy comparison was done using the simulation framework from [28]. The same taxa were used to generate simulated nucleotide fragments, which had normally distributed length with mean 200 and standard deviation 60. These were aligned to the reference alignments using HMMER. Reference tree branch lengths were reestimated using RAxML after deletion of the taxon used for simulation. The standard version of the EPA reroots the tree at an arbitrary location; Alexandros Stamatakis modified the code for this comparison so that the tree is rerooted at the lexicographically (i.e. alphabetically) smallest node, and branch order resorted similarly. Because of this rerooting and resorting, the error could not be judged directly from the reference tree, and so the correct placement was assumed to be that chosen by the EPA with a fulllength sequence. Simulation data can be downloaded from http://matsen.fhcrc.org/pplacer/data/10_EPA_comparison.tar.gz
Alignments for the COG simulation were downloaded from the COG website [59]. The alignments were screened for completeness and taxa with incomplete sequences were removed. Alignment ends were trimmed to eliminate excessive gaps on either end. For the GOS psbA analysis, the  All_Metagenomic_Reads and All_Assembled_Sequences  were downloaded to a local computer cluster from CAMERA [73]. A psbA and psbD reference alignment was made of eukaryotic plastid sequences using sequences retrieved from Genbank and then included all cyanobacteria with an HMM search of a local copy of microbial refseq (from Genbank); alignment of was done using Geneious alignment [74] and was hand edited.
References
 1.
Margulies M, Egholm M, Altman W, Attiya S, Bader J, Bemben L, Berka J, Braverman M, Chen Y, Chen Z, et al.: Genome sequencing in microfabricated highdensity picolitre reactors. Nature 2005, 437: 376–380.
 2.
Culley A, Lang A, Suttle C: Metagenomic analysis of coastal RNA virus communities. Science 2006, 312(5781):1795–1798. 10.1126/science.1127404
 3.
Gill S, Pop M, DeBoy R, Eckburg P, Turnbaugh P, Samuel B, Gordon J, Relman D, FraserLiggett C, Nelson K: Metagenomic analysis of the human distal gut microbiome. Science 2006, 312(5778):1355–1359. 10.1126/science.1124234
 4.
Venter J, Remington K, Heidelberg J, Halpern A, Rusch D, Eisen J, Wu D, Paulsen I, Nelson K, Nelson W, et al.: Environmental genome shotgun sequencing of the Sargasso Sea. Science 2004, 304(5667):66–74. 10.1126/science.1093857
 5.
Tringe S, Rubin E: Metagenomics: DNA sequencing of environmental samples. Nat Rev Genet 2005, 6(11):805–814. 10.1038/nrg1709
 6.
Martín H, Ivanova N, Kunin V, Warnecke F, Barry K, McHardy A, Yeates C, He S, Salamov A, Szeto E, et al.: Metagenomic analysis of two enhanced biological phosphorus removal (EBPR) sludge communities. Nat Biotech 2006, 24: 1263–1269. 10.1038/nbt1247
 7.
Warnecke F, Luginbühl P, Ivanova N, Ghassemian M, Richardson T, Stege J, Cayouette M, McHardy A, Djordjevic G, Aboushadi N, et al.: Metagenomic and functional analysis of hindgut microbiota of a woodfeeding higher termite. Nature 2007, 450(7169):560–565. 10.1038/nature06269
 8.
Baker B, Banfield J: Microbial communities in acid mine drainage. FEMS Microbiol Ecol 2003, 44(2):139–152. 10.1016/S01686496(03)00028X
 9.
Altschul S, Gish W, Miller W, Myers E, Lipman D: Basic local alignment search tool. J Mol Biol 1990, 215(3):403–410.
 10.
Huson D, Auch A, Qi J, Schuster S: MEGAN analysis of metagenomic data. Genome Res 2007, 17(3):377. 10.1101/gr.5969107
 11.
McHardy A, Martín H, Tsirigos A, Hugenholtz P, Rigoutsos I: Accurate phylogenetic classification of variablelength DNA fragments. Nature Methods 2007, 4: 63–72. 10.1038/nmeth976
 12.
Diaz N, Krause L, Goesmann A, Niehaus K, Nattkemper T: TACOATaxonomic classification of environmental genomic fragments using a kernelized nearest neighbor approach. BMC Bioinfo 2009, 10: 56. 10.1186/147121051056
 13.
Brady A, Salzberg S: Phymm and PhymmBL: metagenomic phylogenetic classification with interpolated Markov models. Nature Methods 2009, 6(9):673–676. 10.1038/nmeth.1358
 14.
Allman E, Rhodes J: The identifability of tree topology for phylogenetic models, including covarion and mixture models. J Comput Biol 2006, 13(5):1101–1113. 10.1089/cmb.2006.13.1101
 15.
Allman E, Rhodes J: Identifying evolutionary trees and substitution parameters for the general Markov model with invariable sites. Math Biosci 2008, 211: 18–33. 10.1016/j.mbs.2007.09.001
 16.
Shimodaira H, Hasegawa M: Multiple comparisons of loglikelihoods with applications to phylogenetic inference. Mol Biol Evol 1999, 16: 1114–1116.
 17.
Yang Z: Maximum likelihood phylogenetic estimation from DNA sequences with variable rates over sites: approximate methods. J Mol Evol 1994, 39(3):306–314. 10.1007/BF00160154
 18.
Le S, Gascuel O: An improved general amino acid replacement matrix. Mol Biol Evol 2008, 25(7):1307. 10.1093/molbev/msn067
 19.
Felsenstein J: Inferring Phylogenies. 2004.
 20.
Chor B, Tuller T: Finding a maximum likelihood tree is hard. J ACM 2006, 53(5):744. 10.1145/1183907.1183909
 21.
Roch S: A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. IEEE/ACM TCBB 2006, 92–94.
 22.
Guindon S, Gascuel O: A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Sys Biol 2003, 696–704. 10.1080/10635150390235520
 23.
Stamatakis A: RAxMLVIHPC: maximum likelihoodbased phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics 2006, 22(21):2688. 10.1093/bioinformatics/btl446
 24.
Zwickl D: Genetic algorithm approaches for the phylogenetic analysis of large biological sequence datasets under the maximum likelihood criterion. PhD thesis. The University of Texas at Austin; 2006.
 25.
Price MN, Dehal PS, Arkin AP: FastTree 2: Approximately MaximumLikelihood Trees for Large Alignments. PLoS ONE 2010, 5(3):e9490. 10.1371/journal.pone.0009490
 26.
Steel M, Székely L: Inverting random functions II: Explicit bounds for discrete maximum likelihood estimation, with applications. SIAM J Discrete Math 2002, 15(4):562–578. 10.1137/S089548010138790X
 27.
Moret B, Roshan U, Warnow T: Sequencelength requirements for phylogenetic methods. Lecture Notes in Computer Science 2002, 343–356. full_text
 28.
Berger S, Stamatakis A: Evolutionary Placement of Short Sequence Reads. Submitted to Sys Biol 2009. [http://arxiv.org/abs/0911.2852]
 29.
Margulies M, Egholm M, Altman W, Attiya S, Bader J, Bemben L, Berka J, Braverman M, Chen Y, Chen Z, et al.: Genome sequencing in open microfabricated high density picoliter reactors. Nature 2005, 437(7057):376.
 30.
Mardis E: Nextgeneration DNA sequencing methods. Ann Rev Genomics Human Genet 2008, 9: 387. 10.1146/annurev.genom.9.081307.164359
 31.
Lemmon A, Brown J, StangerHall K, Lemmon E: The Effect of Ambiguous Data on Phylogenetic Estimates Obtained by Maximum Likelihood and Bayesian Inference. Syst Biol 2009, 58: 130. 10.1093/sysbio/syp017
 32.
Archaeopteryx[http://www.phylosoft.org/archaeopteryx/]
 33.
Dendroscope[http://wwwab.informatik.unituebingen.de/software/dendroscope]
 34.
Mooers A, Heard S: Evolutionary process from phylogenetic tree shape. Q Rev Biol 1997, 72: 31–54. 10.1086/419657
 35.
Lozupone C, Knight R: UniFrac: a new phylogenetic method for comparing microbial communities. Appl Enviro Microbiol 2005, 71(12):8228. 10.1128/AEM.71.12.82288235.2005
 36.
Kluge A, Farris J: Quantitative phyletics and the evolution of anurans. Syst Zool 1969, 1–32. 10.2307/2412407
 37.
Felsenstein J: Evolutionary trees from DNA sequences: a maximum likelihood approach. J Mol Evol 1981, 17(6):368–376. 10.1007/BF01734359
 38.
Monier A, Claverie J, Ogata H: Taxonomic distribution of large DNA viruses in the sea. Genome Biol 2008, 9(7):R106. 10.1186/gb200897r106
 39.
Von Mering C, Hugenholtz P, Raes J, Tringe S, Doerks T, Jensen L, Ward N, Bork P: Quantitative phylogenetic assessment of microbial communities in diverse environments. Science 2007, 315(5815):1126. 10.1126/science.1133420
 40.
Kosakovsky P, Posada D, Stawiski E, Chappey C, Poon A, Hughes G, Fearnhill E, Gravenor M, Leigh B, Frost S: An evolutionary modelbased algorithm for accurate phylogenetic breakpoint mapping and subtype prediction in HIV1. PLoS Comp Biol 2009, 5(11):e1000581. 10.1371/journal.pcbi.1000581
 41.
Zwickl D, Hillis D: Increased taxon sampling greatly reduces phylogenetic error. Sys Biol 2002, 51(4):588. 10.1080/10635150290102339
 42.
Cueto M, Matsen F: The polyhedral geometry of phylogenetic rogue taxa. In press Bull Math Biol 2010. [http://arxiv.org/abs/1001.5241]
 43.
Munch K, Boomsma W, Willerslev E, Nielsen R: Fast phylogenetic DNA barcoding. Phil Trans Royal Soc B 2008, 363(1512):3997–4002. 10.1098/rstb.2008.0169
 44.
Drummond A, Rambaut A: BEAST v1.0.2003. [http://beast.bio.ed.ac.uk/]
 45.
Huelsenbeck JP, Ronquist F: MRBAYES: Bayesian inference of phylogeny. Bioinformatics 2001, 17: 754–755. 10.1093/bioinformatics/17.8.754
 46.
Whelan S, Goldman N: A general empirical model of protein evolution derived from multiple protein families using a maximumlikelihood approach. Mol Biol Evol 2001, 18(5):691–699.
 47.
Objective Caml[http://caml.inria.fr/ocaml/index.en.html]
 48.
The GNU scientific library[http://www.gnu.org/software/gsl/]
 49.
Han M, Zmasek C: phyloXML: XML for evolutionary biology and comparative genomics. BMC Bioinfo 2009, 10: 356. 10.1186/1471210510356
 50.
Zurawski G, Bohnert H, Whitfeld P, Bottomley W: Nucleotide sequence of the gene for the Mr 32,000 thylakoid membrane protein from Spinacia oleracea and Nicotiana debneyi predicts a totally conserved primary translation product of Mr 38,950. Proc Nat Acad Sci 1982, 79(24):7699–7703. 10.1073/pnas.79.24.7699
 51.
Zeidner G, Preston C, Delong E, Massana R, Post A, Scanlan D, Beja O: Molecular diversity among marine picophytoplankton as revealed by psbA analyses. Environ Microbiol 2003, 5(3):212. 10.1046/j.14622920.2003.00403.x
 52.
Sullivan M, Lindell D, Lee J, Thompson L, Bielawski J, Chisholm S: Prevalence and evolution of core photosystem II genes in marine cyanobacterial viruses and their hosts. PLoS Biol 2006, 4(8):e234. 10.1371/journal.pbio.0040234
 53.
Millard A, Clokie M, Shub D, Mann N: Genetic organization of the psbAD region in phages infecting marine Synechococcus strains. PNAS 2004, 101(30):11007. 10.1073/pnas.0401478101
 54.
Lindell D, Jaffe J, Coleman M, Futschik M, Axmann I, Rector T, Kettler G, Sullivan M, Steen R, Hess W, et al.: Genomewide expression dynamics of a marine virus and host reveal features of coevolution. Nature 2007, 449(7158):83–86. 10.1038/nature06130
 55.
Chenard C, Suttle C: Phylogenetic diversity of sequences of cyanophage photosynthetic gene psbA in marine and freshwaters. Appl Enviro Microbiol 2008, 74(17):5317. 10.1128/AEM.0248007
 56.
Williamson S, Rusch D, Yooseph S, Halpern A, Heidelberg K, Glass J, AndrewsPfannkoch C, Fadrosh D, Miller C, Sutton G, et al.: The Sorcerer II Global Ocean Sampling Expedition: metagenomic characterization of viruses within aquatic microbial samples. PLoS ONE 2008, 3(1):e1456. 10.1371/journal.pone.0001456
 57.
Sharon I, Tzahor S, Williamson S, Shmoish M, ManAharonovich D, Rusch D, Yooseph S, Zeidner G, Golden S, Mackey S, et al.: Viral photosynthetic reaction center genes and transcripts in the marine environment. The ISME Journal 2007, 1(6):492–501. 10.1038/ismej.2007.67
 58.
Eddy S: Profile hidden Markov models. Bioinformatics 1998, 14(9):755–763. 10.1093/bioinformatics/14.9.755
 59.
Tatusov R, Galperin M, Natale D, Koonin E: The COG database: a tool for genomescale analysis of protein functions and evolution. Nucleic Acids Res 2000, 28: 33. 10.1093/nar/28.1.33
 60.
Stark M, Berger S, Stamatakis A, von Mering C: MLTreeMap accurate Maximum Likelihood placement of environmental DNA sequences into taxonomic and functional reference phylogenies. BMC Genomics 2010, 11: 461. 10.1186/1471216411461
 61.
Krause L, Diaz N, Goesmann A, Kelley S, Nattkemper T, Rohwer F, Edwards R, Stoye J: Phylogenetic classification of short environmental DNA fragments. Nucleic Acids Res 2008.
 62.
Munch K, Boomsma W, Huelsenbeck J, Willerslev E, Nielsen R: Statistical Assignment of DNA Sequences Using Bayesian Phylogenetics. Sys Biol 2008, 57(5):750–757. 10.1080/10635150802422316
 63.
Felsenstein J: PHYLIP (Phylogeny Inference Package) version 3.6. In Distributed by the author. Department of Genome Sciences, University of Washington, Seattle; 2004.
 64.
Schmidt H, Strimmer K, Vingron M, von Haeseler A: TREEPUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics 2002, 18(3):502–504. 10.1093/bioinformatics/18.3.502
 65.
Kishino H, Miyata T, Hasegawa M: Maximum likelihood inference of protein phylogeny and the origin of chloroplasts. J Mol Evol 1990, 31(2):151–160. 10.1007/BF02109483
 66.
Strimmer K, Rambaut A: Inferring confidence sets of possibly misspecified gene trees. Proc Royal Soc B 2002, 269(1487):137–142. 10.1098/rspb.2001.1862
 67.
Wu M, Eisen J: A simple, fast, and accurate method of phylogenomic inference. Genome Biol 2008, 9(10):R151. 10.1186/gb2008910r151
 68.
Stamatakis A, Komornik Z, Berger S: Evolutionary placement of short sequence reads on multicore architectures. Proceedings of AICCSA10, at 8th ACS/IEEE International Conference on Computer Systems and Applications (AICCSA10), Hammamet, Tunisia 2010.
 69.
Evans S, Matsen F: The phylogenetic KantorovichRubinstein metric for environmental sequence samples. submitted to JRSS B 2010. [http://arxiv.org/abs/1005.1699v2]
 70.
Lozupone C, Hamady M, Kelley S, Knight R: Quantitative and qualitative {beta} diversity measures lead to different insights into factors that structure microbial communities. Appl Environ Microbiol 2007, 73(5):1576. 10.1128/AEM.0199606
 71.
Pplacer Github repository[http://github.com/matsen/pplacer]
 72.
Turnbaugh P, Hamady M, Yatsunenko T, Cantarel B, Duncan A, Ley R, Sogin M, Jones W, Roe B, Affourtit J, et al.: A core gut microbiome in obese and lean twins. Nature 2008, 457(7228):480–484. 10.1038/nature07540
 73.
CAMERA  Community Cyberinfrastructure for Advanced Marine Microbial Ecology Research and Analysis[http://camera.calit2.net/]
 74.
Drummond A, Ashton B, Cheung M, et al.: Geneious Version 3.5. 2007.
 75.
 76.
Stamatakis A: Phylogenetic models of rate heterogeneity: a high performance computing perspective. Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International 2006, 8.
Acknowledgements
Jonathan Eisen, Steve Evans, John Huelsenbeck and Rasmus Nielsen made helpful suggestions concerning phylogenetics, while Robert Bradley, Ruchira Datta, and Sean Eddy helped with the use of profile HMMs in this context. We thank the Center for Environmental Genomics at the University of Washington, in particular Chris Berthiaume and David Schruth, for computational assistance. David Schruth, Adrian Marchetti and Alexandros Stamatakis provided helpful suggestions on the manuscript. Simon Berger and Alexandros Stamatakis generously helped with simulation design and running of the EPA algorithm. FAM is especially grateful to Andrés Varón and Ward Wheeler, who made a number of suggestions which greatly improved the pplacer code. The following individuals from the ocaml listserv made helpful suggestions: Will M. Farr, Mauricio Fernandez, Stéphane Glondu, Jon D. Harrop, Xavier Leroy, Mike Lin, and Markus Mottl. FAM was supported by the Miller Institute for Basic Research at the University of California, Berkeley while doing this work. RBK is supported by the University of Washington Friday Harbor Laboratories. EVA is supported through a Gordon and Betty Moore Foundation Marine Microbiology Investigator award.
Author information
Additional information
Authors' contributions
FAM and RBK conceived of and developed the project. FAM did the coding, scripting, and simulation data analysis. RBK made and edited alignments and reference trees. FAM, RBK, and EVA analyzed the results and wrote the manuscript. All authors have 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
Received
Accepted
Published
DOI
Keywords
 Posterior Probability
 Branch Length
 Query Sequence
 Confidence Score
 Reference Tree