ABSTRACT: The design of DNA sequence is important in improving the reliability of DNA computing. In order to find better DNA coding sequence, some appropriate constrained terms that DNA sequence should satisfy are selected, and then the evaluation formulas of each DNA individual corresponding to the selected constrained terms are proposed. Modified Particle Swarm Optimization/Genetic Algorithm(MPSO/GA) Algorithm is presented to solve the multi-objective optimization problem. At last the comparison of the results with the known DNA sequences is made to prove the feasibility and efficiency of the method.
Computer Design and Applications (ICCDA), 2010 International Conference on; 07/2010
ABSTRACT: Computation by self-assembly of DNA is an efficient method of executing parallel DNA computing, in which information is encoded
in DNA tiles and a large number of tiles can be self-assembled via sticky end associations. Here, we investigate how basic
ideas on tiling can be applied to solve maximum clique problem (MCP). We suggest that these procedures can be realized on
the molecular scale through the medium of self-assembled DNA tiles. By creating billions of copies of the participating DNA
tiles, the algorithmic will run in parallel on all possible cliques. The potential of DNA computing by self-assembly for this
problem is promising given the operational time complexity of Θ(n). This work shows further evidence for the ability of DNA
computing to solve NP-Complete problems.
08/2009: pages 359-368;
Advances in Neural Networks - ISNN 2009, 6th International Symposium on Neural Networks, ISNN 2009, Wuhan, China, May 26-29, 2009, Proceedings, Part III; 01/2009
Fifth International Conference on Natural Computation, ICNC 2009, Tianjian, China, 14-16 August 2009, 6 Volumes; 01/2009