Abstract
The computation language of a DNA-based system consists of all the words (DNA strands) that can appear in any computation step of the system. In this work we define properties of languages which ensure that the words of such languages will not form undesirable bonds when used in DNA computations. Wegive several characterizations of the desired properties and provide methods for obtaining languages with such properties. The decidability of these properties is addressed as well. As an application we consider splicing systems whose computation language is free of certain undesirable bonds and is generated by nearly optimal comma-free codes.
Cite
CITATION STYLE
Hussini, S., Kari, L., & Konstantinidis, S. (2002). Coding properties of DNA languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2340, pp. 57–69). Springer Verlag. https://doi.org/10.1007/3-540-48017-x_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
