Differential genetic interactions of yeast stress response MAPK pathways.

Genetic interaction screens have been applied with great success in several organisms to study gene function and the genetic architecture of the cell. However, most studies have been performed under optimal growth conditions even though many functional interactions are known to occur under specific cellular conditions. In this study, we have performed a large-scale genetic interaction analysis in Saccharomyces cerevisiae involving approximately 49 × 1,200 double mutants in the presence of five different stress conditions, including osmotic, oxidative and cell wall-altering stresses. This resulted in the generation of a differential E-MAP (or dE-MAP) comprising over 250,000 measurements of conditional interactions. We found an extensive number of conditional genetic interactions that recapitulate known stress-specific functional associations. Furthermore, we have also uncovered previously unrecognized roles involving the phosphatase regulator Bud14, the histone methylation complex COMPASS and membrane trafficking complexes in modulating the cell wall integrity pathway. Finally, the osmotic stress differential genetic interactions showed enrichment for genes coding for proteins with conditional changes in phosphorylation but not for genes with conditional changes in gene expression. This suggests that conditional genetic interactions are a powerful tool to dissect the functional importance of the different response mechanisms of the cell

Risk-Averse Matchings over Uncertain Graph Databases

A large number of applications such as querying sensor networks, and analyzing protein-protein interaction (PPI) networks, rely on mining uncertain graph and hypergraph databases. In this work we study the following problem: given an uncertain, weighted (hyper)graph, how can we efficiently find a (hyper)matching with high expected reward, and low risk? This problem naturally arises in the context of several important applications, such as online dating, kidney exchanges, and team formation. We introduce a novel formulation for finding matchings with maximum expected reward and bounded risk under a general model of uncertain weighted (hyper)graphs that we introduce in this work. Our model generalizes probabilistic models used in prior work, and captures both continuous and discrete probability distributions, thus allowing to handle privacy related applications that inject appropriately distributed noise to (hyper)edge weights. Given that our optimization problem is NP-hard, we turn our attention to designing efficient approximation algorithms. For the case of uncertain weighted graphs, we provide a $\frac{1}{3}$-approximation algorithm, and a $\frac{1}{5}$-approximation algorithm with near optimal run time. For the case of uncertain weighted hypergraphs, we provide a $\Omega(\frac{1}{k})$-approximation algorithm, where $k$ is the rank of the hypergraph (i.e., any hyperedge includes at most $k$ nodes), that runs in almost (modulo log factors) linear time. We complement our theoretical results by testing our approximation algorithms on a wide variety of synthetic experiments, where we observe in a controlled setting interesting findings on the trade-off between reward, and risk. We also provide an application of our formulation for providing recommendations of teams that are likely to collaborate, and have high impact.Comment: 25 page

Identifying protein complexes directly from high-throughput TAP data with Markov random fields

<p>Abstract</p> <p>Background</p> <p>Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms to reconstruct the complexes typically rely on a two-step process. First, they construct an interaction graph from the data, predominantly using heuristics, and subsequently cluster its vertices to identify protein complexes.</p> <p>Results</p> <p>We propose a model-based identification of protein complexes directly from the experimental observations. Our model of protein complexes based on Markov random fields explicitly incorporates false negative and false positive errors and exhibits a high robustness to noise. A model-based quality score for the resulting clusters allows us to identify reliable predictions in the complete data set. Comparisons with prior work on reference data sets shows favorable results, particularly for larger unfiltered data sets. Additional information on predictions, including the source code under the GNU Public License can be found at http://algorithmics.molgen.mpg.de/Static/Supplements/ProteinComplexes.</p> <p>Conclusion</p> <p>We can identify complexes in the data obtained from high-throughput experiments without prior elimination of proteins or weak interactions. The few parameters of our model, which does not rely on heuristics, can be estimated using maximum likelihood without a reference data set. This is particularly important for protein complex studies in organisms that do not have an established reference frame of known protein complexes.</p

WordCloud: a Cytoscape plugin to create a visual semantic summary of networks

