A MSTP DNA Computing Model Based on Genetic Algorithm and Incompletion-Molecule Commixed Encoding Strategy

Zhi Li Pei; Qing Hu Wang; Jie Lian; Bin Wu

doi:10.4028/www.scientific.net/AMM.411-414.2056

Paper Titles

A Determination Algorithm with Inclusion Relationship between Two Semantic Link Networks
p.2037

3D Object Classification Using a Two-Dimensional Hidden Markov Model
p.2041

Two Systematic Methods for Generating Paths in Twisted Cube Networks
p.2047

Development Research on the Expert System for the Binary Tree-Based Apple Disease Diagnosis
p.2051

A MSTP DNA Computing Model Based on Genetic Algorithm and Incompletion-Molecule Commixed Encoding Strategy
p.2056

Binary Tree DNA Computing Model Based on the Insert - Remove System
p.2062

Multi-Subexpression Programming
p.2067

Prediction Modeling Method of Interval Grey Number Based on Different Type Whitenization Weight Functions
p.2074

The Review of the Single Machine Scheduling Problem and its Solving Methods
p.2081

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 411-414A MSTP DNA Computing Model Based on Genetic...

A MSTP DNA Computing Model Based on Genetic Algorithm and Incompletion-Molecule Commixed Encoding Strategy

Abstract:

Artificial intelligence based on the genetic algorithm and DNA computing based on the biological intelligence is two kinds of important intelligent computing model, Graph theory and combinatorial optimization problem is a hotspot of research on intelligent computing. This paper designs a coding space optimized by using genetic algorithm, and by using DNA computing to solve Minimum Spanning Tree Problem calculation model. Because MSTP (Minimum Spanning Tree Problem) refer to Weight, IMCE (Incompletion-Molecule Commixed Encoding) is used in vertex, edges and weights encoding. The calculation process of the MSTP solution has been detailed described detailed.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 411-414)

Pages:

2056-2061

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.411-414.2056

Citation:

Cite this paper

Online since:

September 2013

Authors:

Zhi Li Pei, Qing Hu Wang, Jie Lian, Bin Wu

Keywords:

DNA Computing, Genetic Algorithm (GA), IMCE, K-Arms Molecular, MSTP

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Adleman Leonard M. Molecular Computation of Solution to Combinatorial Problems [J]. Science, 1994, 66(11): 1021-1024.

Google Scholar

[2] Narayanan, S Zorbalas. DNA algorithms for computing shortest paths[J]. Proc of the 3rd Annual Genetic Programming Conference1 San Francisco, 1998, 718-723.

Google Scholar

[3] Wang Shudong，Dong Yafei，Jin Xu. Minimum recovering problem based on DNA computing. [J]. Journal of Chemical Information and Computer Seience，2002，42(2): 146-150.

Google Scholar

[4] Aili Han, Daming Zhu. A new DNA based approach to solve the maximum weight clique problem[J]. Lecture Notes in Computer Science 41151 Berlin: Springer, 2006, 320-327.

DOI: 10.1007/11816102_35

Google Scholar