Functional modules in the Arabidopsis core cell cycle binary protein-protein interaction network

As in other eukaryotes, cell division in plants is highly conserved and regulated by cyclin-dependent kinases (CDKs) that are themselves predominantly regulated at the posttranscriptional level by their association with proteins such as cyclins. Although over the last years the knowledge of the plant cell cycle has considerably increased, little is known on the assembly and regulation of the different CDK complexes. To map protein-protein interactions between core cell cycle proteins of Arabidopsis thaliana, a binary protein-protein interactome network was generated using two complementary high-throughput interaction assays, yeast two-hybrid and bimolecular fluorescence complementation. Pairwise interactions among 58 core cell cycle proteins were tested, resulting in 357 interactions, of which 293 have not been reported before. Integration of the binary interaction results with cell cycle phase-dependent expression information and localization data allowed the construction of a dynamic interaction network. The obtained interaction map constitutes a framework for further in-depth analysis of the cell cycle machinery

Conserved noncoding sequences highlight shared components of regulatory networks in dicotyledonous plants

Conserved noncoding sequences (CNSs) in DNA are reliable pointers to regulatory elements controlling gene expression. Using a comparative genomics approach with four dicotyledonous plant species (Arabidopsis thaliana, papaya [Carica papaya], poplar [Populus trichocarpa], and grape [Vitis vinifera]), we detected hundreds of CNSs upstream of Arabidopsis genes. Distinct positioning, length, and enrichment for transcription factor binding sites suggest these CNSs play a functional role in transcriptional regulation. The enrichment of transcription factors within the set of genes associated with CNS is consistent with the hypothesis that together they form part of a conserved transcriptional network whose function is to regulate other transcription factors and control development. We identified a set of promoters where regulatory mechanisms are likely to be shared between the model organism Arabidopsis and other dicots, providing areas of focus for further research

Circadian rhythms and post-transcriptional regulation in higher plants

The circadian clock of plants allows them to cope with daily changes in their environment. This is accomplished by the rhythmic regulation of gene expression, in a process that involves many regulatory steps. One of the key steps involved at the RNA level is post-transcriptional regulation, which ensures a correct control on the different amounts and types of mRNA that will ultimately define the current physiological state of the plant cell. Recent advances in the study of the processes of regulation of pre-mRNA processing, RNA turn-over and surveillance, regulation of translation, function of lncRNAs, biogenesis and function of small RNAs, and the development of bioinformatics tools have helped to vastly expand our understanding of how this regulatory step performs its role. In this work we review the current progress in circadian regulation at the post-transcriptional level research in plants. It is the continuous interaction of all the information flow control post-transcriptional processes that allow a plant to precisely time and predict daily environmental changes.Fil: Romanowski, Andrés. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario. Instituto de Investigaciones Bioquímicas de Buenos Aires. Fundación Instituto Leloir. Instituto de Investigaciones Bioquímicas de Buenos Aires; ArgentinaFil: Yanovsky, Marcelo Javier. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Parque Centenario. Instituto de Investigaciones Bioquímicas de Buenos Aires. Fundación Instituto Leloir. Instituto de Investigaciones Bioquímicas de Buenos Aires; Argentin

A temporal precedence based clustering method for gene expression microarray data

Background: Time-course microarray experiments can produce useful data which can help in understanding the underlying dynamics of the system. Clustering is an important stage in microarray data analysis where the data is grouped together according to certain characteristics. The majority of clustering techniques are based on distance or visual similarity measures which may not be suitable for clustering of temporal microarray data where the sequential nature of time is important. We present a Granger causality based technique to cluster temporal microarray gene expression data, which measures the interdependence between two time-series by statistically testing if one time-series can be used for forecasting the other time-series or not. Results: A gene-association matrix is constructed by testing temporal relationships between pairs of genes using the Granger causality test. The association matrix is further analyzed using a graph-theoretic technique to detect highly connected components representing interesting biological modules. We test our approach on synthesized datasets and real biological datasets obtained for Arabidopsis thaliana. We show the effectiveness of our approach by analyzing the results using the existing biological literature. We also report interesting structural properties of the association network commonly desired in any biological system. Conclusions: Our experiments on synthesized and real microarray datasets show that our approach produces encouraging results. The method is simple in implementation and is statistically traceable at each step. The method can produce sets of functionally related genes which can be further used for reverse-engineering of gene circuits

Mining Biological Networks towards Protein complex Detection and Gene-Disease Association

