Complexity of guided insertion-deletion in RNA-Editing

Authors:
Hans Zantema
Affiliations:
Department of Computer Science, TU Eindhoven, Eindhoven, MB, The Netherlands
Venue:
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Year:
2010

Citing 5
Cited 0

Contextual insertions/deletions and computability

Information and Computation
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
On the computational power of insertion-deletion systems

Natural Computing: an international journal
Context-free insertion-deletion systems

Theoretical Computer Science - Descriptional complexity of formal systems
Regulated RNA rewriting: Modelling RNA editing with guided insertion

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by RNA-editing, we study an elementary formalism of string replacement based on insertion and deletion using a fixed finite set of guides, and in which only occurrences of a single symbol are inserted or deleted. While in this replacement mechanism computation lengths are at most exponential by construction, we show that this exponential upper bound is tight. Moreover, we show that both the class of regular languages and the class of context-free languages are not closed under this replacement mechanism.