Discrete Applied Mathematics
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Biomolecular Computation in Virtual Test Tubes
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
DNASequencesGenerator: A Program for the Construction of DNA Sequences
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Stochastic Local Search Algorithms for DNA Word Design
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Coding properties of DNA languages
Theoretical Computer Science
Involution codes: with application to DNA coded languages
Natural Computing: an international journal
Pseudopalindrome closure operators in free monoids
Theoretical Computer Science
The syntactic monoid of hairpin-free languages
Acta Informatica
Twin-roots of words and their properties
Theoretical Computer Science
Watson-Crick conjugate and commutative words
DNA13'07 Proceedings of the 13th international conference on DNA computing
On computational properties of template-guided DNA recombination
DNA'05 Proceedings of the 11th international conference on DNA Computing
Hairpin structures in DNA words
DNA'05 Proceedings of the 11th international conference on DNA Computing
Complexity of compact proofreading for self-assembled patterns
DNA'05 Proceedings of the 11th international conference on DNA Computing
In search of optimal codes for DNA computing
DNA'06 Proceedings of the 12th international conference on DNA Computing
Hairpin structures defined by DNA trajectories
DNA'06 Proceedings of the 12th international conference on DNA Computing
Involution solid and join codes
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
On a special class of primitive words
Theoretical Computer Science
DLT'10 Proceedings of the 14th international conference on Developments in language theory
DNA computing: a research snapshot
Algorithms and theory of computation handbook
A relation by palindromic subwords
Natural Computing: an international journal
An extension of the Lyndon--Schützenberger result to pseudoperiodic words
Information and Computation
Infinite words rich and almost rich in generalized palindromes
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Discrete Applied Mathematics
Hairpin completion with bounded stem-loop
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Fundamenta Informaticae
Programming and evolving physical self-assembling systems in three dimensions
Natural Computing: an international journal
Palindromic richness for languages invariant under more symmetries
Theoretical Computer Science
Hi-index | 0.00 |
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.