Watson-Crick Conjugate and Commutative Words
DOI10.1007/978-3-540-77962-9_29zbMATH Open1137.68394DBLPconf/dna/KariM07OpenAlexW1876472356WikidataQ62046612 ScholiaQ62046612MaRDI QIDQ5452701FDOQ5452701
Authors: Lila Kari, Kalpana Mahalingam 
Publication date: 4 April 2008
Published in: DNA Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77962-9_29
Recommendations
Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorics on words (68R15)
Cites Work
- Two-way string-matching
- Complexity of Compact Proofreading for Self-assembled Patterns
- Title not available (Why is that?)
- Jewels of Stringology
- A fast string searching algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pseudopalindrome closure operators in free monoids
- Title not available (Why is that?)
- Conjugacy on partial words.
- \(d\)-minimal languages
- Involutively bordered words
- Hairpin Structures in DNA Words
- On Computational Properties of Template-Guided DNA Recombination
- In Search of Optimal Codes for DNA Computing
- Sticky-free and overhang-free DNA languages
- Hairpin Structures Defined by DNA Trajectories
Cited In (22)
- Disjunctivity and other properties of sets of pseudo-bordered words
- Watson-Crick palindromes in DNA computing
- Some properties of related involution palindrome words
- On pseudoknot-bordered words and their properties
- Interval exchange words and the question of Hof, Knill, and Simon
- Twin-roots of words and their properties
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- Relative Watson-Crick primitivity of words
- On a special class of primitive words
- A relation by palindromic subwords
- The extended equation of Lyndon and Schützenberger
- WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
- HV-Palindromes in Two-Dimensional Words
- Counting (Watson-Crick) palindromes in Watson-Crick conjugates
- Involutive Fibonacci words
- Some properties of involution binary relations
- Watson-Crick Partial Words
- Operation insertion on the conjugacy and commutativity of words
- ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS
- On a Special Class of Primitive Words
- Palindromic richness for languages invariant under more symmetries
- Embedding a \(\theta \)-invariant code into a complete one
This page was built for publication: Watson-Crick Conjugate and Commutative Words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452701)
