Robust Inference of Kinase Activity Using Functional Networks

Mass spectrometry enables high-throughput screening of phosphoproteins across a broad range of biological contexts. When complemented by computational algorithms, phospho-proteomic data allows the inference of kinase activity, facilitating the identification of dysregulated kinases in various diseases including cancer, Alzheimer’s disease and Parkinson’s disease. To enhance the reliability of kinase activity inference, we present a network-based framework, RoKAI, that integrates various sources of functional information to capture coordinated changes in signaling. Through computational experiments, we show that phosphorylation of sites in the functional neighborhood of a kinase are significantly predictive of its activity. The incorporation of this knowledge in RoKAI consistently enhances the accuracy of kinase activity inference methods while making them more robust to missing annotations and quantifications. This enables the identification of understudied kinases and will likely lead to the development of novel kinase inhibitors for targeted therapy of many diseases. RoKAI is available as web-based tool at http://rokai.io

Temporal and Sex-Linked Protein Expression Dynamics in a Familial Model of Alzheimer\u27s Disease

Mouse models of Alzheimer\u27s disease (AD) show progression through stages reflective of human pathology. Proteomics identification of temporal and sex-linked factors driving AD-related pathways can be used to dissect initiating and propagating events of AD stages to develop biomarkers or design interventions. In the present study, we conducted label-free proteome measurements of mouse hippocampus tissue with variables of time (3, 6, and 9 months), genetic background (5XFAD versus WT), and sex (equal males and females). These time points are associated with well-defined phenotypes with respect to the following: Aβ42 plaque deposition, memory deficits, and neuronal loss, allowing correlation of proteome-based molecular signatures with the mouse model stages. Our data show 5XFAD mice exhibit increases in known human AD biomarkers as amyloid-beta peptide, APOE, GFAP, and ITM2B are upregulated across all time points/stages. At the same time, 23 proteins are here newly associated with Alzheimer\u27s pathology as they are also dysregulated in 5XFAD mice. At a pathways level, the 5XFAD-specific upregulated proteins are significantly enriched for DNA damage and stress-induced senescence at 3-month only, while at 6-month, the AD-specific proteome signature is altered and significantly enriched for membrane trafficking and vesicle-mediated transport protein annotations. By 9-month, AD-specific dysregulation is also characterized by significant neuroinflammation with innate immune system, platelet activation, and hyperreactive astrocyte-related enrichments. Aside from these temporal changes, analysis of sex-linked differences in proteome signatures uncovered novel sex and ADassociated proteins. Pathway analysis revealed sexlinked differences in the 5XFAD model to be involved in the regulation of well-known human AD-related processes of amyloid fibril formation, wound healing, lysosome biogenesis, and DNA damage. Verification of the discovery results by Western blot and parallel reaction monitoring confirm the fundamental conclusions of the study and poise the 5XFAD model for further use as a molecular tool for understanding AD

Identification of relative protein bands in polyacrylamide gel electrophoresis (PAGE) using a multi-resolution snake algorithm

In polyacrylamide gel electrophoresis (PAGE) image analysis, it is important to determine the percentage of the protein of interest of a protein mixture. This study presents reliable computer software to determine this percentage. The region of interest containing the protein band is detected using the snake algorithm. The iterative snake algorithm is implemented in a multi-resolutional framework. The snake is initialized on a low-resolution image. Then, the final position of the snake at the low resolution is used as the initial position in the higher-resolution image. Finally, the area of the protein is estimated as the area enclosed by the final position of the snake

Myometrial transcriptional signatures of human parturition

The process of parturition involves the transformation of the quiescent myometrium (uterine smooth muscle) to the highly contractile laboring state. This is thought to be driven by changes in gene expression in myometrial cells. Despite the existence of multiple myometrial gene expression studies, the transcriptional programs that initiate labor are not known. Here, we integrated three transcriptome datasets, one novel (NCBI Gene Expression Ominibus: GSE80172) and two existing, to characterize the gene expression changes in myometrium associated with the onset of labor at term. Computational analyses including classification, singular value decomposition, pathway enrichment, and network inference were applied to individual and combined datasets. Outcomes across studies were integrated with multiple protein and pathway databases to build a myometrial parturition signaling network. A high-confidence (significant across all studies) set of 126 labor genes were identified and machine learning models exhibited high reproducibility between studies. Labor signatures included both known (interleukins, cytokines) and unknown (apoptosis, , cell proliferation/differentiation) pathways while cyclic AMP signaling and muscle relaxation were associated with non-labor. These signatures accurately classified and characterized the stages of labor. The data-derived parturition signaling networks provide new genes/signaling interactions to understand phenotype-specific processes and aid in future studies of parturition

NIBBS-Search for Fast and Accurate Prediction of Phenotype-Biased Metabolic Systems

