Extraction of biological interaction networks from scientific literature

Biology can be regarded as a science of networks: interactions between various biological entities (eg genes, proteins, metabolites) on different levels (eg gene regulation, cell signalling) can be represented as graphs and, thus, analysis of such networks might shed new light on the function of biological systems. Such biological networks can be obtained from different sources. The extraction of networks from text is an important technique that requires the integration of several different computational disciplines. This paper summarises the most important steps in network extraction and reviews common approaches and solutions for the extraction of biological networks from scientific literature.     

Edge-count probabilities for the identification of local protein communities and their organization

We present a computational approach based on a local search strategy that discovers sets of proteins that preferentially interact with each other. Such sets are referred to as protein communities and are likely to represent functional modules. Preferential interaction between module members is quantified via an analytical framework based on a network null model known as the random graph with given expected degrees. Based on this framework, the concept of local protein community is generalized to that of community of communities. Protein communities and higher-level structures are extracted from two yeast protein interaction data sets and a network of published interactions between human proteins. The high level structures obtained with the human network correspond to broad biological concepts such as signal transduction, regulation of gene expression, and intercellular communication. Many of the obtained human communities are enriched, in a statistically significant way, for proteins having no clear orthologs in lower organisms. This indicates that the extracted modules are quite coherent in terms of function.     

A case for spiking neural network simulation based on configurable multiple-FPGA systems

Recent neuropsychological research has begun to reveal that neurons encode information in the timing of spikes. Spiking neural network simulations are a flexible and powerful method for investigating the behaviour of neuronal systems. Simulation of the spiking neural networks in software is unable to rapidly generate output spikes in large-scale of neural network. An alternative approach, hardware implementation of such system, provides the possibility to generate independent spikes precisely and simultaneously output spike waves in real time, under the premise that spiking neural network can take full advantage of hardware inherent parallelism. We introduce a configurable FPGA-oriented hardware platform for spiking neural network simulation in this work. We aim to use this platform to combine the speed of dedicated hardware with the programmability of software so that it might allow neuroscientists to put together sophisticated computation experiments of their own model. A feed-forward hierarchy network is developed as a case study to describe the operation of biological neural systems (such as orientation selectivity of visual cortex) and computational models of such systems. This model demonstrates how a feed-forward neural network constructs the circuitry required for orientation selectivity and provides platform for reaching a deeper understanding of the primate visual system. In the future, larger scale models based on this framework can be used to replicate the actual architecture in visual cortex, leading to more detailed predictions and insights into visual perception phenomenon.     

蛋白质氨基酸网络研究进展

氨基酸网络是运用复杂网络工具对蛋白质结构-功能关系研究的新方法。本文回顾了氨基酸网络中常用网络参量的计算方法,如:度分布,聚集系数,平均最短路径等。结合本研究小组的工作,介绍了常用的网络构建和分析方法,并总结了氨基酸网络在蛋白质折叠以及蛋白质分子对接问题中的应用。最后,分析了氨基酸网络研究目前存在的主要问题,并对未来的工作进行了展望。     

Multiomics metabolic and epigenetics regulatory network in cancer: A systems biology perspective

Genetic, epigenetic, and metabolic alterations are all hallmarks of cancer. However, the epigenome and metabolome are both highly complex and dynamic biological networks in vivo. The interplay between the epigenome and metabolome contributes to a biological system that is responsive to the tumor microenvironment and possesses a wealth of unknown biomarkers and targets of cancer therapy. From this perspective, we first review the state of high-throughput biological data acquisition(i.e. multiomics data)and analysis(i.e. computational tools) and then propose a conceptual in silico metabolic and epigenetic regulatory network(MER-Net) that is based on these current high-throughput methods. The conceptual MER-Net is aimed at linking metabolomic and epigenomic networks through observation of biological processes, omics data acquisition, analysis of network information, and integration with validated database knowledge. Thus, MER-Net could be used to reveal new potential biomarkers and therapeutic targets using deep learning models to integrate and analyze large multiomics networks. We propose that MER-Net can serve as a tool to guide integrated metabolomics and epigenomics research or can be modified to answer other complex biological and clinical questions using multiomics data.     

