BACKGROUND: Representing biological networks as graphs is a powerful approach to reveal underlying patterns, signatures, and critical components from high-throughput biomolecular data. However, graphs do not natively capture the multi-way relationships present among genes and proteins in biological systems. Hypergraphs are generalizations of graphs that naturally model multi-way relationships and have shown promise in modeling systems such as protein complexes and metabolic reactions. In this paper we seek to understand how hypergraphs can more faithfully identify, and potentially predict, important genes based on complex relationships inferred from genomic expression data sets. RESULTS: We compiled a novel data set of transcriptional host response to pathogenic viral infections and formulated relationships between genes as a hypergraph where hyperedges represent significantly perturbed genes, and vertices represent individual biological samples with specific experimental conditions. We find that hypergraph betweenness centrality is a superior method for identification of genes important to viral response when compared with graph centrality. CONCLUSIONS: Our results demonstrate the utility of using hypergraphs to represent complex biological systems and highlight central important responses in common to a variety of highly pathogenic viruses.

DOAJ is a unique and extensive index of diverse open access journals from around the world, driven by a growing community, committed to ensuring quality content is freely available online for everyone.

The Influence Maximization problem has been extensively studied in the past decade because of its practical applications in finding the key influencers in social networks. Due to the hardness of the underlying problem, existing algorithms have tried to trade off practical efficiency with approximation guarantees. Approximate solutions take several hours of compute time on modest sized real world inputs and there is a lack of effective parallel and distributed algorithms to solve this problem. In this paper, we present efficient parallel algorithms for multithreaded and distributed systems to solve the influence maximization with approximation guarantee. Our algorithms extend state-of-the-art sequential approach based on computing reverse reachability sets. We present a detailed experimental evaluation, and analyze their performance and their sensitivity to input parameters, using real world inputs. Our experimental results demonstrate significant speedup on parallel architectures. We further show a speedup of up to 586× relative to the state-of-the-art sequential baseline using 1024 nodes of a supercomputer at far greater accuracy and twice the seed set size. To the best of our knowledge, this is the first effort in parallelizing the influence maximization operation at scale.

High-throughput multi-omics studies and corresponding network analyses of multi-omic data have rapidly expanded their impact over the last 10 years. As biological features of different types (e.g. transcripts, proteins, metabolites) interact within cellular systems, the greatest amount of knowledge can be gained from networks that incorporate multiple types of -omic data. However, biological and technical sources of variation diminish the ability to detect cross-type associations, yielding networks dominated by communities comprised of nodes of the same type. We describe here network building methods that can maximize edges between nodes of different data types leading to integrated networks, networks that have a large number of edges that link nodes of different-omic types (transcripts, proteins, lipids etc). We systematically rank several network inference methods and demonstrate that, in many cases, using a random forest method, GENIE3, produces the most integrated networks. This increase in integration does not come at the cost of accuracy as GENIE3 produces networks of approximately the same quality as the other network inference methods tested here. Using GENIE3, we also infer networks representing antibody-mediated Dengue virus cell invasion and receptor-mediated Dengue virus invasion. A number of functional pathways showed centrality differences between the two networks including genes responding to both GM-CSF and IL-4, which had a higher centrality value in an antibody-mediated vs. receptor-mediated Dengue network. Because a biological system involves the interplay of many different types of molecules, incorporating multiple data types into networks will improve their use as models of biological systems. The methods explored here are some of the first to specifically highlight and address the challenges associated with how such multi-omic networks can be assembled and how the greatest number of interactions can be inferred from different data types. The resulting networks can lead to the discovery of new host response patterns and interactions during viral infection, generate new hypotheses of pathogenic mechanisms and confirm mechanisms of disease.

Institutions around the world are fighting to improve science communication all the time. From calls for journal papers to be simplified to encouraging scientists to take more of an active role through community engagement, there is an impetus to demystify and improve public understanding and engagement with science. Technology has greatly helped expand the range of learning styles that a lecturer can call on to reach people in new ways. Social media outlets like Twitter, Facebook, Instagram, and Tumblr have expanded the reach of science communication within and across scientific disciplines and to the lay public. Here, with all the videos, interactive quizzes, and instant feedback it can be easy to overlook one of the simplest methods for communicating complex ideas: comics.