<p>Abstract</p> <p>Background</p> <p>When biological networks are studied, it is common to look for clusters, i.e. sets of nodes that are highly inter-connected. To understand the biological meaning of a cluster, the user usually has to sift through many textual annotations that are associated with biological entities.</p> <p>Findings</p> <p>The WordCloud Cytoscape plugin generates a visual summary of these annotations by displaying them as a tag cloud, where more frequent words are displayed using a larger font size. Word co-occurrence in a phrase can be visualized by arranging words in clusters or as a network.</p> <p>Conclusions</p> <p>WordCloud provides a concise visual summary of annotations which is helpful for network analysis and interpretation. WordCloud is freely available at <url>http://baderlab.org/Software/WordCloudPlugin</url></p

Combinatorial CRISPR-Cas9 screens for de novo mapping of genetic interactions.

We developed a systematic approach to map human genetic networks by combinatorial CRISPR-Cas9 perturbations coupled to robust analysis of growth kinetics. We targeted all pairs of 73 cancer genes with dual guide RNAs in three cell lines, comprising 141,912 tests of interaction. Numerous therapeutically relevant interactions were identified, and these patterns replicated with combinatorial drugs at 75% precision. From these results, we anticipate that cellular context will be critical to synthetic-lethal therapies

Human RNA Polymerase II-Association Factor 1 (hPaf1/PD2) Regulates Histone Methylation and Chromatin Remodeling in Pancreatic Cancer

Change in gene expression associated with pancreatic cancer could be attributed to the variation in histone posttranslational modifications leading to subsequent remodeling of the chromatin template during transcription. However, the interconnected network of molecules involved in regulating such processes remains elusive. hPaf1/PD2, a subunit of the human PAF-complex, involved in the regulation of transcriptional elongation has oncogenic potential. Our study explores the possibility that regulation of histone methylation by hPaf1 can contribute towards alteration in gene expression by nucleosomal rearrangement. Here, we show that knockdown of hPaf1/PD2 leads to decreased di- and tri-methylation at histone H3 lysine 4 residues in pancreatic cancer cells. Interestingly, hPaf1/PD2 colocalizes with MLL1 (Mixed Lineage Leukemia 1), a histone methyltransferase that methylates H3K4 residues. Also, a reduction in hPaf1 level resulted in reduced MLL1 expression and a corresponding decrease in the level of CHD1 (Chromohelicase DNA-binding protein 1), an ATPase dependent chromatin remodeling enzyme that specifically binds to H3K4 di and trimethyl marks. hPaf1/PD2 was also found to interact and colocalize with CHD1 in both cytoplasmic and nuclear extracts of pancreatic cancer cells. Further, reduced level of CHD1 localization in the nucleus in hPaf1/PD2 Knockdown cells could be rescued by ectopic expression of hPaf1/PD2. Micrococcal nuclease digestion showed an altered chromatin structure in hPaf1/PD2-KD cells. Overall, our results suggest that hPaf1/PD2 in association with MLL1 regulates methylation of H3K4 residues, as well as interacts and regulates nuclear shuttling of chromatin remodeling protein CHD1, facilitating its function in pancreatic cancer cells

Hepatitis C virus infects and perturbs liver stem cells

Hepatitis C virus (HCV) is the leading cause of death from liver disease. How HCV infection causes lasting liver damage and increases cancer risk remains unclear. Here, we identify bipotent liver stem cells as novel targets for HCV infection, and their erroneous differentiation as the potential cause of impaired liver regeneration and cancer development. We show 3D organoids generated from liver stem cells from actively HCV-infected individuals carry replicating virus and maintain low-grade infection over months. Organoids can be infected with a primary HCV isolate. Virus-inclusive single-cell RNA sequencing uncovered transcriptional reprogramming in HCV+ cells supporting hepatocytic differentiation, cancer stem cell development, and viral replication while stem cell proliferation and interferon signaling are disrupted. Our data add a new pathogenesis mechanism—infection of liver stem cells—to the biology of HCV infection that may explain progressive liver damage and enhanced cancer risk through an altered stem cell state