Understanding of genotype-phenotype associations is important not only for furthering our knowledge on internal cellular processes, but also essential for providing the foundation necessary for genetic engineering of microorganisms for industrial use (e.g., production of bioenergy or biofuels). However, genotype-phenotype associations alone do not provide enough information to alter an organism's genome to either suppress or exhibit a phenotype. It is important to look at the phenotype-related genes in the context of the genome-scale network to understand how the genes interact with other genes in the organism. Identification of metabolic subsystems involved in the expression of the phenotype is one way of placing the phenotype-related genes in the context of the entire network. A metabolic system refers to a metabolic network subgraph; nodes are compounds and edges labels are the enzymes that catalyze the reaction. The metabolic subsystem could be part of a single metabolic pathway or span parts of multiple pathways. Arguably, comparative genome-scale metabolic network analysis is a promising strategy to identify these phenotype-related metabolic subsystems. Network Instance-Based Biased Subgraph Search (NIBBS) is a graph-theoretic method for genome-scale metabolic network comparative analysis that can identify metabolic systems that are statistically biased toward phenotype-expressing organismal networks. We set up experiments with target phenotypes like hydrogen production, TCA expression, and acid-tolerance. We show via extensive literature search that some of the resulting metabolic subsystems are indeed phenotype-related and formulate hypotheses for other systems in terms of their role in phenotype expression. NIBBS is also orders of magnitude faster than MULE, one of the most efficient maximal frequent subgraph mining algorithms that could be adjusted for this problem. Also, the set of phenotype-biased metabolic systems output by NIBBS comes very close to the set of phenotype-biased subgraphs output by an exact maximally-biased subgraph enumeration algorithm ( MBS-Enum ). The code (NIBBS and the module to visualize the identified subsystems) is available at http://freescience.org/cs/NIBBS

DADA: Degree-Aware Algorithms for Network-Based Disease Gene Prioritization

<p>Abstract</p> <p>Background</p> <p>High-throughput molecular interaction data have been used effectively to prioritize candidate genes that are linked to a disease, based on the observation that the products of genes associated with similar diseases are likely to interact with each other heavily in a network of protein-protein interactions (PPIs). An important challenge for these applications, however, is the incomplete and noisy nature of PPI data. Information flow based methods alleviate these problems to a certain extent, by considering indirect interactions and multiplicity of paths.</p> <p>Results</p> <p>We demonstrate that existing methods are likely to favor highly connected genes, making prioritization sensitive to the skewed degree distribution of PPI networks, as well as ascertainment bias in available interaction and disease association data. Motivated by this observation, we propose several statistical adjustment methods to account for the degree distribution of known disease and candidate genes, using a PPI network with associated confidence scores for interactions. We show that the proposed methods can detect loosely connected disease genes that are missed by existing approaches, however, this improvement might come at the price of more false negatives for highly connected genes. Consequently, we develop a suite called D<smcaps>A</smcaps>D<smcaps>A</smcaps>, which includes different uniform prioritization methods that effectively integrate existing approaches with the proposed statistical adjustment strategies. Comprehensive experimental results on the Online Mendelian Inheritance in Man (OMIM) database show that D<smcaps>A</smcaps>D<smcaps>A</smcaps> outperforms existing methods in prioritizing candidate disease genes.</p> <p>Conclusions</p> <p>These results demonstrate the importance of employing accurate statistical models and associated adjustment methods in network-based disease gene prioritization, as well as other network-based functional inference applications. D<smcaps>A</smcaps>D<smcaps>A</smcaps> is implemented in Matlab and is freely available at <url>http://compbio.case.edu/dada/</url>.</p

Simultaneous Optimization of Both Node and Edge Conservation in Network Alignment via WAVE

Network alignment can be used to transfer functional knowledge between conserved regions of different networks. Typically, existing methods use a node cost function (NCF) to compute similarity between nodes in different networks and an alignment strategy (AS) to find high-scoring alignments with respect to the total NCF over all aligned nodes (or node conservation). But, they then evaluate quality of their alignments via some other measure that is different than the node conservation measure used to guide the alignment construction process. Typically, one measures the amount of conserved edges, but only after alignments are produced. Hence, a recent attempt aimed to directly maximize the amount of conserved edges while constructing alignments, which improved alignment accuracy. Here, we aim to directly maximize both node and edge conservation during alignment construction to further improve alignment accuracy. For this, we design a novel measure of edge conservation that (unlike existing measures that treat each conserved edge the same) weighs each conserved edge so that edges with highly NCF-similar end nodes are favored. As a result, we introduce a novel AS, Weighted Alignment VotEr (WAVE), which can optimize any measures of node and edge conservation, and which can be used with any NCF or combination of multiple NCFs. Using WAVE on top of established state-of-the-art NCFs leads to superior alignments compared to the existing methods that optimize only node conservation or only edge conservation or that treat each conserved edge the same. And while we evaluate WAVE in the computational biology domain, it is easily applicable in any domain.Comment: 12 pages, 4 figure