Loading metrics Open Access Peer-reviewed Research Article Citation: Shen C, Wedell E, Pop M, Warnow T (2025) TIPP3 and TIPP3-fast: Improved abundance profiling in metagenomics. PLoS Comput Biol 21(4): e1012593. https://doi.org/10.1371/journal.pcbi.1012593 Editor: Shanfeng Zhu, Fudan University, CHINA Received: October 25, 2024; Accepted: February 26, 2025; Published: April 4, 2025 Copyright: © 2025 Shen et al.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Tandy Warnow
BATCH-SCAMPP: Batch Scaled Phylogenetic Placement Large Trees
Abstract 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.
TIPP3 and TIPP3-fast: Improved Abundance Profiling in Metagenomics
Abstract 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.
[2408.13647] Synthetic Networks That Preserve Edge Connectivity
The Accessibility Forum starts next week! Sign up and join us in September.
Advances in Estimating Level-1 Phylogenetic Networks from Unrooted SNPs
Abstract We address the problem of how to estimate a phylogenetic network when given SNPs (i.e., single nucleotide polymorphisms, or bi-allelic markers that have evolved under the infinite sites assumption). We focus on level-1 phylogenetic networks (i.e., networks where the cycles are node-disjoint), since more complex networks are unidentifiable.
Addressing Polymorphism in Linguistic Phylogenetics
1 INTRODUCTION Linguistic phylogenetics is the study of how a group of languages evolve from a common ancestral language. Linguistic phylogenies (i.e. evolutionary trees and/or phylogenetic networks) are estimated for different groups of languages using a variety of methods and based on a number of different types of linguistic features (Dunn et al. 2005; Nichols & Warnow 2008; Calude & Verkerk 2016; Goldstein 2020, 2022b).
Computing Multiple Sequence Alignments given a Constraint Subset Alignment using EMMA
Abstract Background: Adding sequences into an existing (possibly user-provided) alignment has multiple applications, including updating a large alignment with new data, adding sequences into a constraint alignment constructed using biological knowledge, or computing alignments in the presence of sequence length heterogeneity. Although this is a natural problem, only a few tools have been developed to use this information with high fidelity.
BATCH-SCAMPP: Scaling phylogenetic placement methods to place many sequences
Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website.
Computing Multiple Sequence Alignments given a Constraint Subset Alignment using EMMA
Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website.
BATCH-SCAMPP: Scaling phylogenetic placement methods to place many sequences
Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website.
Statistically Consistent Rooting of Species Trees under the Multi-Species Coalescent Model
Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website.
DISCO+QR: Rooting Species Trees in the Presence of GDL and ILS
Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website.
SCAMPP+FastTree: Improving Scalability for Likelihood-based Phylogenetic Placement
Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website.
SCAMPP+FastTree: Improving Scalability for Likelihood-based Phylogenetic Placement
Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website.
HMMerge: an Ensemble Method for Improving Multiple Sequence Alignment
Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website.
eMAFFTadd: scaling MAFFT-linsi-add to large datasets
Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website.
Comparing Methods for Species Tree Estimation With Gene Duplication and Loss
Abstract Species tree inference from gene trees is an important part of biological research. One confounding factor in estimating species trees is gene duplication and loss which can lead to gene trees with multiple copies of the same gene. In recent years there have been several new methods developed to address this problem that have substantially improved on earlier methods; however, the best performing methods (ASTRAL- Pro, ASTRID-multi, and FastMulRFS) have not yet been directly compared.
Constrained incremental tree building: new absolute fast converging phylogeny estimation methods with improved scalability and accuracy
Algorithms for Molecular Biology201914:2 https://doi.org/10.1186/s13015-019-0136-9 © The Author(s) 2019 Received: 27 September 2018 Accepted: 18 January 2019 Published: 6 February 2019 Abstract Background Absolute fast converging (AFC) phylogeny estimation methods are ones that have been proven to recover the true tree with high probability given sequences whose lengths are polynomial in the number of number of leaves in the tree (once the shortest and longest branch weights are fixed).
Ultra-large alignments using phylogeny-aware profiles
Many biological questions, including the estimation of deep evolutionary histories and the detection of remote homology between protein sequences, rely upon multiple sequence alignments and phylogenetic trees of large datasets. However, accurate large-scale multiple sequence alignment is very difficult, especially when the dataset contains fragmentary sequences.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Tandy
Contact Tandy, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack