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 Experiment Videos

A parallel graph decomposition algorithm for DNA sequencing with nanopores.

Shahid H Bokhari1, Jon R Sauer

  • 1Department of Electrical Engineering, UET Lahore-54890, Pakistan. shb@acm.org

Bioinformatics (Oxford, England)
|November 13, 2004
PubMed
Summary
This summary is machine-generated.

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

Massively Multithreaded Maxflow for Image Segmentation on the Cray XMT-2.

Concurrency and computation : practice & experience·2015
Same author

Reassortment Networks and the evolution of pandemic H1N1 swine-origin influenza.

IEEE/ACM transactions on computational biology and bioinformatics·2011
Same author

Reassortment networks for investigating the evolution of segmented viruses.

IEEE/ACM transactions on computational biology and bioinformatics·2010
Same author

Parallelizing a DNA simulation code for the Cray MTA-2.

Proceedings. IEEE Computer Society Bioinformatics Conference·2005
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
Same journal

KASSPer: Kinase Active Site Structure Prediction using Protein and Ligand Language Models and Its Application to Virtual Screening.

Bioinformatics (Oxford, England)·2026
Same journal

IDR searcher: a search engine solution for public image resources.

Bioinformatics (Oxford, England)·2026
Same journal

KCFtools: Rapid alignment-free method for introgression screening and GWAS using k-mer profiles.

Bioinformatics (Oxford, England)·2026
Same journal

Meta2DB: Curated shotgun metagenomic feature sets and metadata for health state prediction.

Bioinformatics (Oxford, England)·2026
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
See all related articles

A new algorithm reconstructs complete DNA sequences from nanopore reads, overcoming errors and lost orientation information. This method enables rapid, accurate sequencing of long DNA molecules, crucial for genomics research.

Area of Science:

  • Genomics
  • Bioinformatics
  • Computational Biology

Background:

  • Nanopore sequencing technology promises high-throughput, long reads of single-stranded DNA (ssDNA).
  • Challenges include random fragmentation, loss of orientation and complementarity information, and inherent sequencing errors.
  • Accurate reconstruction of complete DNA sequences from such data is a significant bioinformatics challenge.

Purpose of the Study:

  • To develop a robust algorithm for complete DNA sequencing using long, error-prone nanopore reads.
  • To address the loss of orientation and complementarity information during ssDNA translocation.
  • To enable rapid and accurate reconstruction of large-scale genomic sequences.

Main Methods:

  • An advanced Eulerian path approach is employed, adapted for extreme variations.

Related Experiment Videos

  • The algorithm searches de Bruijn graphs to eliminate errors and resolve ssDNA orientations.
  • A parallel implementation was developed and tested on a Cray MTA-2 supercomputer.

    • Main Results:

    • The algorithm successfully reconstructs DNA sequences up to 10^6 bases, demonstrated with *Mycoplasma pneumoniae*.
    • Accurate reconstruction is achieved from simulated erroneous reads within approximately 1 hour on a standard workstation.
    • The parallel implementation significantly enhances speed for large-scale sequencing and multi-nanopore data streams.

    Conclusions:

    • The developed algorithm effectively overcomes limitations of current nanopore sequencing data.
    • It provides a computationally efficient solution for reconstructing complete and accurate long DNA sequences.
    • This advancement is critical for high-throughput genomics and the efficient utilization of emerging nanopore technologies.