On pseudoknot-bordered words and their properties
From MaRDI portal
Publication:1004600
DOI10.1016/j.jcss.2008.08.002zbMath1170.68018OpenAlexW2092237630MaRDI QIDQ1004600
Publication date: 11 March 2009
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2008.08.002
Combinatorics on words (68R15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Protein sequences, DNA sequences (92D20)
Related Items
Pseudoknot-generating operation ⋮ Disjunctive languages related to \(p\)-primitive words ⋮ Disjunctivity and other properties of sets of pseudo-bordered words ⋮ DE BRUIJN SEQUENCES REVISITED ⋮ An extension of the Lyndon-Schützenberger result to pseudoperiodic words
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periodicity and unbordered segments of words
- Tree adjoining grammars for RNA structure prediction
- Monogenic \(e\)-closed languages and dipolar words
- Sticky-free and overhang-free DNA languages
- The syntactic monoid of hairpin-free languages
- INVOLUTIVELY BORDERED WORDS
- Hairpin Structures in DNA Words
- Watson-Crick Conjugate and Commutative Words
- DNA Computing