蛋白质氨基酸网络研究进展

氨基酸网络是运用复杂网络工具对蛋白质结构-功能关系研究的新方法。本文回顾了氨基酸网络中常用网络参量的计算方法,如：度分布,聚集系数,平均最短路径等。结合本研究小组的工作,介绍了常用的网络构建和分析方法,并总结了氨基酸网络在蛋白质折叠以及蛋白质分子对接问题中的应用。最后,分析了氨基酸网络研究目前存在的主要问题,并对未来的工作进行了展望。     

Sparse networks of directly coupled,polymorphic, and functional side chains in allosteric proteins

Recent studies have highlighted the role of coupled side‐chain fluctuations alone in the allosteric behavior of proteins. Moreover, examination of X‐ray crystallography data has recently revealed new information about the prevalence of alternate side‐chain conformations (conformational polymorphism), and attempts have been made to uncover the hidden alternate conformations from X‐ray data. Hence, new computational approaches are required that consider the polymorphic nature of the side chains, and incorporate the effects of this phenomenon in the study of information transmission and functional interactions of residues in a molecule. These studies can provide a more accurate understanding of the allosteric behavior. In this article, we first present a novel approach to generate an ensemble of conformations and an efficient computational method to extract direct couplings of side chains in allosteric proteins, and provide sparse network representations of the couplings. We take the side‐chain conformational polymorphism into account, and show that by studying the intrinsic dynamics of an inactive structure, we are able to construct a network of functionally crucial residues. Second, we show that the proposed method is capable of providing a magnified view of the coupled and conformationally polymorphic residues. This model reveals couplings between the alternate conformations of a coupled residue pair. To the best of our knowledge, this is the first computational method for extracting networks of side chains' alternate conformations. Such networks help in providing a detailed image of side‐chain dynamics in functionally important and conformationally polymorphic sites, such as binding and/or allosteric sites. Proteins 2015; 83:497–516. © 2014 Wiley Periodicals, Inc.     

Structure networks of E. coli glutaminyl-tRNA synthetase: effects of ligand binding

It is well known that proteins undergo backbone as well as side chain conformational changes upon ligand binding, which is not necessarily confined to the active site. Both the local and the global conformational changes brought out by ligand-binding have been extensively studied earlier. However, the global changes have been reported mainly at the protein backbone level. Here we present a method that explicitly takes into account the side chain interactions, yet providing a global view of the ligand-induced conformational changes. This is achieved through the analysis of Protein Structure Networks (PSN), constructed from the noncovalent side chain interactions in the protein. Here, E. coli Glutaminyl-tRNA synthetase (GlnRS) in the ligand-free and different ligand-bound states is used as a case study to assess the effect of binding of tRNA, ATP, and the amino acid Gln to GlnRS. The PSNs are constructed on the basis of the strength of noncovalent interactions existing between the side chains of amino acids. The parameters like the size of the largest cluster, edge to node ratio, and the total number of hubs are used to quantitatively assess the structure network changes. These network parameters have effectively captured the ligand-induced structural changes at a global structure network level. Hubs, the highly connected amino acids, are also identified from these networks. Specifically, we are able to characterize different types of hubs based on the comparison of structure networks of the GlnRS system. The differences in the structure networks in both the presence and the absence of the ligands are reflected in these hubs. For instance, the characterization of hubs that are present in both the ligand-free and all the ligand-bound GlnRS (the invariant hubs) might implicate their role in structural integrity. On the other hand, identification of hubs unique to a particular ligand-bound structure (the exclusive hubs) not only highlights the structural differences mediated by ligand-binding at the structure network level, but also highlights significance of these amino acids hubs in binding to the ligand and catalyzing the biochemical function. Further, the hubs identified from this study could be ideal targets for mutational studies to ascertain the ligand-induced structure-function relationships in E. coli GlnRS. The formalism used in this study is simple and can be applied to other protein-ligands in general to understand the allosteric changes mediated by the binding of ligands.     

