Paper Info
Title
Coding properties of DNA languages
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. We give 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.
Year
DOI
Venue
2003
10.1016/S0304-3975(02)00069-5
Theor. Comput. Sci.
Keywords
Field
DocType
undesirable bond,coding property,computation step,certain undesirable bond,computation language,optimal comma-free code,DNA computation,DNA language,DNA strand,DNA-based system
Discrete mathematics,Coding (social sciences),DNA,Theoretical computer science,Mathematics,Computation
Journal
Volume
Issue
ISSN
290
3
Theoretical Computer Science
ISBN
Citations 
PageRank 
3-540-43775-4
33
2.05
References 
Authors
2
3
Name
Order
Citations
PageRank
Salah Hussini1372.48
Lila Kari21123124.45
Stavros Konstantinidis328331.10