Large amounts of biological data are continuously generated nowadays, thanks to the advancements of high-throughput experimental techniques. Mining valuable knowledge from such data still motivates the design of suitable computational methods, to complement the experimental work which is often bound by considerable time and cost requirements. Protein complexes or groups of interacting proteins, are key players in most cellular events. The identification of complexes not only allows to better understand normal biological processes but also to uncover Disease-triggering malfunctions. Ultimately, findings in this research branch can highly enhance the design of effective medical treatments. The aim of this research is to detect protein complexes in protein-protein interaction networks and to associate the detected entities to diseases. The work is divided into three main objectives: first, develop a suitable method for the identification of protein complexes in static interaction networks; second, model the dynamic aspect of protein interaction networks and detect complexes accordingly; and third, design a learning model to link proteins, and subsequently protein complexes, to diseases. In response to these objectives, we present, ProRank+, a novel complex-detection approach based on a ranking algorithm and a merging procedure. Then, we introduce DyCluster, which uses gene expression data, to model the dynamics of the interaction networks, and we adapt the detection algorithm accordingly. Finally, we integrate network topology attributes and several biological features of proteins to form a classification model for gene-disease association. The reliability of the proposed methods is supported by various experimental studies conducted to compare them with existing approaches. Pro Rank+ detects more protein complexes than other state-of-the-art methods. DyCluster goes a step further and achieves a better performance than similar techniques. Then, our learning model shows that combining topological and biological features can greatly enhance the gene-disease association process. Finally, we present a comprehensive case study of breast cancer in which we pinpoint disease genes using our learning model; subsequently, we detect favorable groupings of those genes in a protein interaction network using the Pro-rank+ algorithm

RNA-binding protein immunoprecipitation as a tool to investigate plant miRNA processing interference by regulatory proteins of diverse origin

Background: Due to the nature of viral RNA genomes, RNA viruses depend on many RNA-binding proteins (RBP) of viral and host origin for replication, dissemination and evasion of host RNA degradation pathways. Some viruses interfere with the microRNA (miRNA) pathway to generate better fitness. The development of an adjusted, reliable and sensitive ribonucleoprotein immunoprecipitation (RIP) assay is needed to study the interaction between RBP of different origin (including viral origin) and miRNA precursors. The method could be further applied to transiently expressed heterologous proteins in different plant species. Results: Here we describe a modified RIP assay applied to nuclear epitope-tagged proteins of heterologous origin and transiently expressed in Nicotiana benthamiana. The assay includes a combination of optimized steps as well as the careful selection of control samples and rigorous data analysis. It has proven efficient to detect and quantify miRNA processing intermediates associated with regulatory proteins. Conclusions: The RIP method described here provides a reliable tool to study the interaction of RBPs, such as transiently expressed regulatory proteins with lowly represented host RNA, as is the case of miRNA precursors. This modified method was efficiently adjusted to recover nuclear proteins and reduce unspecific background. The purification scheme optimized here for GFP-tagged proteins can be applied to a wide array of RBPs. The subsequent application of next-generation sequencing technologies will permit to sequence and characterize all RNA species bound in vivo by a given RBP.Fil: Marmisollé, Facundo Ernesto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Biotecnología y Biología Molecular. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Biotecnología y Biología Molecular; ArgentinaFil: Garcia, Maria Laura. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Biotecnología y Biología Molecular. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Biotecnología y Biología Molecular; ArgentinaFil: Reyes Martinez, Carina Andrea. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Biotecnología y Biología Molecular. Universidad Nacional de La Plata. Facultad de Ciencias Exactas. Instituto de Biotecnología y Biología Molecular; Argentin

Ranking relations using analogies in biological and information networks

Analogical reasoning depends fundamentally on the ability to learn and generalize about relations between objects. We develop an approach to relational learning which, given a set of pairs of objects $\mathbf{S}=\{A^{(1)}:B^{(1)},A^{(2)}:B^{(2)},\ldots,A^{(N)}:B ^{(N)}\}$, measures how well other pairs A:B fit in with the set $\mathbf{S}$. Our work addresses the following question: is the relation between objects A and B analogous to those relations found in $\mathbf{S}$? Such questions are particularly relevant in information retrieval, where an investigator might want to search for analogous pairs of objects that match the query set of interest. There are many ways in which objects can be related, making the task of measuring analogies very challenging. Our approach combines a similarity measure on function spaces with Bayesian analysis to produce a ranking. It requires data containing features of the objects of interest and a link matrix specifying which relationships exist; no further attributes of such relationships are necessary. We illustrate the potential of our method on text analysis and information networks. An application on discovering functional interactions between pairs of proteins is discussed in detail, where we show that our approach can work in practice even if a small set of protein pairs is provided.Comment: Published in at http://dx.doi.org/10.1214/09-AOAS321 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org