Jalihal, A. P. | bioRxiv Science

bioRxiv2018

Dynamic recruitment of single RNAs to processing bodies depends on RNA functionality

Cellular RNAs often colocalize with cytoplasmic, membrane-less ribonucleoprotein (RNP) granules enriched for RNA processing enzymes, termed processing bodies (PBs). Here, we track the dynamic localization of individual miRNAs, mRNAs and long non-coding RNAs (lncRNAs) to PBs using intracellular single-molecule fluorescence microscopy. We find that unused miRNAs stably bind to PBs, whereas functional miRNAs, repressed mRNAs and lncRNAs both transiently and stably localize within either the core or periphery of PBs, albeit to different extents. Consequently, translation potential and positioning of cis-regulatory elements significantly impact PB-localization dynamics of mRNAs. Using computational modeling and supporting experimental approaches we show that phase separation into large PBs attenuates mRNA silencing, suggesting that physiological mRNA turnover predominantly occurs outside of PBs. Instead, our data support a role for PBs in sequestering unused miRNAs to regulate their surveillance and provides a framework for investigating the dynamic assembly of RNP granules by phase separation at single-molecule resolution.

molecular biology↗

bioRxiv2018

Efficient Synthesis of Mutants Using Genetic Crosses

The genetic cross is a fundamental, flexible, and widely-used experimental technique to create new mutant strains from existing ones. Surprisingly, the problem of how to efficiently compute a sequence of crosses that can make a desired target mutant from a set of source mutants has received scarce attention. In this paper, we make three contributions to this question.\n\nFirst, we formulate several natural problems related to efficient synthesis of a target mutant from source mutants. Our formulations capture experimentally-useful notions of verifiability (e.g the need to confirm that a mutant contains mutations in the desired genes) and permissibility (e.g., the requirement that no intermediate mutants in the synthesis be inviable).\n\nSecond, we develop combinatorial techniques to solve these problems. We prove that checking the existence of a verifiable, permissible synthesis is NP-complete in general. We complement this result with three polynomial time or fixed-parameter tractable algorithms for optimal synthesis of a target mutant for special cases of the problem that arise in practice.\n\nThird, we apply these algorithms to simulated data and to synthetic data. We use results from simulations of a mathematical model of the cell cycle to replicate realistic experimental scenarios where a biologist may be interested in creating several mutants in order to verify model predictions. Our results show that the consideration of permissible mutants can affect the existence of a synthesis or the number of crosses in an optimal one. Our algorithms gracefully handle the restrictions that permissible mutants impose. Results on synthetic data show that our algorithms scale well with increases in the size of the input and the fixed parameters.

systems biology↗