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

Simplified partial digest problem: enumerative and dynamic programming algorithms.

Jacek Blazewicz1, Edmund Burke, Marta Kasprzak

  • 1Institute of Computer Sceince, Poznan University of Technology, Poznan, Poland. jblazewicz@cs.put.poznan.pl

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|November 3, 2007
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

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

PloS one·2025
Same author

RNA World with Inhibitors.

Entropy (Basel, Switzerland)·2025
Same author

Positive and Negative Effects of Administering a Magnetic Field to Patients with Rheumatoid Arthritis (RA).

Journal of clinical medicine·2024
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

This study introduces algorithms for the Simplified Partial Digest Problem (SPDP), a genome mapping technique robust to experimental errors. Efficient algorithms were developed for both error-free and imprecise data, aiding genomic research.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • The Simplified Partial Digest Problem (SPDP) models a simplified partial digest method for genome mapping.
  • This method offers laboratory implementation ease and robustness against experimental errors.
  • SPDP is recognized as an NP-hard problem in the strong sense.

Purpose of the Study:

  • To develop efficient algorithms for solving the error-free SPDP.
  • To adapt algorithms for handling SPDP with imprecise input data.
  • To investigate the number of solutions for SPDP and provide examples.

Main Methods:

  • An $O(n2;n)$ time enumerative algorithm was developed for error-free SPDP.
  • An $O(n(2q))$ time dynamic programming algorithm was designed for error-free SPDP.

Related Experiment Videos

  • The enumerative algorithm was adapted to accommodate imprecise input data.

    • Main Results:

    • The study presents novel algorithms for SPDP, addressing both ideal and real-world conditions.
    • Examples were provided, showing 2(n+2)/(3)-1 non-congruent solutions for specific SPDP instances.
    • Computer experiments demonstrated the performance of the developed algorithms.

    Conclusions:

    • Efficient computational solutions for SPDP have been established.
    • The developed algorithms are suitable for genome mapping applications, even with noisy data.
    • The findings contribute to understanding the complexity and solution space of SPDP.