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

Next-generation Sequencing03:00

Next-generation Sequencing

97.6K
The first human genome sequencing project cost $2.7 billion and was declared complete in 2003, after 15 years of international cooperation and collaboration between several research teams and funding agencies. Today, with the advent of next-generation sequencing technologies, the cost and time of sequencing a human genome have dropped over 100 fold.
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....
97.6K
Sanger Sequencing01:57

Sanger Sequencing

772.7K
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...
772.7K
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

12.5K
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...
12.5K
DNA Base Pairing02:27

DNA Base Pairing

31.3K
31.3K
DNA Base Pairing02:27

DNA Base Pairing

32.8K
Erwin Chargaff’s rules on DNA equivalence paved the way for the discovery of base pairing in DNA. Chargaff’s rules state that in a double-stranded DNA molecule,
32.8K
RNA-seq03:21

RNA-seq

11.7K
RNA sequencing, or RNA-Seq, is a high-throughput sequencing technology used to study the transcriptome of a cell. Transcriptomics helps to interpret the functional elements of a genome and identify the molecular constituents of an organism. Additionally, it also helps in understanding the development of an organism and the occurrence of diseases. 
Before the discovery of RNA-seq, microarray-based methods and Sanger sequencing were used for transcriptome analysis. However, while...
11.7K

You might also read

Related Articles

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

Sort by
Same author

Deep learning-enabled self-powered bimodal flexible sensor for intelligent access control.

Nanotechnology·2026
Same author

Polygenic risk score analysis of noise-induced hearing loss: An integrated cross-sectional and longitudinal study.

Hearing research·2026
Same author

A three-pronged strategy with minimalist nattokinase nanocomposite eye drops breaks the vicious cycle in ultraviolet-B-induced cataract.

Journal of nanobiotechnology·2026
Same author

Ultrathin proton exchange membranes with enhanced dimensional stability towards acidic CO<sub>2</sub> electroreduction.

Chemical communications (Cambridge, England)·2026
Same author

A Dual-Gene Signature of PMAIP1 and GADD45A for Early Detection of Intrahepatic Cholangiocarcinoma in the Context of Primary Sclerosing Cholangitis.

International journal of molecular sciences·2026
Same author

The association between upper limb function, physical exercise, and cognitive ability among empty-nest elderly in China: A cross-sectional study based on CLHLS.

PloS one·2026
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
Same journal

Dual channel drug-drug interactions extraction based on cross attention.

BMC bioinformatics·2026
Same journal

FeSseqdb: a curated sequence-level database and interpretable machine learning framework for identifying iron-sulfur proteins.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: Jan 7, 2026

Automated Robotic Liquid Handling Assembly of Modular DNA Devices
11:22

Automated Robotic Liquid Handling Assembly of Modular DNA Devices

Published on: December 1, 2017

12.8K

Batch optimization for balanced binary sequences and DNA sequences.

Yiming Ma1

  • 1School of Cyber Security, University of Science and Technology of China, 96 Jinzhai Road, Hefei, 230026, Anhui Province, China. mym024@mail.ustc.edu.cn.

BMC Bioinformatics
|December 30, 2025
PubMed
Summary
This summary is machine-generated.

Optimizing DNA data storage synthesis involves partitioning DNA sequences into batches. This study minimizes synthesis costs by finding the optimal batch configuration, reducing the length of common supersequences needed for DNA strand encoding.

Keywords:
Balanced codesBatch optimizationDNA storageDNA synthesisThe shortest common supersequence

More Related Videos

Rare Event Detection Using Error-corrected DNA and RNA Sequencing
10:36

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Published on: August 3, 2018

12.5K
2D-HELS MS Seq: A General LC-MS-Based Method for Direct and de novo Sequencing of RNA Mixtures with Different Nucleotide Modifications
05:41

2D-HELS MS Seq: A General LC-MS-Based Method for Direct and de novo Sequencing of RNA Mixtures with Different Nucleotide Modifications

Published on: July 10, 2020

2.2K

Related Experiment Videos

Last Updated: Jan 7, 2026

Automated Robotic Liquid Handling Assembly of Modular DNA Devices
11:22

Automated Robotic Liquid Handling Assembly of Modular DNA Devices

Published on: December 1, 2017

12.8K
Rare Event Detection Using Error-corrected DNA and RNA Sequencing
10:36

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Published on: August 3, 2018

12.5K
2D-HELS MS Seq: A General LC-MS-Based Method for Direct and de novo Sequencing of RNA Mixtures with Different Nucleotide Modifications
05:41

2D-HELS MS Seq: A General LC-MS-Based Method for Direct and de novo Sequencing of RNA Mixtures with Different Nucleotide Modifications

Published on: July 10, 2020

2.2K

Area of Science:

  • Bioinformatics
  • Data Storage
  • Computational Biology

Background:

  • DNA data storage offers high density and longevity.
  • De novo DNA synthesis cost and low throughput hinder practicality.
  • Common supersequence length is a key cost driver in array-based synthesis.

Purpose of the Study:

  • Address DNA synthesis cost bottleneck.
  • Investigate optimal batch partitioning of DNA sequences.
  • Minimize total synthesis cost by minimizing shortest common supersequence (SCS) lengths across batches.

Main Methods:

  • Defined total cost as the sum of SCS lengths for all sequences within each batch.
  • Formulated the central problem as finding the minimum total cost among all possible k-batch partitions.
  • Utilized combinatorial methods for sequence analysis.

Main Results:

  • Derived optimal partitioning costs for balanced binary sequences of length 2n.
  • Obtained cost estimations for large n with a constant C dependent on k.
  • Achieved similar results for balanced DNA sequences of length 2n.

Conclusions:

  • The study provides a method to minimize DNA synthesis costs through optimal batch partitioning.
  • Combinatorial analysis yields specific cost formulas for balanced binary and DNA sequences.
  • Findings contribute to making DNA data storage more practical and cost-effective.