Channel Models for DNA Word Design

##article.authors##

  • Luca Bortolussi
  • Andrea Sgarro

##semicolon##

https://doi.org/10.1685/

##article.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

##submission.downloads##

##submissions.published##

2007-10-01

##issue.issue##

##issue.vol## 1 (2006)

##section.section##

Articles

##submission.license##

Authors who submit to this journal agree to the following terms: a) Authors retain copyright over their work, while allowing the SIMAI to place this accepted work under a Creative Commons Attribution License (CC license), which allows others to freely access, use, and share the work, with an acknowledgement of the work's authorship. b) Authors are able to waive the terms of the CC license and enter into separate, additional contractual arrangements for the non-exclusive distribution and subsequent publication of this work (e.g., publish a revised version in a journal, post it to an institutional repository or publish it in a book). with an acknowledgement of its initial publication on “Communications to SIMAI Congress”. c) In addition, authors are encouraged to post and share their work online (e.g., in institutional repositories or on their website).