Gene regulatory network inference by point-based Gaussian approximation filters incorporating the prior information

Abstract

The extended Kalman filter (EKF) has been applied to inferring gene regulatory networks. However, it is well known that the EKF becomes less accurate when the system exhibits high nonlinearity. In addition, certain prior information about the gene regulatory network exists in practice, and no systematic approach has been developed to incorporate such prior information into the Kalman-type filter for inferring the structure of the gene regulatory network. In this paper, an inference framework based on point-based Gaussian approximation filters that can exploit the prior information is developed to solve the gene regulatory network inference problem. Different point-based Gaussian approximation filters, including the unscented Kalman filter (UKF), the third-degree cubature Kalman filter (CKF₃), and the fifth-degree cubature Kalman filter (CKF₅) are employed. Several types of network prior information, including the existing network structure information, sparsity assumption, and the range constraint of parameters, are considered, and the corresponding filters incorporating the prior information are developed. Experiments on a synthetic network of eight genes and the yeast protein synthesis network of five genes are carried out to demonstrate the performance of the proposed framework. The results show that the proposed methods provide more accurate inference results than existing methods, such as the EKF and the traditional UKF.

     

Hypotheses in urban ecology: building a common knowledge base

Urban ecology is a rapidly growing research field that has to keep pace with the pressing need to tackle the sustainability crisis. As an inherently multi-disciplinary field with close ties to practitioners and administrators, research synthesis and knowledge transfer between those different stakeholders is crucial. Knowledge maps can enhance knowledge transfer and provide orientation to researchers as well as practitioners. A promising option for developing such knowledge maps is to create hypothesis networks, which structure existing hypotheses and aggregate them according to topics and research aims. Combining expert knowledge with information from the literature, we here identify 62 research hypotheses used in urban ecology and link them in such a network. Our network clusters hypotheses into four distinct themes: (i) Urban species traits & evolution, (ii) Urban biotic communities, (iii) Urban habitats and (iv) Urban ecosystems. We discuss the potentials and limitations of this approach. All information is openly provided as part of an extendable Wikidata project, and we invite researchers, practitioners and others interested in urban ecology to contribute additional hypotheses, as well as comment and add to the existing ones. The hypothesis network and Wikidata project form a first step towards a knowledge base for urban ecology, which can be expanded and curated to benefit both practitioners and researchers.     

A network synthesis model for generating protein interaction network families

In this work, we introduce a novel network synthesis model that can generate families of evolutionarily related synthetic protein-protein interaction (PPI) networks. Given an ancestral network, the proposed model generates the network family according to a hypothetical phylogenetic tree, where the descendant networks are obtained through duplication and divergence of their ancestors, followed by network growth using network evolution models. We demonstrate that this network synthesis model can effectively create synthetic networks whose internal and cross-network properties closely resemble those of real PPI networks. The proposed model can serve as an effective framework for generating comprehensive benchmark datasets that can be used for reliable performance assessment of comparative network analysis algorithms. Using this model, we constructed a large-scale network alignment benchmark, called NAPAbench, and evaluated the performance of several representative network alignment algorithms. Our analysis clearly shows the relative performance of the leading network algorithms, with their respective advantages and disadvantages. The algorithm and source code of the network synthesis model and the network alignment benchmark NAPAbench are publicly available at http://www.ece.tamu.edu/bjyoon/NAPAbench/.     

Comprehensive analysis of the effects of Escherichia coli ORFs on protein translation reaction

Protein synthesis is one of the most important reactions in the cell. Recent experimental studies indicated that this complex reaction can be achieved with a minimum complement of 36 proteins and ribosomes by reconstituting an Escherichia coli-based in vitro translation system with these protein components highly purified on an individual basis. From the protein-protein interaction (PPI) network of E. coli proteins, these minimal protein components are known to interact physically with large numbers of proteins. However, it is unclear what fraction of E. coli proteins are linked functionally with the minimal protein synthesis system. We investigated the effects of each of the 4194 E. coli ORF products on the minimal protein synthesis system; at least 12% of the entire ORF products, a significant fraction of the gene product of E. coli, affect the activity of this system. Furthermore 34% of these functional modifiers present in the PPI network were shown by mapping to be directly linked (i.e. to interact physically) with the minimal components of the PPI network. Topological analysis of the relationships between modifiers and the minimal components in the PPI network indicated clustering of the minimal components. The modifiers showed no such clustering, indicating that the location of functional modifiers is spread across the PPI network rather than clustering close to the minimal protein components. These observations may reflect the evolutionary process of the protein synthesis system.     

