Pages that link to "Item:Q5962061"
From MaRDI portal
The following pages link to Watson-Crick palindromes in DNA computing (Q5962061):
Displayed 21 items.
- Palindromic richness for languages invariant under more symmetries (Q391781) (← links)
- On generating binary words palindromically (Q472173) (← links)
- The pseudopalindromic completion of regular languages (Q476182) (← links)
- Disjunctivity and other properties of sets of pseudo-bordered words (Q530214) (← links)
- A relation by palindromic subwords (Q609026) (← links)
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words (Q716329) (← links)
- Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words (Q765352) (← links)
- On a special class of primitive words (Q844893) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Pseudoknot-generating operation (Q2405891) (← links)
- Counting (Watson-Crick) palindromes in Watson-Crick conjugates (Q2672245) (← links)
- Some properties of involution palindrome languages (Q3066983) (← links)
- Solutions to the involution language equation (Q3101624) (← links)
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words (Q3637224) (← links)
- ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS (Q4902893) (← links)
- Watson-Crick Partial Words (Q5055986) (← links)
- INNER PALINDROMIC CLOSURE (Q5247174) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata (Q6095517) (← links)
- Watson-Crick powers of a word (Q6108728) (← links)
- HV-Palindromes in Two-Dimensional Words (Q6114875) (← links)