Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Deep clustering of single-cell RNA-seq using adversarial graph contrastive learning.

Briefings in bioinformatics·2025
Same author

Differential anti-viral response to respiratory syncytial virus A in preterm and term infants.

EBioMedicine·2024
Same author

Impact of two probiotic Lactobacillus strains feeding on fecal lactobacilli and weight gains in chicken.

The Journal of general and applied microbiology·2003
See all related articles

Related Experiment Video

Updated: Apr 17, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.8K

A two-phase binning algorithm using l-mer frequency on groups of non-overlapping reads.

Le Van Vinh1, Tran Van Lang2, Le Thanh Binh3

  • 1Faculty of Computer Science and Engineering, HCMC University of Technology, 268 Ly Thuong Kiet, Q10, Ho Chi Minh City, Vietnam.

Algorithms for Molecular Biology : AMB
|February 5, 2015
PubMed
Summary

This study introduces BiMeta, an unsupervised algorithm for metagenomic read binning. BiMeta accurately separates reads from different species without needing a reference database, outperforming existing methods.

Keywords:
AlgorithmBinningMetagenomicsNext-generation sequencingl-mers frequency

More Related Videos

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.9K
G2-seq: A High Throughput Sequencing-based Technique for Identifying Late Replicating Regions of the Genome
06:40

G2-seq: A High Throughput Sequencing-based Technique for Identifying Late Replicating Regions of the Genome

Published on: March 22, 2018

6.3K

Related Experiment Videos

Last Updated: Apr 17, 2026

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.8K
Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.9K
G2-seq: A High Throughput Sequencing-based Technique for Identifying Late Replicating Regions of the Genome
06:40

G2-seq: A High Throughput Sequencing-based Technique for Identifying Late Replicating Regions of the Genome

Published on: March 22, 2018

6.3K

Area of Science:

  • Bioinformatics
  • Genomics
  • Computational Biology

Background:

  • Metagenomics analyzes genetic material from microbial communities without culturing.
  • Read binning is crucial for separating sequences into organismal genomes.
  • Unsupervised binning methods are vital when reference databases are limited.

Purpose of the Study:

  • To develop and present BiMeta, a novel unsupervised algorithm for metagenomic read binning.
  • To enhance the accuracy of read classification in metagenomic analysis.

Main Methods:

  • BiMeta employs a two-phase approach: initial read grouping by overlap, followed by merging based on l-mer frequency distribution.
  • The algorithm operates without reliance on external reference databases.

Main Results:

  • BiMeta demonstrated superior performance compared to three state-of-the-art binning algorithms.
  • The algorithm achieved high accuracy on both simulated and real-world datasets, for short and long reads (≥700 bp).

Conclusions:

  • A novel and efficient unsupervised algorithm, BiMeta, for metagenomic read binning has been developed.
  • The BiMeta algorithm does not require a reference database, offering a valuable tool for diverse metagenomic studies.
  • Software and datasets are available for download, facilitating further research and application.