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

Authors:
Aili Han;Daming Zhu;Jingchang Pan
Affiliations:
Department of Computer Science and Technology, Shandong University at Weihai, Weihai 264209, China.;School of Computer Science and Technology, Shandong University, Jinan 250061, China.;Department of Computer Science and Technology, Shandong University at Weihai, Weihai 264209, China
Venue:
International Journal of Bioinformatics Research and Applications
Year:
2008

Citing 6
Cited 0

Molecular computation of solutions to combinatorial problems

Science
DNA Computing Model for the 0/1 Knapsack Problem

HIS '06 Proceedings of the Sixth International Conference on Hybrid Intelligent Systems
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing Model for the Minimum Spanning Tree Problem

SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
A new DNA-based approach to solve the maximum weight clique problem

ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
A new DNA encoding method for traveling salesman problem

ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequence alignment reveals the relations between the characters in different sequences, and there are the reverse complement relations between the characters in DNA double strand. We introduce sequence alignment to the field of DNA computing, propose the definitions of complement alignment and reverse complement alignment, give a method of computing the scores of complement alignment and reverse complement alignment, and devise a DNA encoding method and the corresponding DNA algorithm for the Minimum Spanning Tree (MST) problem by means of reverse complement alignments. Our work enriches the theory of DNA computing and extends the range of DNA computing to solve optimisation problems.