Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 1
Theory of Codes
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
A Software Tool for Generating Non-crosshybridizing Libraries of DNA Oligonucleotides
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Journal of Computer Science and Technology - Special issue on bioinformatics
Codeword design and information encoding in DNA ensembles
Natural Computing: an international journal
Involution Solid and Join codes
Fundamenta Informaticae
Algorithmic applications of XPCR
Natural Computing: an international journal
DNA codes and their properties
DNA'06 Proceedings of the 12th international conference on DNA Computing
Bond-free languages: formalizations, maximality and construction methods
DNA'04 Proceedings of the 10th international conference on DNA computing
Involution solid and join codes
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Involution Solid and Join codes
Fundamenta Informaticae
Hi-index | 0.00 |
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.