An introduction to symbolic dynamics and coding
An introduction to symbolic dynamics and coding
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Theory of Codes
Coding Properties of DNA Languages
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
A PCR-based Protocol for In Vitro Selection of Non-crosshybridizing Oligonucleotides
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Virtual Test Tubes: A New Methodology for Computing
SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
Involution codes: with application to DNA coded languages
Natural Computing: an international journal
Characterization of non-crosshybridizing DNA oligonucleotides manufactured In Vitro
DNA'04 Proceedings of the 10th international conference on DNA computing
Bond-free languages: formalizations, maximality and construction methods
DNA'04 Proceedings of the 10th international conference on DNA computing
Preventing undesirable bonds between DNA codewords
DNA'04 Proceedings of the 10th international conference on DNA computing
DNA'04 Proceedings of the 10th international conference on DNA computing
Involution Solid and Join codes
Fundamenta Informaticae
Involution Solid and Join codes
Fundamenta Informaticae
Generating DNA code words using forbidding and enforcing systems
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
Hi-index | 0.02 |
One of the main research topics in DNA computing is associated with the design of information encoding single or double stranded DNA strands that are “suitable” for computation. Double stranded or partially double stranded DNA occurs as a result of binding between complementary DNA single strands (A is complementary to T and C is complementary to G). This paper continues the study of the algebraic properties of DNA word sets that ensure that certain undesirable bonds do not occur. We formalize and investigate such properties of sets of sequences, e.g., where no complement of a sequence is a prefix or suffix of another sequence or no complement of a concatenation of n sequences is a subword of the concatenation of n + 1 sequences. The sets of code words that satisfy the above properties are called θ – prefix, θ-suffix and θ-intercode respectively, where θ is the formalization of the Watson-Crick complementarity. Lastly we develop certain methods of constructing such sets of DNA words with good properties and compute their informational entropy.