Abstract
Purchase PDF (383 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (5)
Purchase PDF (254 K)
→ (
-codes and 
-codes, which are superclasses of outfix and hyper-codes, respectively. These restrictions are based on the synchronized insertion operation, which serves as a model for the gene rearrangement function in certain unicellular organisms. We investigate the classes of 
doi:10.1016/j.tcs.2004.12.032 
Copyright © 2005 Elsevier B.V. All rights reserved.
On properties of bond-free DNA languages
Received 1 October 2004;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The input data for DNA computing must be encoded into the form of single or double DNA strands. As complementary parts of single strands can bind together forming a double-stranded DNA sequence, one has to impose restrictions on these sets of DNA words (languages) to prevent them from interacting in undesirable ways. We recall a list of known properties of DNA languages which are free of certain types of undesirable bonds. Then we introduce a general framework in which we can characterize each of these properties by a solution of a uniform formal language inequation. This characterization allows us among others to construct (i) a uniform algorithm deciding in polynomial time whether a given DNA language possesses any of the studied properties, and (ii) in many cases also an algorithm deciding whether a given DNA language is maximal with respect to the desired property.
Keywords: DNA language; DNA computing; Binary word operation
PACS: 68Q50; 68Q22
