Watson–Crick palindromes in DNA computing


This paper provides an overview of existing approaches to encoding information on DNA strands for biocomputing, with a focus on the notion of Watson–Crick (WK) palindromes. We obtain a closed form for, as well as several properties of WK palindromes: The set of WK-palindromes is dense, context-free, but not regular, and is in general not closed under catenation and insertion. We obtain some properties that link the WK palindromes to classical notions such as that of primitive words. For example we show that the set of WK-palindromic words that cannot be written as the product of two nonempty WK-palindromes equals the set of primitive WK-palindromes. We also investigate various simultaneous Watson–Crick conjugate equations of words and show that the equations have, in most cases, only Watson–Crick palindromic solutions. Our results hold for more general functions, such as arbitrary morphic and antimorphic involutions.

DOI: 10.1007/s11047-009-9131-2

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Kari2009WatsonCrickPI, title={Watson–Crick palindromes in DNA computing}, author={Lila Kari and Kalpana Mahalingam}, journal={Natural Computing}, year={2009}, volume={9}, pages={297-316} }