Counting (Watson-Crick) palindromes in Watson-Crick conjugates
From MaRDI portal
Publication:2672245
Recommendations
Cites work
- Hairpin structures defined by DNA trajectories
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- In Search of Optimal Codes for DNA Computing
- On a special class of primitive words
- On Computational Properties of Template-Guided DNA Recombination
- On periodic properties of circular words
- Pattern Matching with Swaps
- PROPERTIES OF PSEUDO-PRIMITIVE WORDS AND THEIR APPLICATIONS
- Pseudopalindrome closure operators in free monoids
- State complexity of cyclic shift
- String matching with up to k swaps and mismatches
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Watson-Crick Conjugate and Commutative Words
- Watson-Crick palindromes in DNA computing
Cited in
(6)- Watson-Crick Conjugate and Commutative Words
- Watson-Crick palindromes in DNA computing
- Conjugacy languages in virtual graph products
- Fuzzy Fibonacci Arrays and its Application – Symmetrical Fibonacci Dielectric Multilayers in Transmission of Light
- Double-ended palindromic trees in linear time
- Watson-Crick conjugates of words and languages
This page was built for publication: Counting (Watson-Crick) palindromes in Watson-Crick conjugates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2672245)