MCL-CAw: A refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure

Abstract Background The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of the cell. Over the past few years, several independent high-throughput experiments have helped to catalogue enormous amount of physical protein interaction data from organisms such as yeast. However, these individual datasets show lack of correlation with each other and also contain substantial number of false positives (noise). Over these years, several affinity scoring schemes have also been devised to improve the qualities of these datasets. Therefore, the challenge now is to detect meaningful as well as novel complexes from protein interaction (PPI) networks derived by combining datasets from multiple sources and by making use of these affinity scoring schemes. In the attempt towards tackling this challenge, the Markov Clustering algorithm (MCL) has proved to be a popular and reasonably successful method, mainly due to its scalability, robustness, and ability to work on scored (weighted) networks. However, MCL produces many noisy clusters, which either do not match known complexes or have additional proteins that reduce the accuracies of correctly predicted complexes. Results Inspired by recent experimental observations by Gavin and colleagues on the modularity structure in yeast complexes and the distinctive properties of "core" and "attachment" proteins, we develop a core-attachment based refinement method coupled to MCL for reconstruction of yeast complexes from scored (weighted) PPI networks. We combine physical interactions from two recent "pull-down" experiments to generate an unscored PPI network. We then score this network using available affinity scoring schemes to generate multiple scored PPI networks. The evaluation of our method (called MCL-CAw) on these networks shows that: (i) MCL-CAw derives larger number of yeast complexes and with better accuracies than MCL, particularly in the presence of natural noise; (ii) Affinity scoring can effectively reduce the impact of noise on MCL-CAw and thereby improve the quality (precision and recall) of its predicted complexes; (iii) MCL-CAw responds well to most available scoring schemes. We discuss several instances where MCL-CAw was successful in deriving meaningful complexes, and where it missed a few proteins or whole complexes due to affinity scoring of the networks. We compare MCL-CAw with several recent complex detection algorithms on unscored and scored networks, and assess the relative performance of the algorithms on these networks. Further, we study the impact of augmenting physical datasets with computationally inferred interactions for complex detection. Finally, we analyse the essentiality of proteins within predicted complexes to understand a possible correlation between protein essentiality and their ability to form complexes. Conclusions We demonstrate that core-attachment based refinement in MCL-CAw improves the predictions of MCL on yeast PPI networks. We show that affinity scoring improves the performance of MCL-CAw.http://deepblue.lib.umich.edu/bitstream/2027.42/78256/1/1471-2105-11-504.xmlhttp://deepblue.lib.umich.edu/bitstream/2027.42/78256/2/1471-2105-11-504-S1.PDFhttp://deepblue.lib.umich.edu/bitstream/2027.42/78256/3/1471-2105-11-504-S2.ZIPhttp://deepblue.lib.umich.edu/bitstream/2027.42/78256/4/1471-2105-11-504.pdfPeer Reviewe

Unphosphorylated SR-Like Protein Npl3 Stimulates RNA Polymerase II Elongation

The production of a functional mRNA is regulated at every step of transcription. An area not well-understood is the transition of RNA polymerase II from elongation to termination. The S. cerevisiae SR-like protein Npl3 functions to negatively regulate transcription termination by antagonizing the binding of polyA/termination proteins to the mRNA. In this study, Npl3 is shown to interact with the CTD and have a direct stimulatory effect on the elongation activity of the polymerase. The interaction is inhibited by phosphorylation of Npl3. In addition, Casein Kinase 2 was found to be required for the phosphorylation of Npl3 and affect its ability to compete against Rna15 (Cleavage Factor I) for binding to polyA signals. Our results suggest that phosphorylation of Npl3 promotes its dissociation from the mRNA/RNAP II, and contributes to the association of the polyA/termination factor Rna15. This work defines a novel role for Npl3 in elongation and its regulation by phosphorylation