Regulated RNA rewriting: Modelling RNA editing with guided insertion
暂无分享,去创建一个
[1] Lila Kari,et al. On the weight of universal insertion grammars , 2008, Theor. Comput. Sci..
[2] Lila Kari,et al. On Insertion and Deletion in Formal Languages , 1991 .
[3] Alexander Rich,et al. Widespread A-to-I RNA Editing of Alu-Containing mRNAs in the Human Transcriptome , 2004, PLoS biology.
[4] Gheorghe Paun. Two theorems about Galiukschov semicontextual languages , 1985, Kybernetika.
[5] M. W. Shields. An Introduction to Automata Theory , 1988 .
[6] Grzegorz Rozenberg,et al. Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.
[7] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[8] Gheorghe Paun,et al. DNA Computing , 1998, Texts in Theoretical Computer Science.
[9] Carlos Martín-Vide,et al. Characterizations of Recursively Enumerable Languages by Means of Insertion Grammars , 1998, Theor. Comput. Sci..
[10] Seymour Ginsburg,et al. Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .
[11] L. Landweber,et al. Rewriting the information in DNA: RNA editing in kinetoplastids and myxomycetes. , 2002, Current opinion in microbiology.
[12] Gheorghe Paun,et al. Marcus Contextual Grammars , 1994, Bull. EATCS.
[13] Christian Choffrut,et al. Combinatorics of Words , 1997, Handbook of Formal Languages.
[14] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[15] Lila Kari,et al. Contextual Insertions/Deletions and Computability , 1996, Inf. Comput..
[16] David I. Lewin,et al. DNA computing , 2002, Comput. Sci. Eng..