Data compression: methods and theory
Data compression: methods and theory
Journal of the ACM (JACM)
Discrete Applied Mathematics
A fast string searching algorithm
Communications of the ACM
Theory of Codes
Theoretical Computer Science
Reconstructing strings from substrings in rounds
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Pseudopalindrome closure operators in free monoids
Theoretical Computer Science
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
On a Special Class of Primitive Words
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On pseudoknot-bordered words and their properties
Journal of Computer and System Sciences
Twin-roots of words and their properties
Theoretical Computer Science
On a special class of primitive words
Theoretical Computer Science
Watson---Crick palindromes in DNA computing
Natural Computing: an international journal
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
Palindromic richness for languages invariant under more symmetries
Theoretical Computer Science
Hi-index | 0.00 |
This paper is a theoretical study of notions in combinatorics of words motivated by information being encoded as DNA strands in DNA computing. We generalize the classical notions of conjugacy and commutativity of words to incorporate the notion of an involution function, a formalization of the Watson-Crick complementarity of DNA single-strands. We define and study properties of Watson-Crick conjugate and commutative words, as well as Watson-Crick palindromes. We obtain, for example, a complete characterization of the set of all words that are notWatson-Crick palindromes. Our results hold for more general functions, such as arbitrary morphic and antimorphic involutions. They generalize classical results in combinatorics of words, while formalizing concepts meaningful for DNA computing experiments.