Watson-Crick palindromes in DNA computing

DOI10.1007/S11047-009-9131-2MaRDI QIDQ5962061zbMATH OpenOpenAlexWikidataFDO

Authors Lila Kari, Kalpana Mahalingam

Publication date 16 September 2010

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-009-9131-2

zbMATH Keywords

combinatorics of wordsDNA encodingspalindromestheoretical DNA computingWatson-Crick palindromes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Combinatorics in computer science (68R05) Combinatorics on words (68R15)

Recommendations

• Watson-Crick Conjugate and Commutative Words
• Counting (Watson-Crick) palindromes in Watson-Crick conjugates
• Watson-Crick Partial Words
• WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
• Watson-Crick walks and roads on D0L Graphs

Cites work

• \(d\)-minimal languages
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• Coding properties of DNA languages.
• Complexity of Compact Proofreading for Self-assembled Patterns
• Hairpin Structures Defined by DNA Trajectories
• Hairpin Structures in DNA Words
• scientific article; zbMATH DE number 1342095 (Why is no real title available?)
• scientific article; zbMATH DE number 1086496 (Why is no real title available?)
• scientific article; zbMATH DE number 1953221 (Why is no real title available?)
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 2087004 (Why is no real title available?)
• scientific article; zbMATH DE number 1568800 (Why is no real title available?)
• In Search of Optimal Codes for DNA Computing
• Involution Solid and Join Codes
• Involutively bordered words
• On Computational Properties of Template-Guided DNA Recombination
• Pseudopalindrome closure operators in free monoids
• Sticky-free and overhang-free DNA languages
• The equation \(a_ M=b^ Nc^ P\) in a free group
• The syntactic monoid of hairpin-free languages
• Twin-roots of words and their properties
• WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
• Watson-Crick Conjugate and Commutative Words

Cited in

(26)

• Pseudoknot-generating operation
• Counting (Watson-Crick) palindromes in Watson-Crick conjugates
• Some properties of involution palindrome languages
• Solutions to the involution language equation
• WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
• An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
• scientific article; zbMATH DE number 1189114 (Why is no real title available?)
• Palindromic richness for languages invariant under more symmetries
• On generating binary words palindromically
• The pseudopalindromic completion of regular languages
• ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS
• Watson-Crick Partial Words
• Inner palindromic closure
• Disjunctivity and other properties of sets of pseudo-bordered words
• Watson-Crick Conjugate and Commutative Words
• Absent Subsequences in Words
• A relation by palindromic subwords
• State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
• Watson-Crick powers of a word
• HV-Palindromes in Two-Dimensional Words
• Double-ended palindromic trees in linear time
• The syntactic monoid of -free palindromic words
• An extension of the Lyndon-Schützenberger result to pseudoperiodic words
• Watson-Crick conjugates of words and languages
• Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
• On a special class of primitive words

Describes a project that uses

Uses Software

• DNASequenceGenerator

This page was built for publication: Watson-Crick palindromes in DNA computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962061)