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 as a Genetic Template02:05

DNA as a Genetic Template

6.8K
6.8K
DNA Base Pairing02:27

DNA Base Pairing

27.1K
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,
27.1K
DNA-only Transposons02:57

DNA-only Transposons

14.4K
DNA-only transposons are called autonomous transposons since they code for the enzyme transposase that is required for the transposition mechanism. Insertion of transposons can alter gene functions in multiple ways. They can mutate the gene, alter gene expression by introducing a novel promoter or insulator sequence, introduce new splice sites, and change the mRNA transcripts produced, or remodel chromatin structure.
The donor site from where the transposon is excised is either degraded or...
14.4K
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

11.1K
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...
11.1K
Phylogenetic Trees03:21

Phylogenetic Trees

45.2K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
45.2K
DNA Packaging00:58

DNA Packaging

102.3K
Overview
102.3K

You might also read

Related Articles

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

Sort by
Same author

Accuracy of the large language model ChatGPT in adult emergency department triage: a systematic review and meta-analysis.

BMC emergency medicine·2026
Same author

Genome-Wide Identification and Expression Analysis of LBD Gene Family in <i>Neolamarckia cadamba</i>.

International journal of molecular sciences·2026
Same author

Ziziphus jujuba var. spinosa: a systematic review of phytochemistry, pharmacology, and sustainable resource utilization of its multiple plant parts.

The Journal of pharmacy and pharmacology·2026
Same author

A pillar[5]arene-based polydopamine-prodrug nanoplatform for targeted and synergistic chemodynamic-photothermal-chemotherapy of cancer.

Chemical communications (Cambridge, England)·2025
Same author

Analysis of Potential Profiles of Health Literacy in Chronic Heart Failure Patients.

Asian nursing research·2025
Same author

Screening and validation of optimal real-time PCR reference genes for Abelmoschus Manihot.

Scientific reports·2025

Related Experiment Video

Updated: Jun 12, 2025

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
09:26

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

Published on: December 29, 2021

4.1K

Levy Sooty Tern Optimization Algorithm Builds DNA Storage Coding Sets for Random Access.

Jianxia Zhang1,2

  • 1College of Mathematics and Information Science, Henan Normal University, Xinxiang 453003, China.

Entropy (Basel, Switzerland)
|September 27, 2024
PubMed
Summary
This summary is machine-generated.

This study introduces a novel Levy Sooty Tern Optimization Algorithm (LSTOA) to enhance DNA data storage. The LSTOA improves random access, reduces latency, and minimizes errors in DNA storage systems.

Keywords:
DNA codingDNA storagelevy sooty tern optimization algorithmrandom access

More Related Videos

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
10:23

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles

Published on: May 8, 2015

11.6K
Design and Synthesis of a Reconfigurable DNA Accordion Rack
07:44

Design and Synthesis of a Reconfigurable DNA Accordion Rack

Published on: August 15, 2018

7.0K

Related Experiment Videos

Last Updated: Jun 12, 2025

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation
09:26

DNA-Tethered RNA Polymerase for Programmable In vitro Transcription and Molecular Computation

Published on: December 29, 2021

4.1K
Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles
10:23

Self-assembly of Complex Two-dimensional Shapes from Single-stranded DNA Tiles

Published on: May 8, 2015

11.6K
Design and Synthesis of a Reconfigurable DNA Accordion Rack
07:44

Design and Synthesis of a Reconfigurable DNA Accordion Rack

Published on: August 15, 2018

7.0K

Area of Science:

  • Biotechnology
  • Computer Science
  • Data Storage

Background:

  • DNA offers high density, low energy, and long-term data storage potential.
  • Current DNA storage faces limitations in density, speed, and error rates, hindering practical application.
  • Efficient random-access DNA storage systems are needed for broader adoption.

Purpose of the Study:

  • To develop an optimized algorithm for DNA storage encoding.
  • To create a DNA storage coding set enabling efficient random access.
  • To address limitations of existing optimization algorithms in DNA data storage.

Main Methods:

  • Proposed the Levy Sooty Tern Optimization Algorithm (LSTOA) by integrating Levy flight operations into the Sooty Tern Optimization Algorithm (STOA).
  • Utilized LSTOA to construct a DNA storage encoding set that satisfies combinatorial constraints for random access.
  • Evaluated LSTOA performance on 13 benchmark test functions.

Main Results:

  • LSTOA demonstrated superior performance compared to STOA, overcoming slow iteration and local optima issues.
  • The LSTOA successfully constructed larger DNA storage coding sets under identical constraints.
  • Optimized coding sets led to reduced read-write latency and error rates in DNA storage.

Conclusions:

  • LSTOA is an effective optimization algorithm for DNA storage encoding.
  • The developed coding sets enhance random access and improve the efficiency of DNA data storage systems.
  • This research contributes to overcoming key challenges in practical DNA storage implementation.