医院计算机网络信息资源管理的优化策略探析

计算机网络技术在医院信息资源管理中的普遍应用在很大程度上优化医院的工作方式,加强医疗信息的整合能力,提升医院的工作效率,在应用中计算机网络技术发挥重要作用。我们从医院计算机网络信息资源的内涵及特点入手,分析当前医院信息资源管理现状,最后针对医院信息管理现状中出现的具体问题,提出相应的优化策略,以期对以后计算机网络技术在医院信息资源管理中的进一步研究有所裨益。     

Plato's Cave Algorithm: Inferring Functional Signaling Networks from Early Gene Expression Shadows

Improving the ability to reverse engineer biochemical networks is a major goal of systems biology. Lesions in signaling networks lead to alterations in gene expression, which in principle should allow network reconstruction. However, the information about the activity levels of signaling proteins conveyed in overall gene expression is limited by the complexity of gene expression dynamics and of regulatory network topology. Two observations provide the basis for overcoming this limitation: a. genes induced without de-novo protein synthesis (early genes) show a linear accumulation of product in the first hour after the change in the cell''s state; b. The signaling components in the network largely function in the linear range of their stimulus-response curves. Therefore, unlike most genes or most time points, expression profiles of early genes at an early time point provide direct biochemical assays that represent the activity levels of upstream signaling components. Such expression data provide the basis for an efficient algorithm (Plato''s Cave algorithm; PLACA) to reverse engineer functional signaling networks. Unlike conventional reverse engineering algorithms that use steady state values, PLACA uses stimulated early gene expression measurements associated with systematic perturbations of signaling components, without measuring the signaling components themselves. Besides the reverse engineered network, PLACA also identifies the genes detecting the functional interaction, thereby facilitating validation of the predicted functional network. Using simulated datasets, the algorithm is shown to be robust to experimental noise. Using experimental data obtained from gonadotropes, PLACA reverse engineered the interaction network of six perturbed signaling components. The network recapitulated many known interactions and identified novel functional interactions that were validated by further experiment. PLACA uses the results of experiments that are feasible for any signaling network to predict the functional topology of the network and to identify novel relationships.     

Metabolomics assisted metabolic network modeling and network wide analysis of metabolites in microbiology

Metabolomics is the science of qualitatively and quantitatively analyzing low molecular weight metabolites occur in a given biological system. It provides valuable information to elucidate the functional roles and relations of different metabolites in a metabolic pathway. In recent years, a large amount of research on microbial metabolomics has been conducted. It has become a useful tool for achieving highly efficient synthesis of target metabolites. At the same time, many studies have been conducted over the years in order to integrate metabolomics data into metabolic network modeling, which has yielded many exciting results. Additionally, metabolomics also shows great advantages in analyzing the relationship of metabolites network wide. Integrating metabolomics data into metabolic network construction and applying it in network wide analysis of cell metabolism would further improve our ability to control cellular metabolism and optimize the design of cell factories for the overproduction of valuable biochemicals. This review will examine recent progress in the application of metabolomics approaches in metabolic network modeling and network wide analysis of microbial cell metabolism.     

Information Flow Analysis of Interactome Networks

