DNA Codes that Avoid Secondary Structures
Discrete Mathematics
2016-11-17 v1 Information Theory
math.IT
Abstract
In this paper, we consider the problem of designing DNA sequences (codewords) for DNA storage systems and DNA computing that are unlikely to fold back onto themselves to form undesirable secondary structures. The paper addresses both the issue of enumerating the sequences with such properties and the problem of practical code construction.
Keywords
Cite
@article{arxiv.cs/0508055,
title = {DNA Codes that Avoid Secondary Structures},
author = {Olgica Milenkovic and Navin Kashyap},
journal= {arXiv preprint arXiv:cs/0508055},
year = {2016}
}
Comments
to appear in Proc. 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, Sept. 4-9, 2005; 5 pages