Regulated RNA rewriting: Modelling RNA editing with guided insertion

DOI10.1016/J.TCS.2007.07.030zbMath1143.68025OpenAlexW1974556260MaRDI QIDQ2465042

Michael J. Burrell, Franziska Biegler, Mark Daley

Publication date: 19 December 2007

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

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

zbMATH Keywords

formal languagesregulated rewritingRNA editingkinetoplasts

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20) Grammars and rewriting systems (68Q42)

Related Items (14)

On the computational completeness of graph-controlled insertion-deletion systems with binary sizes ⋮ Universality of Graph-controlled Leftist Insertion-deletion Systems with Two States ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ Single semi-contextual insertion-deletion systems ⋮ On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 ⋮ Unnamed Item ⋮ State Complexity of Insertion ⋮ On path-controlled insertion-deletion systems ⋮ Decidability Questions for Insertion Systems and Related Models ⋮ Universal insertion grammars of size two ⋮ Matrix insertion-deletion systems ⋮ Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion ⋮ Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems ⋮ Generating and accepting P systems with minimal left and right insertion and deletion

Cites Work

• Contextual insertions/deletions and computability
• Characterizations of recursively enumerable languages by means of insertion grammars
• Marcus contextual grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regulated RNA rewriting: Modelling RNA editing with guided insertion