Pseudoknot-generating operation

DOI10.1016/J.TCS.2017.07.001zbMath1378.68202OpenAlexW2732417078MaRDI QIDQ2405891

Kai Salomaa, Timothy Ng, Da-Jung Cho, Yo-Sub Han

Publication date: 28 September 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.07.001

zbMATH Keywords

formal languagespseudoknotsclosure and decision propertiespseudoknot-generating operation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Finding common RNA pseudoknot structures in polynomial time
• On pseudoknot-bordered words and their properties
• Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
• Transducer descriptions of DNA code properties and undecidability of antimorphic problems
• Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots
• Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
• Efficient string matching
• Fast Pattern Matching in Strings
• A variant of a recursively unsolvable problem
• Watson-Crick palindromes in DNA computing

This page was built for publication: Pseudoknot-generating operation