Channel Models for DNA Word Design
Abstract
DNA computing needs to find codes of DNA words satisfying constraints stated in
terms of Hamming and Reverse Complement Distance (DNA word
design). We deal with this problem from a code-theoretical point of
view: we are interested in identifying and analyzing channel models
and error-correction capabilities hidden underneath these codes. A
theoretical framework is provided by the concept of
distinguishability, connecting distances and correction
performances. Several proposals of DNA channels are studied,
concluding that the usual combination of Hamming and Reverse
Complement distance is the correct model to provide DNA
codes with error-correction capabilities.
[DOI: 10.1685/CSC06027] About DOI
terms of Hamming and Reverse Complement Distance (DNA word
design). We deal with this problem from a code-theoretical point of
view: we are interested in identifying and analyzing channel models
and error-correction capabilities hidden underneath these codes. A
theoretical framework is provided by the concept of
distinguishability, connecting distances and correction
performances. Several proposals of DNA channels are studied,
concluding that the usual combination of Hamming and Reverse
Complement distance is the correct model to provide DNA
codes with error-correction capabilities.
[DOI: 10.1685/CSC06027] About DOI
Full Text:
PDFDOI: https://doi.org/10.1685/
Except where otherwise noted, content on this site is licensed under a Creative Commons 2.5 Italy License