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

DNA Isolation01:24

DNA Isolation

DNA isolation protocols can be fast and straightforward or complex and time-consuming depending on the type and quality of DNA required for further processing. For example, plasmid DNA extraction is a bit more complicated than genomic DNA extraction because of the need for an appropriate lysis method to separate plasmid DNA from gDNA during isolation. However, for specific applications, such as long-range DNA sequencing that require a good yield of high- quality DNA samples, we need to follow...
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
Base Excision Repair01:54

Base Excision Repair

One of the common DNA damages is the chemical alteration of single bases by alkylation, oxidation, or deamination. The altered bases cause mispairing and strand breakage during replication. This type of damage causes minimal change to the DNA double helix structure and can be repaired by the base excision repair (BER) pathways. BER corrects damaged DNA sequences by removing the damaged base and restoring the original base sequence using the complementary strand as a template.
The first step of...
Sanger Sequencing01:57

Sanger Sequencing

DNA sequencing is a fundamental technique that is routinely used in the biological sciences. This method can be applied to a range of questions at different scales - from the sequencing of a cloned DNA fragment or the study of a mutation in a gene up to whole-genome sequencing. However, despite the widespread use of sequencing today, it was not until 1977 that Fredrick Sanger and his collaborators developed the chain-termination method to decode DNA sequences. It relies on the separation of a...

You might also read

Related Articles

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

Sort by
Same author

Competition and cooperation of assembly sequences in recurrent neural networks.

PLoS computational biology·2025
Same author

Bioplausible Unsupervised Delay Learning for Extracting Spatiotemporal Features in Spiking Neural Networks.

Neural computation·2024
Same author

Accelerating spiking neural network simulations with PymoNNto and PymoNNtorch.

Frontiers in neuroinformatics·2024
Same author

On computational models of theory of mind and the imitative reinforcement learning in spiking neural networks.

Scientific reports·2024
Same author

Protein sequence profile prediction using ProtAlbert transformer.

Computational biology and chemistry·2022
Same author

A propagation-based seed-centric local community detection for multilayer environment: The case study of colon adenocarcinoma.

PloS one·2021
Same journal

In silico analysis, annotation and characterisation of putative ESTs from Sorghum bicolor associated with heat stress.

International journal of bioinformatics research and applications·2015
Same journal

Docking analysis of gallic acid derivatives as HIV-1 protease inhibitors.

International journal of bioinformatics research and applications·2015
Same journal

Automatic segmentation of Potyviridae family polyproteins.

International journal of bioinformatics research and applications·2015
Same journal

Neural network and rough set hybrid scheme for prediction of missing associations.

International journal of bioinformatics research and applications·2015
Same journal

On the interconnection of stable protein complexes: inter-complex hubs and their conservation in Saccharomyces cerevisiae and Homo sapiens networks.

International journal of bioinformatics research and applications·2015
Same journal

Diversity and evolution of the envelope gene of dengue virus type 1 circulating in India in recent times.

International journal of bioinformatics research and applications·2015
See all related articles

Related Experiment Video

Updated: May 7, 2026

Rapid Assembly of Multi-Gene Constructs using Modular Golden Gate Cloning
08:31

Rapid Assembly of Multi-Gene Constructs using Modular Golden Gate Cloning

Published on: February 5, 2021

Genetic algorithm solution for partial digest problem.

Hayedeh Ahrabian1, Mohammad Ganjtabesh, Abbas Nowzari-Dalini

  • 1School of Mathematics, Statistics and Computer Science, University of Tehran, Tehran, Iran.

International Journal of Bioinformatics Research and Applications
|October 3, 2013
PubMed
Summary
This summary is machine-generated.

A new Genetic Algorithm (GA) efficiently solves the Partial Digest Problem (PDP), crucial for constructing DNA physical maps. This computational biology approach handles complex and erroneous data, improving DNA sequence mapping.

Keywords:
DNA sequencingGAsPDPbioinformaticsgenetic algorithmspartial digest problem

More Related Videos

A Universal Protocol for Large-scale gRNA Library Production from any DNA Source
10:32

A Universal Protocol for Large-scale gRNA Library Production from any DNA Source

Published on: December 6, 2017

Laboratory Protocol for Genetic Gut Content Analyses of Aquatic Macroinvertebrates Using Group-specific rDNA Primers
10:17

Laboratory Protocol for Genetic Gut Content Analyses of Aquatic Macroinvertebrates Using Group-specific rDNA Primers

Published on: October 5, 2017

Related Experiment Videos

Last Updated: May 7, 2026

Rapid Assembly of Multi-Gene Constructs using Modular Golden Gate Cloning
08:31

Rapid Assembly of Multi-Gene Constructs using Modular Golden Gate Cloning

Published on: February 5, 2021

A Universal Protocol for Large-scale gRNA Library Production from any DNA Source
10:32

A Universal Protocol for Large-scale gRNA Library Production from any DNA Source

Published on: December 6, 2017

Laboratory Protocol for Genetic Gut Content Analyses of Aquatic Macroinvertebrates Using Group-specific rDNA Primers
10:17

Laboratory Protocol for Genetic Gut Content Analyses of Aquatic Macroinvertebrates Using Group-specific rDNA Primers

Published on: October 5, 2017

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Molecular Biology

Background:

  • Constructing physical maps of chromosomes is a fundamental challenge in computational biology.
  • The Partial Digest Problem (PDP) was a significant obstacle in DNA physical mapping before shotgun sequencing.
  • Accurate DNA sequence mapping is essential for understanding genetic information.

Purpose of the Study:

  • To develop a novel Genetic Algorithm (GA) for solving the Partial Digest Problem (PDP).
  • To evaluate the efficiency of the proposed GA against existing algorithms for DNA physical mapping.
  • To adapt the GA for handling erroneous data in chromosome fragment analysis.

Main Methods:

  • Development of a novel Genetic Algorithm (GA) tailored for the Partial Digest Problem (PDP).
  • Implementation and comparative analysis of the GA with established algorithms.
  • Testing on diverse datasets, including random and real-world instances, and erroneous data.

Main Results:

  • The novel GA demonstrated superior efficiency in solving the Partial Digest Problem (PDP).
  • The algorithm effectively handled both standard and erroneous data types.
  • Successful application to large instances of the DNA physical mapping problem was shown.

Conclusions:

  • The developed Genetic Algorithm (GA) offers an efficient and robust solution for the Partial Digest Problem (PDP).
  • This approach significantly advances the construction of DNA physical maps from hybridization data.
  • The GA's adaptability to erroneous data makes it a valuable tool in molecular biology and bioinformatics.