Universal DNA tag systems: a combinatorial design scheme
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
DNA sequence design using templates
New Generation Computing
Linear constructions for DNA codes
Theoretical Computer Science
Binary templates for comma-free DNA codes
Discrete Applied Mathematics
Implementation of Binary Particle Swarm Optimization for DNA Sequence Design
IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
The effect of the bulge loop upon the hybridization process in DNA computing
ICES'03 Proceedings of the 5th international conference on Evolvable systems: from biology to hardware
DNA coding using the subword closure operation
DNA13'07 Proceedings of the 13th international conference on DNA computing
Chain reaction systems based on loop dissociation of DNA
DNA'05 Proceedings of the 11th international conference on DNA Computing
DNA sequence design by dynamic neighborhood searches
DNA'06 Proceedings of the 12th international conference on DNA Computing
| Hi-index | 0.00 |
The design of DNA sequences is one of the most practical and important research topics in DNA computing. Although the design of DNA sequences is dependent on the protocol of biological experiments, it is highly required to establish a method for the systematic design of DNA sequences, which could be applied to various design constraints. Recently, Arita proposed an interesting design method, called template method, for DNA word design. The current paper discusses on some extensions of the template method, where we propose a variant of template method, the use of multiple templates, and show their effectiveness. Furthermore, we also present some theoretical properties of templates.