MOTIVATION: Biological system behaviors are often the outcome of complex interactions among a large number of cells and their biotic and abiotic environment. Computational biologists attempt to understand, predict and manipulate biological system behavior through mathematical modeling and computer simulation. Discrete agent-based modeling (in combination with high-resolution grids to model the extracellular environment) is a popular approach for building biological system models. However, the computational complexity of this approach forces computational biologists to resort to coarser resolution approaches to simulate large biological systems. High-performance parallel computers have the potential to address the computing challenge, but writing efficient software for parallel computers is difficult and time-consuming. RESULTS: We have developed Biocellion, a high-performance software framework, to solve this computing challenge using parallel computers. To support a wide range of multicellular biological system models, Biocellion asks users to provide their model specifics by filling the function body of pre-defined model routines. Using Biocellion, modelers without parallel computing expertise can efficiently exploit parallel computers with less effort than writing sequential programs from scratch. We simulate cell sorting, microbial patterning and a bacterial system in soil aggregate as case studies. AVAILABILITY AND IMPLEMENTATION: Biocellion runs on x86 compatible systems with the 64 bit Linux operating system and is freely available for academic use. Visit http://biocellion.com for additional information.

The spatio-temporal landscape of the plasma membrane regulates activation and signal transduction of membrane bound receptors by restricting their two-dimensional mobility and by inducing receptor clustering. This regulation also extends to complex formation between receptors and adaptor proteins, which are the intermediate signaling molecules involved in cellular signaling that relay the received cues from cell surface to cytoplasm and eventually to the nucleus. Although their investigation poses challenging technical difficulties, there is a crucial need to understand the impact of the receptor diffusivity, clustering, and spatial heterogeneity, and of receptor-adaptor protein complex formation on the cellular signal transduction patterns. Building upon our earlier studies, we have developed an adaptive coarse-grained Monte Carlo method that can be used to investigate the role of diffusion, clustering and membrane corralling on receptor association and receptor-adaptor protein complex formation dynamics in three dimensions. The new Monte Carlo lattice based approach allowed us to introduce spatial resolution on the 2-D plasma membrane and to model the cytoplasm in three-dimensions. Being a multi-resolution approach, our new method makes it possible to represent various parts of the cellular system at different levels of detail and enabled us to utilize the locally homogeneous assumption when justified (e.g., cytoplasmic region away from the cell membrane) and avoid its use when high spatial resolution is needed (e.g., cell membrane and cytoplasmic region near the membrane) while keeping the required computational complexity manageable. Our results have shown that diffusion has a significant impact on receptor-receptor dimerization and receptor-adaptor protein complex formation kinetics. We have observed an "adaptor protein hopping" mechanism where the receptor binding proteins may hop between receptors to form short-lived transient complexes. This increased residence time of the adaptor proteins near cell membrane and their ability to frequently change signaling partners may explain the increase in signaling efficiency when receptors are clustered. We also hypothesize that the adaptor protein hopping mechanism can cause concurrent or sequential activation of multiple signaling pathways, thus leading to crosstalk between diverse biological functions.

Chronic obstructive pulmonary disease (COPD) is a major global health problem. The etiology of COPD has been associated with apoptosis, oxidative stress, and inflammation. However, understanding of the molecular interactions that modulate COPD pathogenesis remains only partly resolved. We conducted an exploratory study on COPD etiology to identify the key molecular participants. We used information-theoretic algorithms including Context Likelihood of Relatedness (CLR), Algorithm for the Reconstruction of Accurate Cellular Networks (ARACNE), and Inferelator. We captured direct functional associations among genes, given a compendium of gene expression profiles of human lung epithelial cells. A set of genes differentially expressed in COPD, as reported in a previous study were superposed with the resulting transcriptional regulatory networks. After factoring in the properties of the networks, an established COPD susceptibility locus and domain-domain interactions involving protein products of genes in the generated networks, several molecular candidates were predicted to be involved in the etiology of COPD. These include COL4A3, CFLAR, GULP1, PDCD1, CASP10, PAX3, BOK, HSPD1, PITX2, and PML. Furthermore, T-box (TBX) genes and cyclin-dependent kinase inhibitor 2A (CDKN2A), which are in a direct transcriptional regulatory relationship, emerged as preeminent participants in the etiology of COPD by means of senescence. Contrary to observations in neoplasms, our study reveals that the expression of genes and proteins in the lung samples from patients with COPD indicate an increased tendency towards cellular senescence. The expression of the anti-senescence mediators TBX transcription factors, chromatin modifiers histone deacetylases, and sirtuins was suppressed; while the expression of TBX-regulated cellular senescence markers such as CDKN2A, CDKN1A, and CAV1 was elevated in the peripheral lung tissue samples from patients with COPD. The critical balance between senescence and anti-senescence factors is disrupted towards senescence in COPD lungs.