PPRODO: prediction of protein domain boundaries using neural networks

Successful prediction of protein domain boundaries provides valuable information not only for the computational structure prediction of multidomain proteins but also for the experimental structure determination. Since protein sequences of multiple domains may contain much information regarding evolutionary processes such as gene-exon shuffling, this information can be detected by analyzing the position-specific scoring matrix (PSSM) generated by PSI-BLAST. We have presented a method, PPRODO (Prediction of PROtein DOmain boundaries) that predicts domain boundaries of proteins from sequence information by a neural network. The network is trained and tested using the values obtained from the PSSM generated by PSI-BLAST. A 10-fold cross-validation technique is performed to obtain the parameters of neural networks using a nonredundant set of 522 proteins containing 2 contiguous domains. PPRODO provides good and consistent results for the prediction of domain boundaries, with accuracy of about 66% using the +/-20 residue criterion. The PPRODO source code, as well as all data sets used in this work, are available from http://gene.kias.re.kr/ approximately jlee/pprodo/.     

Identifying responsive functional modules from protein-protein interaction network

Proteins interact with each other within a cell, and those interactions give rise to the biological function and dynamical behavior of cellular systems. Generally, the protein interactions are temporal, spatial, or condition dependent in a specific cell, where only a small part of interactions usually take place under certain conditions. Recently, although a large amount of protein interaction data have been collected by high-throughput technologies, the interactions are recorded or summarized under various or different conditions and therefore cannot be directly used to identify signaling pathways or active networks, which are believed to work in specific cells under specific conditions. However, protein interactions activated under specific conditions may give hints to the biological process underlying corresponding phenotypes. In particular, responsive functional modules consist of protein interactions activated under specific conditions can provide insight into the mechanism underlying biological systems, e.g. protein interaction subnetworks found for certain diseases rather than normal conditions may help to discover potential biomarkers. From computational viewpoint, identifying responsive functional modules can be formulated as an optimization problem. Therefore, efficient computational methods for extracting responsive functional modules are strongly demanded due to the NP-hard nature of such a combinatorial problem. In this review, we first report recent advances in development of computational methods for extracting responsive functional modules or active pathways from protein interaction network and microarray data. Then from computational aspect, we discuss remaining obstacles and perspectives for this attractive and challenging topic in the area of systems biology.     

A more efficient search strategy for aging genes based on connectivity

MOTIVATION: Many aging genes have been found from unbiased screens in model organisms. Genetic interventions promoting longevity are usually quantitative, while in many other biological fields (e.g. development) null mutations alone have been very informative. Therefore, in the case of aging the task is larger and the need for a more efficient genetic search strategy is especially strong. RESULTS: The topology of genetic and metabolic networks is organized according to a scale-free distribution, in which hubs with large numbers of links are present. We have developed a computational model of aging genes as the hubs of biological networks. The computational model shows that, after generalized damage, the function of a network with scale-free topology can be significantly restored by a limited intervention on the hubs. Analyses of data on aging genes and biological networks support the applicability of the model to biological aging. The model also might explain several of the properties of aging genes, including the high degree of conservation across different species. The model suggests that aging genes tend to have a higher number of connections and therefore supports a strategy, based on connectivity, for prioritizing what might otherwise be a random search for aging genes.     

Inference of scale-free networks from gene expression time series

Quantitative time-series observation of gene expression is becoming possible, for example by cell array technology. However, there are no practical methods with which to infer network structures using only observed time-series data. As most computational models of biological networks for continuous time-series data have a high degree of freedom, it is almost impossible to infer the correct structures. On the other hand, it has been reported that some kinds of biological networks, such as gene networks and metabolic pathways, may have scale-free properties. We hypothesize that the architecture of inferred biological network models can be restricted to scale-free networks. We developed an inference algorithm for biological networks using only time-series data by introducing such a restriction. We adopt the S-system as the network model, and a distributed genetic algorithm to optimize models to fit its simulated results to observed time series data. We have tested our algorithm on a case study (simulated data). We compared optimization under no restriction, which allows for a fully connected network, and under the restriction that the total number of links must equal that expected from a scale free network. The restriction reduced both false positive and false negative estimation of the links and also the differences between model simulation and the given time-series data.     

