Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

DNA Isolation

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...

Carbohydrate Digestion

Carbohydrate Digestion

Carbohydrate digestion and metabolism break down simple and complex carbohydrates from food into saccharides (i.e., sugars) for the body to use as energy. Carbohydrate digestion starts in the mouth during mastication, or chewing. The masticated carbohydrates remain intact in the stomach. Digestion resumes in the duodenum of the small intestine, where pancreatic alpha-amylase and brush border enzymes of the microvilli convert complex carbohydrates to monosaccharides. Finally, the monosaccharides...

Protein Digestion

Protein Digestion

Protein digestion begins in the stomach, where the highly acidic environment can easily disrupt protein structure by exposing the peptide bonds of polypeptide chains. After polypeptide chains are broken into individual amino acids by a series of digestive enzymes, the amino acids are transported to the liver via the bloodstream to produce energy.

Maxam-Gilbert Sequencing

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...

You might also read

Related Articles

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

Sort by

Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026

Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026

Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026

Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026

Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026

Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Sep 23, 2025

DNA-based Fish Species Identification Protocol

DNA-based Fish Species Identification Protocol

Published on: April 28, 2010

Fast Algorithms for the Simplified Partial Digest Problem.

Biing-Feng Wang¹

¹Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan, Republic of China.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology

|May 16, 2022

Summary

This summary is machine-generated.

New algorithms for the simplified partial digest problem (SPDP) significantly improve computational efficiency. These methods enhance physical map construction using restriction site analysis, enabling analysis of larger genomes.

Keywords:

algorithms backtracking genome mapping restriction sites analysis

More Related Videos

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

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

Published on: October 5, 2017

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes

Published on: July 17, 2021

Related Experiment Videos

Last Updated: Sep 23, 2025

DNA-based Fish Species Identification Protocol

DNA-based Fish Species Identification Protocol

Published on: April 28, 2010

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

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

Published on: October 5, 2017

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes

Application of DNA Fingerprinting using the D1S80 Locus in Lab Classes

Published on: July 17, 2021

Area of Science:

Bioinformatics
Computational Biology
Genomics

Background:

The simplified partial digest problem (SPDP) is crucial for physical map construction via restriction site analysis.
Existing algorithms for SPDP have high time and space complexities (O(n^2)), limiting their scalability for large genomes.

Purpose of the Study:

To develop more efficient algorithms for the SPDP.
To overcome the limitations of existing methods for analyzing large-scale genomic data.

Main Methods:

Developed two novel algorithms for the SPDP.
Algorithm 1: Improves time complexity by O(n) and reduces space to O(n^2).
Algorithm 2: Achieves O(n^1.5 * 2^n) time and space complexity.

Main Results:

The new algorithms offer substantial speedups (up to 4000x) compared to existing methods.
Reduced space complexity allows solving previously intractable instances.
Demonstrated the robustness of SPDP, with most instances having few (<=4) feasible solutions.

Conclusions:

The developed algorithms provide significant advancements in computational efficiency for SPDP.
These improvements facilitate the application of SPDP to larger and more complex genomic datasets.
The SPDP method is a robust approach for physical mapping, often yielding unique or few solutions.