Universal DNA tag systems: a combinatorial design scheme
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
On Template Method for DNA Sequence Design
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Comma-free design for DNA words
Communications of the ACM - New architectures for financial services
Codeword design and information encoding in DNA ensembles
Natural Computing: an international journal
Physical modeling of biomolecular computers: Models, limitations, and experimental validation
Natural Computing: an international journal
Development, evaluation and benchmarking of simulation software for biomolecule-based computing
Natural Computing: an international journal
Involution codes: with application to DNA coded languages
Natural Computing: an international journal
Linear constructions for DNA codes
Theoretical Computer Science
On properties of bond-free DNA languages
Theoretical Computer Science
Binary templates for comma-free DNA codes
Discrete Applied Mathematics
Application of a novel IWO to the design of encoding sequences for DNA computing
Computers & Mathematics with Applications
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
On codeword design in metric DNA spaces
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
DNA13'07 Proceedings of the 13th international conference on DNA computing
Dynamic neighborhood searches for thermodynamically designing DNA sequence
DNA13'07 Proceedings of the 13th international conference on DNA computing
On the scalability of biocomputing algorithms: The case of the maximum clique problem
Theoretical Computer Science
Efficient algorithm for testing structure freeness of finite set of biomolecular sequences
DNA'05 Proceedings of the 11th 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
Specificity of hybridization between DNA sequences based on free energy
DNA'05 Proceedings of the 11th international conference on DNA Computing
In search of optimal codes for DNA computing
DNA'06 Proceedings of the 12th international conference on DNA Computing
DNA sequence design by dynamic neighborhood searches
DNA'06 Proceedings of the 12th international conference on DNA Computing
Development of DNA relational database and data manipulation experiments
DNA'06 Proceedings of the 12th international conference on DNA Computing
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Research on the counting problem based on linear constructions for DNA coding
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Template frame for 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
Preventing undesirable bonds between DNA codewords
DNA'04 Proceedings of the 10th international conference on DNA computing
The capacity of DNA for information encoding
DNA'04 Proceedings of the 10th international conference on DNA computing
Iterated hairpin completions of non-crossing words
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
On the Regularity of Iterated Hairpin Completion of a Single Word
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Theory and applications of DNA codeword design
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Computing maximal Kleene closures that are embeddable in a given subword-closed language
Natural Computing: an international journal
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 a crucial problem in information-based biotechnology such as DNA-based computation. We introduce a simple strategy named template method that systematically generates a set of sequences of length l such that any of its member will have approximately l/3 mismatches with other sequences, their complements, and the overlaps of their concatenations.