Complexity of guided insertion-deletion in RNA-editing

DOI10.1007/978-3-642-13089-2_51MaRDI QIDQ3564900zbMATH OpenOpenAlexFDO

Authors Hans Zantema

Publication date 26 May 2010

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13089-2_51

Mathematics Subject Classification ID

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

Recommendations

• RNA-editing with combined insertion and deletion preserves regularity
• Regulated RNA rewriting: Modelling RNA editing with guided insertion
• scientific article; zbMATH DE number 1953225
• On the computational power of insertion-deletion systems
• Insertion-deletion systems with substitutions. I

Cited in

(4)

• On a method for proving exact bounds on derivational complexity in Thue systems
• Regulated RNA rewriting: Modelling RNA editing with guided insertion
• Transposition based contextual insertion on linear DNA strands with deletion precedence
• RNA-editing with combined insertion and deletion preserves regularity

This page was built for publication: Complexity of guided insertion-deletion in RNA-editing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564900)