The ability to examine the behavior of biological systems in silico has the potential to greatly accelerate the pace of discovery in diseases, such as stroke, where in vivo analysis is time intensive and costly. In this paper we describe an approach for in silico examination of responses of the blood transcriptome to neuroprotective agents and subsequent stroke through the development of dynamic models of the regulatory processes observed in the experimental gene expression data. First, we identified functional gene clusters from these data. Next, we derived ordinary differential equations (ODEs) from the data relating these functional clusters to each other in terms of their regulatory influence on one another. Dynamic models were developed by coupling these ODEs into a model that simulates the expression of regulated functional clusters. By changing the magnitude of gene expression in the initial input state it was possible to assess the behavior of the networks through time under varying conditions since the dynamic model only requires an initial starting state, and does not require measurement of regulatory influences at each time point in order to make accurate predictions. We discuss the implications of our models on neuroprotection in stroke, explore the limitations of the approach, and report that an optimized dynamic model can provide accurate predictions of overall system behavior under several different neuroprotective paradigms.

The Software Environment for Biological Network Inference (SEBINI) has been created to provide an interactive environment for the deployment and testing of network inference algorithms that use high-throughput expression data. Networks inferred from the SEBINI software platform can be further analyzed using the Collective Analysis of Biological Interaction Networks (CABIN), software that allows integration and analysis of protein- protein interaction and gene-to-gene regulatory evidence obtained from multiple sources. In this paper, we present a case study on the SEBINI and CABIN tools for protein-protein interaction network reconstruction. Incorporating the Bayesian Estimator of Protein-Protein Association Probabilities (BEPro) algorithm into the SEBINI toolkit, we have created a pipeline for structural inference and supplemental analysis of protein- protein interaction networks from sets of mass spectrometry bait-prey experiment data.

BACKGROUND: The rapid growth of protein interactome data has elevated the necessity and importance of network analysis tools. However, unlike pure text data, network search spaces are of exponential complexity. This poses special challenges for storing, searching, and navigating this data efficiently. Moreover, development of effective web interfaces has been difficult. RESULTS: We present Integrator, a web-integrated graphical search tool for protein-protein interaction networks across 50+ genomes. CONCLUSION: Integrator provides single and multiple protein searches of the Bioverse database containing experimentally-derived and predicted protein-protein interactions. The interface provides animated local network views, rapid subgraph manipulation, and cross-referencing of functional annotations. Integrator is available at http://bioverse.compbio.washington.edu/integrator.

UNLABELLED: We have developed several new navigation features for a Java graph applet previously released for visualizing protein-protein interactions. This graph viewer can be used to navigate any molecular interactome dataset. We have successfully implemented this tool for exploring protein networks stored in the Bioverse interaction database. AVAILABILITY: http://bioverse.compbio.washington.edu/viewer CONTACT: [email protected].

MOTIVATION: Progress in large-scale experimental determination of protein-protein interaction networks for several organisms has resulted in innovative methods of functional inference based on network connectivity. However, the amount of effort and resources required for the elucidation of experimental protein interaction networks is prohibitive. Previously we, and others, have developed techniques to predict protein interactions for novel genomes using computational methods and data generated from other genomes. RESULTS: We evaluated the performance of a network-based functional annotation method that makes use of our predicted protein interaction networks. We show that this approach performs equally well on experimentally derived and predicted interaction networks, for both manually and computationally assigned annotations. We applied the method to predicted protein interaction networks for over 50 organisms from all domains of life, providing annotations for many previously unannotated proteins and verifying existing low-confidence annotations. AVAILABILITY: Functional predictions for over 50 organisms are available at http://bioverse.compbio.washington.edu and datasets used for analysis at http://data.compbio.washington.edu/misc/downloads/nannotation_data/. SUPPLEMENTARY INFORMATION: A supplemental appendix gives additional details not in the main text. (http://data.compbio.washington.edu/misc/downloads/nannotation_data/supplement.pdf).