Search bioRxiv⌕ Search

Biology subjects

Wedell, E.

Publications and source records attributed to Wedell, E..

2 recordsLinked to original sources

TIPP3 and TIPP3-fast: Improved Abundance Profiling in Metagenomics

We present TIPP3 and TIPP3-fast, new tools for abundance profiling in metagenomic datasets. Like its predecessor, TIPP2, the TIPP3 pipeline uses a maximum likelihood approach to place reads into labeled taxonomies using marker genes, but it achieves superior accuracy to TIPP2 by enabling the use of much larger taxonomies through improved algorithmic techniques. We show that TIPP3 outperforms leading methods for abundance profiling in two important contexts: when reads come from genomes not already in a public database (i.e., novel genomes) and when reads contain sequencing errors. We also show that TIPP3-fast has slightly lower accuracy than TIPP3, but is still more accurate than other leading methods and uses a small fraction of TIPP3s runtime. Additionally, we highlight the potential benefits of restricting abundance profiling methods to those reads that map to marker genes (i.e., using a filtered marker-gene based analysis), which we show typically improves accuracy. TIPP3 is freely available at https://github.com/c5shen/TIPP3. Author summaryTIPP3 is a new marker gene-based abundance profiling tool that builds on TIPP and TIPP2 with significant enhancements. TIPP3 supports larger reference packages ([~] 55,000 sequences per marker gene) and achieves higher accuracy in abundance profiling, especially with challenging input reads containing sequencing errors or novel genomes. TIPP3 outperforms TIPP2 and other leading methods in profiling accuracy, and its fast version TIPP3-fast is competitive in runtime with the competing methods while being more accurate under challenging conditions. TIPP3 is open-source and available at https://github.com/c5shen/TIPP3.

bioinformatics↗

BATCH-SCAMPP: Scaling phylogenetic placement methods to place many sequences

Phylogenetic placement, the problem of placing sequences into phylogenetic trees, has been limited either by the number of sequences placed in a single run or by the size of the placement tree. The most accurate scalable phylogenetic placement method with respect to the number of query sequences placed, EPA-ng, has a runtime that scales sublinearly to the number of query sequences. However, larger phylogenetic trees cause an increase in EPA-ngs memory usage, limiting the method to placement trees of up to 10,000 sequences. Our recently designed SCAMPP framework has been shown to scale EPA-ng to larger placement trees of up to 200,000 sequences by building a subtree for the placement of each query sequence. The approach of SCAMPP does not take advantage of EPA-ngs parallel efficiency since it only places a single query for each run of EPA-ng. Here we present BATCH-SCAMPP, a new technique that overcomes this barrier and enables EPA-ng and other phylogenetic placement methods to scale to ultra-large backbone trees and many query sequences. BATCH-SCAMPP is freely available at https://github.com/ewedell/BSCAMPP_code.

bioinformatics↗