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

DNA solution based on sequence alignment to the Minimum Spanning Tree problem.

Aili Han1, Daming Zhu, Jingchang Pan

  • 1Department of Computer Science and Technology, Shandong University at Weihai, Weihai, China. hanal@sdu.edu.cn

International Journal of Bioinformatics Research and Applications
|May 21, 2008
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

Electrolyte-Regulated Epitaxial-Like Gradient Interface for Stable 4.8 V LiCoO<sub>2</sub>.

Journal of the American Chemical Society·2026
Same author

Synergistic Interfacial and Solvation Regulation by Nicotinamide for Dendrite-Free, Deep-Cycling Zinc Metal Anodes.

Small (Weinheim an der Bergstrasse, Germany)·2026
Same author

Amphiphile Confined Water Electrolyte Enables Facilitated Cation Transport through Nanometric Water Channels.

Journal of the American Chemical Society·2026
Same author

Synergistic Ternary Heterostructures Cathode With "Electron-Complementation" Bridging Interfaces Enable High-Performance Zinc-Ion Batteries.

Advanced materials (Deerfield Beach, Fla.)·2026
Same author

Mechanical properties of rock cutting by disc cutters and feasibility analysis of mechanical mining in Jinchuan No. 3 Mine with hard rock.

Scientific reports·2025
Same author

A practical 4.8-V Li||LiCoO<sub>2</sub> battery.

Science advances·2025
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

Sequence alignment techniques are introduced to DNA computing, enabling new algorithms for optimization problems. This research defines complement and reverse complement alignments for DNA sequences, enhancing DNA computing capabilities.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Molecular Computing

Background:

  • Sequence alignment is crucial for understanding relationships between biological sequences.
  • DNA molecules exhibit reverse complement relationships, essential for their double-stranded structure.
  • DNA computing leverages biological molecules for computation, offering potential for massive parallelism.

Purpose of the Study:

  • To introduce sequence alignment concepts to DNA computing.
  • To define and score complement and reverse complement alignments.
  • To develop a DNA algorithm for the Minimum Spanning Tree (MST) problem using reverse complement alignments.

Main Methods:

  • Defining complement alignment and reverse complement alignment.
  • Developing a scoring method for these alignments.

Related Experiment Videos

  • Designing a DNA encoding strategy for the MST problem.
  • Implementing a DNA algorithm based on reverse complement alignments.

    • Main Results:

    • Novel definitions for complement and reverse complement alignments in DNA computing.
    • A scoring method for these alignment types.
    • A DNA algorithm for solving the Minimum Spanning Tree (MST) problem.
    • Demonstration of DNA computing's applicability to optimization problems.

    Conclusions:

    • The study enriches the theoretical foundation of DNA computing.
    • Introduces novel alignment methods applicable to DNA sequence analysis.
    • Extends the application of DNA computing to solve complex optimization problems.