生物信息学方法预测蛋白质相互作用网络中的功能模块

蛋白质相互作用是大多数生命过程的基础。随着高通量实验技术和计算机预测方法的发展,在各种生物中已获得了数目十分庞大的蛋白质相互作用数据,如何从中提取出具有生物学意义的数据是一项艰巨的挑战。从蛋白质相互作用数据出发获得相互作用网络进而预测出其中的功能模块,对于蛋白质功能预测、揭示各种生化反应过程的分子机理都有着极大的帮助。我们分类概括了用生物信息学预测蛋白质相互作用功能模块的方法,以及对这些方法的评价,并介绍了蛋白质相互作用网络比较的一些方法。     

An automated approach to network features of protein structure ensembles

Network theory applied to protein structures provides insights into numerous problems of biological relevance. The explosion in structural data available from PDB and simulations establishes a need to introduce a standalone‐efficient program that assembles network concepts/parameters under one hood in an automated manner. Herein, we discuss the development/application of an exhaustive, user‐friendly, standalone program package named PSN‐Ensemble, which can handle structural ensembles generated through molecular dynamics (MD) simulation/NMR studies or from multiple X‐ray structures. The novelty in network construction lies in the explicit consideration of side‐chain interactions among amino acids. The program evaluates network parameters dealing with topological organization and long‐range allosteric communication. The introduction of a flexible weighing scheme in terms of residue pairwise cross‐correlation/interaction energy in PSN‐Ensemble brings in dynamical/chemical knowledge into the network representation. Also, the results are mapped on a graphical display of the structure, allowing an easy access of network analysis to a general biological community. The potential of PSN‐Ensemble toward examining structural ensemble is exemplified using MD trajectories of an ubiquitin‐conjugating enzyme (UbcH5b). Furthermore, insights derived from network parameters evaluated using PSN‐Ensemble for single‐static structures of active/inactive states of β2‐adrenergic receptor and the ternary tRNA complexes of tyrosyl tRNA synthetases (from organisms across kingdoms) are discussed. PSN‐Ensemble is freely available from http://vishgraph.mbu.iisc.ernet.in/PSN‐Ensemble/psn_index.html .     

LncRNA and mRNA integration network reconstruction reveals novel key regulators in esophageal squamous-cell carcinoma

Many experimental and computational studies have identified key protein coding genes in initiation and progression of esophageal squamous cell carcinoma (ESCC). However, the number of researches that tried to reveal the role of long non-coding RNAs (lncRNAs) in ESCC has been limited. LncRNAs are one of the important regulators of cancers which are transcribed dominantly in the genome and in various conditions. The main goal of this study was to use a systems biology approach to predict novel lncRNAs as well as protein coding genes associated with ESCC and assess their prognostic values. By using microarray expression data for mRNAs and lncRNAs from a large number of ESCC patients, we utilized “Weighted Gene Co-expression Network Analysis” (WGCNA) method to make a big coding-non-coding gene co-expression network, and discovered important functional modules. Gene set enrichment and pathway analysis revealed major biological processes and pathways involved in these modules. After selecting some protein coding genes involved in biological processes and pathways related to cancer, we used “LncTar”, a computational tool to predict potential interactions between these genes and lncRNAs. By combining interaction results with Pearson correlations, we introduced some novel lncRNAs with putative key regulatory roles in the network. Survival analysis with Kaplan-Meier estimator and Log-rank test statistic confirmed that most of the introduced genes are associated with poor prognosis in ESCC. Overall, our study reveals novel protein coding genes and lncRNAs associated with ESCC, along with their predicted interactions. Based on the promising results of survival analysis, these genes can be used as good estimators of patients' survival, or even can be analyzed further as new potential signatures or targets for the therapy of ESCC disease.