Recent studies of cellular networks have revealed modular organizations of genes and proteins. For example, in interactome networks, a module refers to a group of interacting proteins that form molecular complexes and/or biochemical pathways and together mediate a biological process. However, it is still poorly understood how biological information is transmitted between different modules. We have developed information flow analysis, a new computational approach that identifies proteins central to the transmission of biological information throughout the network. In the information flow analysis, we represent an interactome network as an electrical circuit, where interactions are modeled as resistors and proteins as interconnecting junctions. Construing the propagation of biological signals as flow of electrical current, our method calculates an information flow score for every protein. Unlike previous metrics of network centrality such as degree or betweenness that only consider topological features, our approach incorporates confidence scores of protein–protein interactions and automatically considers all possible paths in a network when evaluating the importance of each protein. We apply our method to the interactome networks of Saccharomyces cerevisiae and Caenorhabditis elegans. We find that the likelihood of observing lethality and pleiotropy when a protein is eliminated is positively correlated with the protein's information flow score. Even among proteins of low degree or low betweenness, high information scores serve as a strong predictor of loss-of-function lethality or pleiotropy. The correlation between information flow scores and phenotypes supports our hypothesis that the proteins of high information flow reside in central positions in interactome networks. We also show that the ranks of information flow scores are more consistent than that of betweenness when a large amount of noisy data is added to an interactome. Finally, we combine gene expression data with interaction data in C. elegans and construct an interactome network for muscle-specific genes. We find that genes that rank high in terms of information flow in the muscle interactome network but not in the entire network tend to play important roles in muscle function. This framework for studying tissue-specific networks by the information flow model can be applied to other tissues and other organisms as well.     

Metabolic systems cost-benefit analysis for interpreting network structure and regulation

MOTIVATION: Interpretation of bioinformatics data in terms of cellular function is a major challenge facing systems biology. This question is complicated by robust metabolic networks filled with structural features like parallel pathways and isozymes. Under conditions of nutrient sufficiency, metabolic networks are well known to be regulated for thermodynamic efficiency however; efficient biochemical pathways are anabolically expensive to construct. While parameters like thermodynamic efficiency have been extensively studied, a systems-based analysis of anabolic proteome synthesis 'costs' and the cellular function implications of these costs has not been reported. RESULTS: A cost-benefit analysis of an in silico Escherichia coli network revealed the relationship between metabolic pathway proteome synthesis requirements, DNA-coding sequence length, thermodynamic efficiency and substrate affinity. The results highlight basic metabolic network design principles. Pathway proteome synthesis requirements appear to have shaped biochemical network structure and regulation. Under conditions of nutrient scarcity and other general stresses, E. coli expresses pathways with relatively inexpensive proteome synthesis requirements instead of more efficient but also anabolically more expensive pathways. This evolutionary strategy provides a cellular function-based explanation for common network motifs like isozymes and parallel pathways and possibly explains 'overflow' metabolisms observed during nutrient scarcity. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.     

Layer-by-Layer DNA film synthesis via branched hybridization

A new Layer-by-Layer (LbL) DNA film synthesis, where the driving force is the natural DNA hybridization, is presented in this work. The DNA films were synthesized via a branched mechanism and do not include any chemical binders between each layer as it is the case for film obtained by other synthesis paths. Kinetics of film formation were monitored by mass measurements with an electroacoustic network analyzer. The presented synthesis is a pathway to new DNA structures which can be used in biotechnologies and is complementary to those obtained by other LbL techniques.     

What do we mean by biological complexity?

The purpose of the present paper is to offer a precise definition of the concepts of integration, emergence and complexity in biological networks through the use of the information theory. If two distinct properties of a network are expressed by two discrete variables, the classical subadditivity principle of Shannon's information theory applies when all the nodes of the network are associated with these properties. If not, the subadditivity principle may not apply. This situation is often to be encountered with enzyme and metabolic networks, for some nodes may well not be associated with these two properties. This is precisely what is occurring with an enzyme that binds randomly its two substrates. This situation implies that an enzyme, or a metabolic network, may display a joint entropy equal, smaller, or larger than the corresponding sum of individual entropies of component sub-systems. In the first case, the collective properties of the network can be reduced to the individual properties of its components. Moreover, the network is devoid of any information. In the second case, the system displays integration effects, behaves as a coherent whole, and has positive information. But if the joint entropy of the network is smaller than the sum of the individual entropies of its components, then the system has emergent collective properties and can be considered complex. Moreover, under these conditions, its information is negative. The extent of negative information is enhanced if the enzyme, or the metabolic network, is far away from equilibrium.     

