ArticleAlgorithms for molecular biology : AMB2012
Separating metagenomic short reads into genomes via clustering.
Article in Algorithms for molecular biology : AMB, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 12 papers.
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.
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.
Who cites it
12 citing papers in PubMed.
- Music of metagenomics-a review of its applications, analysis pipeline, and associated tools.Functional & integrative genomics · 2022Review
- Alignment-free method for DNA sequence clustering using Fuzzy integral similarity.Scientific reports · 2019Article
- Fast and accurate phylogeny reconstruction using filtered spaced-word matches.Bioinformatics (Oxford, England) · 2017Article
- A framework for space-efficient read clustering in metagenomic samples.BMC bioinformatics · 2017Article
- A two-phase binning algorithm using l-mer frequency on groups of non-overlapping reads.Algorithms for molecular biology : AMB · 2015Article
- Estimating evolutionary distances between genomic sequences from spaced-word matches.Algorithms for molecular biology : AMB · 2015Article
- A New Binning Method for Metagenomics by One-Dimensional Cellular Automata.International journal of genomics · 2015Article
- LAF: Logic Alignment Free and its application to bacterial genomes classification.BioData mining · 2015Article
- Predicting the functional repertoire of an organism from unassembled RNA-seq data.BMC genomics · 2014Article
- Merging metagenomics and geochemistry reveals environmental controls on biological diversity and evolution.BMC ecology · 2014Article
- MaxBin: an automated binning method to recover individual genomes from metagenomes using an expectation-maximization algorithm.Microbiome · 2014Article
- MetaCluster 5.0: a two-round binning approach for metagenomic data for low-abundance species in a noisy sample.Bioinformatics (Oxford, England) · 2012Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
unlabelled
backgroundThe metagenomics approach allows the simultaneous sequencing of all genomes in an environmental sample. This results in high complexity datasets, where in addition to repeats and sequencing errors, the number of genomes and their abundance ratios are unknown. Recently developed next-generation sequencing (NGS) technologies significantly improve the sequencing efficiency and cost. On the other hand, they result in shorter reads, which makes the separation of reads from different species harder. Among the existing computational tools for metagenomic analysis, there are similarity-based methods that use reference databases to align reads and composition-based methods that use composition patterns (i.e., frequencies of short words or l-mers) to cluster reads. Similarity-based methods are unable to classify reads from unknown species without close references (which constitute the majority of reads). Since composition patterns are preserved only in significantly large fragments, composition-based tools cannot be used for very short reads, which becomes a significant limitation with the development of NGS. A recently proposed algorithm, AbundanceBin, introduced another method that bins reads based on predicted abundances of the genomes sequenced. However, it does not separate reads from genomes of similar abundance levels.
resultsIn this work, we present a two-phase heuristic algorithm for separating short paired-end reads from different genomes in a metagenomic dataset. We use the observation that most of the l-mers belong to unique genomes when l is sufficiently large. The first phase of the algorithm results in clusters of l-mers each of which belongs to one genome. During the second phase, clusters are merged based on l-mer repeat information. These final clusters are used to assign reads. The algorithm could handle very short reads and sequencing errors. It is initially designed for genomes with similar abundance levels and then extended to handle arbitrary abundance ratios. The software can be download for free at http://www.cs.ucr.edu/∼tanaseio/toss.htm.
conclusionsOur tests on a large number of simulated metagenomic datasets concerning species at various phylogenetic distances demonstrate that genomes can be separated if the number of common repeats is smaller than the number of genome-specific repeats. For such genomes, our method can separate NGS reads with a high precision and sensitivity.
Identifiers
What OpenQuestion holds
Registered trials
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.