Evidence map›Paper›PMID 31437182›Full record

ArticlePloS one2019

TreeCluster: Clustering biological sequences using phylogenetic trees.

Metin Balaban, Niema Moshiri, Uyen Mai, Xingfan Jia, Siavash Mirarab

Abstract read
In one paragraph

Article in PloS one, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 118 papers.

0numbers the graph read from it
0cells of the map it votes in
118citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

118 citing papers in PubMed.

  1. Trial
  2. Article
  3. Comparison ofInfection and immunity · 2026
    Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Species identification and genotyping ofMicrobiology spectrum · 2026
    Article
  12. Article
  13. Article
  14. Article
  15. Comparison ofbioRxiv : the preprint server for biology · 2026
    Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article

58 more citing papers are in PubMed but not listed here.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Metin BalabanBioinformatics and Systems Biology Graduate Program, UC San Diego, La Jolla, CA 92093, United States of America.ORCID 0000-0002-6947-5915
Niema MoshiriBioinformatics and Systems Biology Graduate Program, UC San Diego, La Jolla, CA 92093, United States of America.ORCID 0000-0003-2209-8128
Uyen MaiComputer Science and Engineering, UC San Diego, La Jolla, CA 92093, United States of America.
Xingfan JiaDepartment of Mathematics, UC San Diego, La Jolla, CA 92093, United States of America.
Siavash MirarabDepartment of Electrical and Computer Engineering, UC San Diego, La Jolla, CA 92093, United States of America.

Funding

Virology CoreP30AI027767 · NIAID · UNIVERSITY OF ALABAMA AT BIRMINGHAM · PI OLAF KUTSCH · 1988 to 2026
$84.1M
NIAID NIH HHS P30 AI027767
6 · The paper itself

Abstract

Clustering homologous sequences based on their similarity is a problem that appears in many bioinformatics applications. The fact that sequences cluster is ultimately the result of their phylogenetic relationships. Despite this observation and the natural ways in which a tree can define clusters, most applications of sequence clustering do not use a phylogenetic tree and instead operate on pairwise sequence distances. Due to advances in large-scale phylogenetic inference, we argue that tree-based clustering is under-utilized. We define a family of optimization problems that, given an arbitrary tree, return the minimum number of clusters such that all clusters adhere to constraints on their heterogeneity. We study three specific constraints, limiting (1) the diameter of each cluster, (2) the sum of its branch lengths, or (3) chains of pairwise distances. These three problems can be solved in time that increases linearly with the size of the tree, and for two of the three criteria, the algorithms have been known in the theoretical computer scientist literature. We implement these algorithms in a tool called TreeCluster, which we test on three applications: OTU clustering for microbiome data, HIV transmission clustering, and divide-and-conquer multiple sequence alignment. We show that, by using tree-based distances, TreeCluster generates more internally consistent clusters than alternatives and improves the effectiveness of downstream applications. TreeCluster is available at https://github.com/niemasd/TreeCluster.

Indexed as

AlgorithmsPhylogenyBase SequenceCluster AnalysisComputational BiologyHIVHIV InfectionsHumansMicrobiotaSequence AlignmentSoftware

Identifiers

PMID31437182
PMCPMC6705769

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.