Age-Dependent Evolution of the Yeast Protein Interaction Network Suggests a Limited Role of Gene Duplication and Divergence

Proteins interact in complex protein–protein interaction (PPI) networks whose topological properties—such as scale-free topology, hierarchical modularity, and dissortativity—have suggested models of network evolution. Currently preferred models invoke preferential attachment or gene duplication and divergence to produce networks whose topology matches that observed for real PPIs, thus supporting these as likely models for network evolution. Here, we show that the interaction density and homodimeric frequency are highly protein age–dependent in real PPI networks in a manner which does not agree with these canonical models. In light of these results, we propose an alternative stochastic model, which adds each protein sequentially to a growing network in a manner analogous to protein crystal growth (CG) in solution. The key ideas are (1) interaction probability increases with availability of unoccupied interaction surface, thus following an anti-preferential attachment rule, (2) as a network grows, highly connected sub-networks emerge into protein modules or complexes, and (3) once a new protein is committed to a module, further connections tend to be localized within that module. The CG model produces PPI networks consistent in both topology and age distributions with real PPI networks and is well supported by the spatial arrangement of protein complexes of known 3-D structure, suggesting a plausible physical mechanism for network evolution

Group II Intron Protein Localization and Insertion Sites Are Affected by Polyphosphate

Mobile group II introns consist of a catalytic intron RNA and an intron-encoded protein with reverse transcriptase activity, which act together in a ribonucleoprotein particle to promote DNA integration during intron mobility. Previously, we found that the Lactococcus lactis Ll.LtrB intron-encoded protein (LtrA) expressed alone or with the intron RNA to form ribonucleoprotein particles localizes to bacterial cellular poles, potentially accounting for the intron's preferential insertion in the oriC and ter regions of the Escherichia coli chromosome. Here, by using cell microarrays and automated fluorescence microscopy to screen a transposon-insertion library, we identified five E. coli genes (gppA, uhpT, wcaK, ynbC, and zntR) whose disruption results in both an increased proportion of cells with more diffuse LtrA localization and a more uniform genomic distribution of Ll.LtrB-insertion sites. Surprisingly, we find that a common factor affecting LtrA localization in these and other disruptants is the accumulation of intracellular polyphosphate, which appears to bind LtrA and other basic proteins and delocalize them away from the poles. Our findings show that the intracellular localization of a group II intron-encoded protein is a major determinant of insertion-site preference. More generally, our results suggest that polyphosphate accumulation may provide a means of localizing proteins to different sites of action during cellular stress or entry into stationary phase, with potentially wide physiological consequences.This work was supported by National Institutes of Health R01 grants GM037949 to AML and GM076536 to EMM, Welch Foundation grants F-1607 to AML and F-1515 to EMM, and a Packard Foundation fellowship to EMM.Cellular and Molecular Biolog

Buffering by gene duplicates: an analysis of molecular correlates and evolutionary conservation

<p>Abstract</p> <p>Background</p> <p>One mechanism to account for robustness against gene knockouts or knockdowns is through buffering by gene duplicates, but the extent and general correlates of this process in organisms is still a matter of debate. To reveal general trends of this process, we provide a comprehensive comparison of gene essentiality, duplication and buffering by duplicates across seven bacteria (<it>Mycoplasma genitalium, Bacillus subtilis, Helicobacter pylori, Haemophilus influenzae, Mycobacterium tuberculosis, Pseudomonas aeruginosa, Escherichia coli</it>), and four eukaryotes (<it>Saccharomyces cerevisiae </it>(yeast), <it>Caenorhabditis elegans </it>(worm), <it>Drosophila melanogaster </it>(fly), <it>Mus musculus </it>(mouse)).</p> <p>Results</p> <p>In nine of the eleven organisms, duplicates significantly increase chances of survival upon gene deletion (P-value ≤ 0.05), but only by up to 13%. Given that duplicates make up to 80% of eukaryotic genomes, the small contribution is surprising and points to dominant roles of other buffering processes, such as alternative metabolic pathways. The buffering capacity of duplicates appears to be independent of the degree of gene essentiality and tends to be higher for genes with high expression levels. For example, buffering capacity increases to 23% amongst highly expressed genes in <it>E. coli</it>. Sequence similarity and the number of duplicates per gene are weak predictors of the duplicate's buffering capacity. In a case study we show that buffering gene duplicates in yeast and worm are somewhat more similar in their functions than non-buffering duplicates and have increased transcriptional and translational activity.</p> <p>Conclusion</p> <p>In sum, the extent of gene essentiality and buffering by duplicates is not conserved across organisms and does not correlate with the organisms' apparent complexity. This heterogeneity goes beyond what would be expected from differences in experimental approaches alone. Buffering by duplicates contributes to robustness in several organisms, but to a small extent – and the relatively large amount of buffering by duplicates observed in yeast and worm may be largely specific to these organisms. Thus, the only common factor of buffering by duplicates between different organisms may be the by-product of duplicate retention due to demands of high dosage.</p

Transiently Transfected Purine Biosynthetic Enzymes Form Stress Bodies

It has been hypothesized that components of enzymatic pathways might organize into intracellular assemblies to improve their catalytic efficiency or lead to coordinate regulation. Accordingly, de novo purine biosynthesis enzymes may form a purinosome in the absence of purines, and a punctate intracellular body has been identified as the purinosome. We investigated the mechanism by which human de novo purine biosynthetic enzymes might be organized into purinosomes, especially under differing cellular conditions. Irregardless of the activity of bodies formed by endogenous enzymes, we demonstrate that intracellular bodies formed by transiently transfected, fluorescently tagged human purine biosynthesis proteins are best explained as protein aggregation.This work was supported by grants from the United States National Institutes of Health, National Science Foundation, and Welch (F1515) and Packard Foundations to EMM. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.Cellular and Molecular Biolog

