Regulated RNA rewriting: Modelling RNA editing with guided insertion

Authors:
Franziska Biegler;Michael J. Burrell;Mark Daley
Affiliations:
Department of Computer Science, University of Western Ontario, London, ON, N6A 5B7, Canada;Department of Computer Science, University of Western Ontario, London, ON, N6A 5B7, Canada;Department of Computer Science, University of Western Ontario, London, ON, N6A 5B7, Canada
Venue:
Theoretical Computer Science
Year:
2007

Citing 6
Cited 3

Formal languages

Formal languages
Contextual insertions/deletions and computability

Information and Computation
Characterizations of recursively enumerable languages by means of insertion grammars

Theoretical Computer Science
Algebraic and Automata-Theoretic Properties of Formal Languages

Algebraic and Automata-Theoretic Properties of Formal Languages
Marcus Contextual Grammars

Marcus Contextual Grammars
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Complexity of guided insertion-deletion in RNA-Editing

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Matrix insertion-deletion systems

Theoretical Computer Science
P systems with minimal left and right insertion and deletion

UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

RNA editing is an important alternative genetic processing event that is known to take place in all higher eukaryotes. We study a model of string rewriting based on the sophisticated RNA editing mechanism found in trypanosome kinetoplasts. We demonstrate basic properties of three principal variants of this model which we show to form a strict hierarchy in terms of expressive power. We also present a method and software for simulating real biological RNA editing via this model and apply the theoretical results to suggest real biological constraints on this process.