Evidence map›Paper›PMID 29036588›Full record

ArticleBioinformatics (Oxford, England)2018

A novel data structure to support ultra-fast taxonomic classification of metagenomic sequences with k-mer signatures.

Xinan Liu, Ye Yu, Jinpeng Liu, Corrine F Elliott, Chen Qian, Jinze Liu

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 20 papers.

0numbers the graph read from it
0cells of the map it votes in
20citing 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

20 citing papers in PubMed.

  1. Article
  2. Article
  3. Exercise and microbiome: From big data to therapy.Computational and structural biotechnology journal · 2023
    Review
  4. Article
  5. Article
  6. Article
  7. Data Structures to Represent a Set ofACM computing surveys · 2022
    Article
  8. Article
  9. Review
  10. Article
  11. Fast and Accurate Classification of Meta-Genomics Long Reads With deSAMBA.Frontiers in cell and developmental biology · 2021
    Article
  12. Article
  13. Mismatch-tolerant, alignment-free sequence classification using multiple spaced seeds and multiindex Bloom filters.Proceedings of the National Academy of Sciences of the United States of America · 2020
    Article
  14. Article
  15. Article
  16. UniqueInternational journal of molecular sciences · 2020
    Article
  17. Review
  18. Article
  19. Article
  20. Article
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

6 authors.

Xinan LiuDepartment of Computer Science, University of Kentucky, Lexington, KY, USA.
Ye YuDepartment of Computer Science,University of Kentucky, Lexington, KY, USA.
Jinpeng LiuBiostatistics and Bioinformatics Shared Resource Facility, Markey Cancer Center, University of Kentucky, Lexington, KY, USA.
Corrine F ElliottDepartment of Computer Science, University of Kentucky, Lexington, KY, USA.
Chen QianDepartment of Computer Engineering, UC Santa Cruz, Santa Cruz, CA, USA.
Jinze LiuDepartment of Computer Science, University of Kentucky, Lexington, KY, USA.

Funding

University of Kentucky Markey Cancer Center Support Grant ECIA SupplementP30CA177558 · NCI · UNIVERSITY OF KENTUCKY · PI KATHLEEN L. O'CONNOR · 2013 to 2026
$38.3M
Unlocking transcript diversity via differential analyses of splice graphsR01HG006272 · NHGRI · UNIV OF NORTH CAROLINA CHAPEL HILL · PI LIU, JINZE, PRINS, JAN F · 2012 to 2014
$1.2M
NCI NIH HHS P30 CA177558NHGRI NIH HHS R01 HG006272
6 · The paper itself

Abstract

Motivation: Metagenomic read classification is a critical step in the identification and quantification of microbial species sampled by high-throughput sequencing. Although many algorithms have been developed to date, they suffer significant memory and/or computational costs. Due to the growing popularity of metagenomic data in both basic science and clinical applications, as well as the increasing volume of data being generated, efficient and accurate algorithms are in high demand. Results: We introduce MetaOthello, a probabilistic hashing classifier for metagenomic sequencing reads. The algorithm employs a novel data structure, called l-Othello, to support efficient querying of a taxon using its k-mer signatures. MetaOthello is an order-of-magnitude faster than the current state-of-the-art algorithms Kraken and Clark, and requires only one-third of the RAM. In comparison to Kaiju, a metagenomic classification tool using protein sequences instead of genomic sequences, MetaOthello is three times faster and exhibits 20-30% higher classification sensitivity. We report comparative analyses of both scalability and accuracy using a number of simulated and empirical datasets. Availability and implementation: MetaOthello is a stand-alone program implemented in C ++. The current version (1.0) is accessible via https://doi.org/10.5281/zenodo.808941. Contact: liuj@cs.uky.edu. Supplementary information: Supplementary data are available at Bioinformatics online.

Indexed as

Genome, MicrobialSoftwareAlgorithmsBacteriaHigh-Throughput Nucleotide SequencingHumansMetagenomicsMicrobiotaSequence Analysis, DNA

Identifiers

PMID29036588
PMCPMC5870563

What OpenQuestion holds

Textmetadata
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.