On properties of bond-free DNA languages

  • Authors:

  • Lila Kari;Stavros Konstantinidis;Petr Sosík

  • Affiliations:

  • Department of Computer Science, The University of Western Ontario, London, Ont., Canada N6A 5B7;Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Nova Scotia, Canada B3H 3C3;Department of Computer Science, The University of Western Ontario, London, Ont., Canada N6A 5B7 and Institute of Computer Science, Silesian University, 74601 Opava, Czech Republic

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2005

Quantified Score

Hi-index 5.23

Visualization

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.