Prediction of gene–phenotype associations in humans, mice, and plants using phenologs

All authors are with the Center for Systems and Synthetic Biology, Institute for Cellular and Molecular Biology, The University of Texas at Austin, Austin, TX 78712, USA. -- Ulf Martin Singh-Blom is with the Program in Computational and Applied Mathematics, The University of Texas at Austin, Austin, TX 78712, USA, and th Unit of Computational Medicine, Department of Medicine, Karolinska Institutet, Stockholm 171 76, Sweden. -- Kriston L. McGary is with the Department of Biological Sciences, Vanderbilt University, Nashville, TN 37235, USA.Background: Phenotypes and diseases may be related to seemingly dissimilar phenotypes in other species by means of the orthology of underlying genes. Such “orthologous phenotypes,” or “phenologs,” are examples of deep homology, and may be used to predict additional candidate disease genes. Results: In this work, we develop an unsupervised algorithm for ranking phenolog-based candidate disease genes through the integration of predictions from the k nearest neighbor phenologs, comparing classifiers and weighting functions by cross-validation. We also improve upon the original method by extending the theory to paralogous phenotypes. Our algorithm makes use of additional phenotype data — from chicken, zebrafish, and E. coli, as well as new datasets for C. elegans — establishing that several types of annotations may be treated as phenotypes. We demonstrate the use of our algorithm to predict novel candidate genes for human atrial fibrillation (such as HRH2, ATP4A, ATP4B, and HOPX) and epilepsy (e.g., PAX6 and NKX2-1). We suggest gene candidates for pharmacologically-induced seizures in mouse, solely based on orthologous phenotypes from E. coli. We also explore the prediction of plant gene–phenotype associations, as for the Arabidopsis response to vernalization phenotype. Conclusions: We are able to rank gene predictions for a significant portion of the diseases in the Online Mendelian Inheritance in Man database. Additionally, our method suggests candidate genes for mammalian seizures based only on bacterial phenotypes and gene orthology. We demonstrate that phenotype information may come from diverse sources, including drug sensitivities, gene ontology biological processes, and in situ hybridization annotations. Finally, we offer testable candidates for a variety of human diseases, plant traits, and other classes of phenotypes across a wide array of species.Center for Systems and Synthetic BiologyInstitute for Cellular and Molecular [email protected]

Age-Dependent Evolution of the Yeast Protein Interaction Network Suggests a Limited Role of Gene Duplication and Divergence

Proteins interact in complex protein–protein interaction (PPI) networks whose topological properties—such as scale-free topology, hierarchical modularity, and dissortativity—have suggested models of network evolution. Currently preferred models invoke preferential attachment or gene duplication and divergence to produce networks whose topology matches that observed for real PPIs, thus supporting these as likely models for network evolution. Here, we show that the interaction density and homodimeric frequency are highly protein age–dependent in real PPI networks in a manner which does not agree with these canonical models. In light of these results, we propose an alternative stochastic model, which adds each protein sequentially to a growing network in a manner analogous to protein crystal growth (CG) in solution. The key ideas are (1) interaction probability increases with availability of unoccupied interaction surface, thus following an anti-preferential attachment rule, (2) as a network grows, highly connected sub-networks emerge into protein modules or complexes, and (3) once a new protein is committed to a module, further connections tend to be localized within that module. The CG model produces PPI networks consistent in both topology and age distributions with real PPI networks and is well supported by the spatial arrangement of protein complexes of known 3-D structure, suggesting a plausible physical mechanism for network evolution

Inferring mouse gene functions from genomic-scale data using a combined functional network/classification strategy

The complete set of mouse genes, as with the set of human genes, is still largely uncharacterized, with many pieces of experimental evidence accumulating regarding the activities and expression of the genes, but the majority of genes as yet still of unknown function. Within the context of the MouseFunc competition, we developed and applied two distinct large-scale data mining approaches to infer the functions (Gene Ontology annotations) of mouse genes from experimental observations from available functional genomics, proteomics, comparative genomics, and phenotypic data. The two strategies — the first using classifiers to map features to annotations, the second propagating annotations from characterized genes to uncharacterized genes along edges in a network constructed from the features — offer alternative and possibly complementary approaches to providing functional annotations. Here, we re-implement and evaluate these approaches and their combination for their ability to predict the proper functional annotations of genes in the MouseFunc data set. We show that, when controlling for the same set of input features, the network approach generally outperformed a naïve Bayesian classifier approach, while their combination offers some improvement over either independently. We make our observations of predictive performance on the MouseFunc competition hold-out set, as well as on a ten-fold cross-validation of the MouseFunc data. Across all 1,339 annotated genes in the MouseFunc test set, the median predictive power was quite strong (median area under a receiver operating characteristic plot of 0.865 and average precision of 0.195), indicating that a mining-based strategy with existing data is a promising path towards discovering mammalian gene functions. As one product of this work, a high-confidence subset of the functional mouse gene network was produced — spanning >70% of mouse genes with >1.6 million associations — that is predictive of mouse (and therefore often human) gene function and functional associations. The network should be generally useful for mammalian gene functional analyses, such as for predicting interactions, inferring functional connections between genes and pathways, and prioritizing candidate genes. The network and all predictions are available on the worldwide web

Broad network-based predictability of Saccharomyces cerevisiae gene loss-of-function phenotypes

Loss-of-function phenotypes of yeast genes can be predicted from the loss-of-function phenotypes of their neighbours in functional gene networks. This could potentially be applied to the prediction of human disease genes