Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
NACST/Seq: A Sequence Design System with Multiobjective Optimization
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Involution codes: with application to DNA coded languages
Natural Computing: an international journal
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
Designing nucleotide sequences for computation: a survey of constraints
DNA'05 Proceedings of the 11th international conference on DNA Computing
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
Nearly every nucleotide-based computing problem attempted thus far has involved the prearranged assignment of nucleotide sequences to represent bits. However, no general program is yet available to optimize those bit sequences. Careful selection of bit sequences can promote strong annealing between a bit and its intended complement while at the same time minimizing unintended interactions with other bits. In this paper, we present a program that uses an evolutionary algorithm to generate optimum bit sets using given (changeable) criteria. We also test some properties of the program and discuss future applications.