Exordium for DNA Codes

Arkadii G. D'yachkov (), Peter L. Erdös (), Anthony J. Macula (), Vyacheslav V. Rykov (), David C. Torney (), Chang-Shung Tung (), Pavel A. Vilenkin () and P. Scott White ()
Additional contact information
Arkadii G. D'yachkov: Moscow State University
Peter L. Erdös: Alfred Rényi Institute of Mathematics
Anthony J. Macula: SUNY Geneseo
Vyacheslav V. Rykov: Northeastern Nebraska University
David C. Torney: Theoretical Biology and Biophysics, Theoretical Division, Mail Stop K710
Chang-Shung Tung: Theoretical Biology and Biophysics, Theoretical Division, Mail Stop K710
Pavel A. Vilenkin: Moscow State University
P. Scott White: Los Alamos National Laboratory

Journal of Combinatorial Optimization, 2003, vol. 7, issue 4, No 5, 369-379

Abstract: Abstract We describe how deletion-correcting codes may be enhanced to yield codes with double-strand DNA-sequence codewords. This enhancement involves abstractions of the pertinent aspects of DNA; it nevertheless ensures specificity of binding for all pairs of single strands derived from its codewords—the key desideratum of DNA codes– i.e. with binding feasible only between reverse complementary strands. We defer discussing the combinatorial-optimization superincumbencies of code construction. Generalization of deletion similarity to an optimal sequence-alignment score could readily effect advantageous improvements (Kaderali, Master's Thesis, Informatics, U. Köln, 2001) but would render the combinatorics opaque. We mention motivating applications of DNA codes.

Keywords: binding propensity; DNA computing; DNA hybridization; digital velcro; formulation; directed design (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000017385.39168.0d Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:7:y:2003:i:4:d:10.1023_b:joco.0000017385.39168.0d

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/B:JOCO.0000017385.39168.0d

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().