The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
[article]
2012
arXiv
pre-print
Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional constraints. This problem has applications in, e.g., DNA self-assembly and DNA arrays. Previous works include those that extended results from coding theory to obtain bounds on code and word sizes for biologically motivated constraints and those that
arXiv:1201.6358v1
fatcat:kgeqku5tijgc5i6ith65lzgkqm