Using simulated annealing to design good codes
IEEE Transactions on Information Theory
Error-Correcting Codes over an Alphabet of Four Elements
Designs, Codes and Cryptography
Strand design for biomolecular computation
Theoretical Computer Science - Natural computing
DNA sequence design using templates
New Generation Computing
Stochastic Local Search Algorithms for DNA Word Design
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
On Template Method for DNA Sequence Design
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
In vitro selection of non-cross hybridizing oligonucleotides for computation
Natural Computing: an international journal
Hybrid randomised neighbourhoods improve stochastic local search for DNA code design
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Randomized fast design of short DNA words
ACM Transactions on Algorithms (TALG)
A novel color image encryption algorithm based on DNA sequence operation and hyper-chaotic system
Journal of Systems and Software
On the design of codes for DNA computing
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
DNA sequence design by dynamic neighborhood searches
DNA'06 Proceedings of the 12th international conference on DNA Computing
Deterministic polynomial-time algorithms for designing short DNA words
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Cyclic codes over F2[u]/(u4- 1) and applications to DNA codes
Computers & Mathematics with Applications
Flexible word design and graph labeling
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Deterministic polynomial-time algorithms for designing short DNA words
Theoretical Computer Science
| Hi-index | 5.23 |
In this paper we translate in terms of coding theory constraints that are used in designing DNA codes for use in DNA computing or as bar-codes in chemical libraries. We propose new constructions for DNA codes satisfying either a reverse-complement constraint, a GC-content constraint, or both, that are derived from additive and linear codes over four-letter alphabets. We focus in particular on codes over GF (4), and we construct new DNA codes that are in many cases better (sometimes far better) than previously known codes. We provide updated tables up to length 20 that include these codes as well as new codes constructed using a combination of lexicographic techniques and stochastic search.