RNA interference and Register Machines (extended abstract)

نویسنده

  • Masahiro Hamano
چکیده

RNA interference (RNAi) is a mechanism whereby small RNAs (siRNAs) directly control gene expression without assistance from proteins. This mechanism consists of interactions between RNAs and small RNAs both of which may be single or double stranded. The target of the mechanism is mRNA to be degraded or aberrated, while the initiator is double stranded RNA (dsRNA) to be cleaved into siRNAs. Observing the digital nature of RNAi, we represent RNAi as a Minsky register machine such that (i) The two registers hold single and double stranded RNAs respectively, and (ii) Machine’s instructions are interpreted by interactions of enzyme (Dicer), siRNA (with RISC complex) and polymerization (RdRp) to the appropriate registers. Interpreting RNAi as a computational structure, we can investigate the computational meaning of RNAi, especially its complexity. Initially, the machine is configured as a Chemical Ground Form (CGF), which generates incorrect jumps. To remedy this problem, the system is remodeled as recursive RNAi, in which siRNA targets not only mRNA but also the machine instructional analogues of Dicer and RISC. Finally, probabilistic termination is investigated in the recursive RNAi system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Behavioral Interference of Vibrating Machines Foundations Constructed on Sandy Soils (RESEARCH NOTE)

In this study, dynamic bearing capacity of adjacent shallow strip foundations located on sandy soil was examined using a numerical finite difference modeling, FLAC. The behavioral interference of shallow strip foundations under different conditions was investigated. The effect of soil strength parameters, geometric characteristics of shallow foundations and cyclic loads at different distance ra...

متن کامل

Partitioning transition relations efficiently and automatically

Multiway Decision Graphs (MDGs) have been recently proposed as an eecient representation of Extended Finite State Machines (EFSMs), suitable for automatic hardware veriication of Register Transfer Level (RTL) designs 7, 14]. We report here on the results of our research into automatic partitioning of state transition relations described using MDGs. The objective is to achieve the maximum possib...

متن کامل

Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract)

The register allocation problem for an imperative program is often modelled as the coloring problem of the interference graph of the control-ow graph of the program. The interference graph of a ow graph G is the intersection graph of some connected subgraphs of G. These connected subgraphs represent the lives, or life times, of variables, so the coloring problem models that two variables with o...

متن کامل

Some improvements in fuzzy turing machines

In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...

متن کامل

Ordinal Computability

Ordinal computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines, where α and β bound the time axis and the space axis of some machine model. The spectrum ranges from classical Turing computability to ∞-∞-computability which corresponds to Gödel’s model of constructible sets. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012