Face recognition from a single image per person using deep architecture neural networks

Implementing an accurate face recognition system requires images in different variations, and if our database is large, we suffer from problems such as storing cost and low speed in recognition algorithms. On the other hand, in some applications there is only one image available per person for training recognition model. In this article, we propose a neural network model inspired of bidirectional analysis and synthesis brain network which can learn nonlinear mapping between image space and components space. Using a deep neural network model, we have tried to separate pose components from person ones. After setting apart these components, we can use them to synthesis virtual images of test data in different pose and lighting conditions. These virtual images are used to train neural network classifier. The results showed that training neural classifier with virtual images gives better performance than training classifier with frontal view images.     

Reconstructing evolutionary relationships from functional data: a consistent classification of organisms based on translation inhibition response

The last two decades have witnessed an unsurpassed effort aimed at reconstructing the history of life from the genetic information contained in extant organisms. The availability of many sequenced genomes has allowed the reconstruction of phylogenies from gene families and its comparison with traditional single-gene trees. However, the appearance of major discrepancies between both approaches questions whether horizontal gene transfer (HGT) has played a prominent role in shaping the topology of the Tree of Life. Recent attempts at solving this controversy and reaching a consensus tree combine molecular data with additional phylogenetic markers. Translation is a universal cellular function that involves a meaningful, highly conserved set of genes: both rRNA and r-protein operons have an undisputed phylogenetic value and rarely undergo HGT. Ribosomal function reflects the concerted expression of that genetic network and consequently yields information about the evolutionary paths followed by the organisms. Here we report on tree reconstruction using a measure of the performance of the ribosome: antibiotic sensitivity of protein synthesis. A large database has been used where 33 ribosomal systems belonging to the three major cellular lineages were probed against 38 protein synthesis inhibitors. Different definitions of distance between pairs of organisms have been explored, and the classical algorithm of bootstrap evaluation has been adapted to quantify the reliability of the reconstructions obtained. Our analysis returns a consistent phylogeny, where archaea are systematically affiliated to eukarya, in agreement with recent reconstructions which used information-processing systems. The integration of the information derived from relevant functional markers into current phylogenetic reconstructions might facilitate achieving a consensus Tree of Life.     

Continuous flow solid (gel) phase peptide synthesis using unsupported ultra-high load polymers.

A simple, manually operated, continuous flow apparatus is described for solid (gel) phase peptide synthesis. The approach uses an unsupported phenolic bead form core network at an initial matrix loading of 5 mmol g-1, the theoretical maximum. The synthesis is performed in a flow reactor under low pressure conditions. "Layered displacement" of reagent solutions and washing solvents is an essential feature that has been developed to facilitate efficient peptide synthesis. The usefulness of the present system in conjunction with N alpha Boc protected amino acids is illustrated by the syntheses of [Leu5]-enkephalin and dermorphin. The potential for scale up synthesis has also been investigated.     

细胞粘附分子群相互作用网络模型研究

通过相互作用网络可视化软件Cytoscape对整联蛋白粘合体156种成份及相互间的690个反应实现网络可视化,并通过网络分析软件network analyser得到该网络节点间的平均连接并不复杂是一个不可分割的整体网络,网络较稳定,信息传递很快等。直接可视化的网络通过节点的形状改变视图有助于我们在原始数据的基础上更好的认识这一复杂的作用网络的相关信息。     

ITEPE: A Source Tracing Algorithm for the Microblog

Finding the true source of a social network is a crucial component of social network information tracing. Using the new media microblog as an example, this paper provides a source tracing algorithm ITEPE (Initiators and Early Participants Extraction) to solve this problem. First, the cascade (session tree) is built according to the retweeting of a microblog, after which the cascade set (session forest) is clustered by topical relevance. Second, real initiators are identified through the user relationship network and information cascade network. The influence index and conformity index of every node is then iteratively calculated according to text sentiment analysis and information cascades and the early important participants are extracted. Finally, the real initiators and early participants are evaluated through an experiment.