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 heuristic managing errors for DNA sequencing.

Jacek Błazewicz1, Piotr Formanowicz, Frederic Guinand

  • 1Institute of Computing Science, Poznań University of Technology, 60-965 Poznań, Poland. blazewic@sol.put.poznan.pl

Bioinformatics (Oxford, England)
|June 7, 2002
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

GrassSV - hybrid method to detect structural variants in high throughput DNA-seq data.

PLoS computational biology·2026
Same author

Does the Type of Electrotherapy Impact the Effectiveness of Complex Physiotherapy Administered to Individuals with Neck Pain?

Journal of clinical medicine·2026
Same author

A Reliability Study of Small, Portable, Easy-to-Use, and IMU-Based Sensors for Gait Assessment.

Sensors (Basel, Switzerland)·2025
Same author

Graphlet Degree Distribution Sensibility in Petri Net-Based Models of Biological Systems.

IEEE transactions on computational biology and bioinformatics·2025
Same author

ProProtein: A platform for fully automated identification of 3D structure fluctuations in MD simulation trajectories.

PloS one·2025
Same author

The Interplay Between Carotid Intima-Media Thickness and Selected Serum Biomarkers in Various Stages of Chronic Kidney Disease.

Biomedicines·2025
Same journal

Biomedical Concept Recognition with Error-aware Negative-enhanced Ranking Framework.

Bioinformatics (Oxford, England)·2026
Same journal

TEDLH: Domain HMMs for sensitive detection of remote homologues.

Bioinformatics (Oxford, England)·2026
Same journal

PLNFGL: Joint Estimation of Multi-Condition Gene Networks from Single-cell RNA-seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

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

A novel heuristic algorithm effectively solves the DNA sequencing by hybridization problem, even with errors. This new method outperforms existing tabu search algorithms, offering improved solutions for DNA sequence reconstruction.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • The DNA sequencing by hybridization (SBH) problem is a critical challenge in genomics.
  • Existing algorithms struggle with positive and negative errors inherent in hybridization data.
  • Accurate DNA sequence reconstruction is vital for genetic research and diagnostics.

Purpose of the Study:

  • To develop a novel heuristic algorithm for the SBH problem.
  • To address challenges posed by positive and negative errors in sequencing data.
  • To improve the accuracy and efficiency of DNA sequence reconstruction.

Main Methods:

  • A new heuristic algorithm was designed and implemented.
  • The algorithm incorporates strategies to handle positive and negative errors.

Related Experiment Videos

  • Performance was evaluated against established methods, including tabu search.

    • Main Results:

    • The developed heuristic algorithm yields superior solutions compared to existing literature methods.
    • The algorithm demonstrates enhanced performance in solving the SBH problem with data errors.
    • Tabu search-based algorithms were outperformed by the new heuristic approach.

    Conclusions:

    • The new heuristic algorithm offers a significant advancement for the DNA sequencing by hybridization problem.
    • This method provides a more robust and accurate approach to DNA sequence reconstruction.
    • The algorithm's effectiveness in handling errors makes it a valuable tool in bioinformatics.