NACST/Seq: A Sequence Design System with Multiobjective Optimization
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Hierarchical DNA Memory Based on Nested PCR
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Design of DNA Sequence Based on Improved Genetic Algorithm
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
A hybrid quantum chaotic swarm evolutionary algorithm for DNA encoding
Computers & Mathematics with Applications
Application of a novel IWO to the design of encoding sequences for DNA computing
Computers & Mathematics with Applications
An Ant Colony System for DNA sequence design based on thermodynamics
ACST '08 Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology
DNA coding using the subword closure operation
DNA13'07 Proceedings of the 13th international conference on DNA computing
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Bond-free languages: formalizations, maximality and construction methods
DNA'04 Proceedings of the 10th international conference on DNA computing
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Engineering Applications of Artificial Intelligence
Improving the design of sequences for DNA computing: A multiobjective evolutionary approach
Applied Soft Computing
Hi-index | 0.00 |
Sequence design is the important factor which governs the reaction of DNA. In related researches, the method to minimize (or maxmize) the evaluation function based on knowledge of sequence design has been used. In this paper, we develop support system for sequence design in DNA computing, which minimizes the evaluation function calculated as the linear sum of the plural evaluation terms. Our system not only searches for good sequences but also presents contribution ratio of each evaluation term to the evaluation function and can reduce the number of combination of evaluation terms by reduction of the evaluation function. It helps us to find a good criteria for sequence design in DNA computing.