Journal
BIOINFORMATICS
Volume 35, Issue 7, Pages 1151-1158Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/bty767
Keywords
-
Categories
Funding
- Klaus Tschira Stiftung gGmbH in Heidelberg, Germany
Ask authors/readers for more resources
Motivation In most metagenomic sequencing studies, the initial analysis step consists in assessing the evolutionary provenance of the sequences. Phylogenetic (or Evolutionary) Placement methods can be employed to determine the evolutionary position of sequences with respect to a given reference phylogeny. These placement methods do however face certain limitations: The manual selection of reference sequences is labor-intensive; the computational effort to infer reference phylogenies is substantially larger than for methods that rely on sequence similarity; the number of taxa in the reference phylogeny should be small enough to allow for visually inspecting the results. Results We present algorithms to overcome the above limitations. First, we introduce a method to automatically construct representative sequences from databases to infer reference phylogenies. Second, we present an approach for conducting large-scale phylogenetic placements on nested phylogenies. Third, we describe a preprocessing pipeline that allows for handling huge sequence datasets. Our experiments on empirical data show that our methods substantially accelerate the workflow and yield highly accurate placement results. Availability and implementation Freely available under GPLv3 at http://github.com/lczech/gappa. Supplementary information Supplementary data are available at Bioinformatics online.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available