Do-it-yourself networks: a novel method of generating weighted networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Shanafelt DW
PROVIDER: S-EPMC5717683 | biostudies-literature | 2017 Nov
REPOSITORIES: biostudies-literature
Publications
Do-it-yourself networks: a novel method of generating weighted networks.
Shanafelt D W DW Salau K R KR Baggio J A JA
Royal Society open science 20171122 11
Network theory is finding applications in the life and social sciences for ecology, epidemiology, finance and social-ecological systems. While there are methods to generate specific types of networks, the broad literature is focused on generating <i>unweighted</i> networks. In this paper, we present a framework for generating <i>weighted</i> networks that satisfy user-defined criteria. Each criterion hierarchically defines a feature of the network and, in doing so, complements existing algorithm ...[more]
Similar Datasets
Project description:Even within well-studied organisms, many genes lack useful functional annotations. One way to generate such functional information is to infer biological relationships between genes or proteins, using a network of gene coexpression data that includes functional annotations. Signed distance correlation has proved useful for the construction of unweighted gene coexpression networks. However, transforming correlation values into unweighted networks may lead to a loss of important biological information related to the intensity of the correlation. Here we introduce a principled method to construct weighted gene coexpression networks using signed distance correlation. These networks contain weighted edges only between those pairs of genes whose correlation value is higher than a given threshold. We analyse data from different organisms and find that networks generated with our method based on signed distance correlation are more stable and capture more biological information compared to networks obtained from Pearson correlation. Moreover, we show that signed distance correlation networks capture more biological information than unweighted networks based on the same metric. While we use biological data sets to illustrate the method, the approach is general and can be used to construct networks in other domains. Code and data are available on https://github.com/javier-pardodiaz/sdcorGCN.
| S-EPMC7613200 | biostudies-literature
Project description:Networks are ubiquitous in biology where they encode connectivity patterns at all scales of organization, from molecular to the biome. However, biological networks are noisy due to the limitations of measurement technology and inherent natural variation, which can hamper discovery of network patterns and dynamics. We propose Network Enhancement (NE), a method for improving the signal-to-noise ratio of undirected, weighted networks. NE uses a doubly stochastic matrix operator that induces sparsity and provides a closed-form solution that increases spectral eigengap of the input network. As a result, NE removes weak edges, enhances real connections, and leads to better downstream performance. Experiments show that NE improves gene-function prediction by denoising tissue-specific interaction networks, alleviates interpretation of noisy Hi-C contact maps from the human genome, and boosts fine-grained identification accuracy of species. Our results indicate that NE is widely applicable for denoising biological networks.
| S-EPMC6078978 | biostudies-literature
Project description:Co-conservation (phylogenetic profiles) is a well-established method for predicting functional relationships between proteins. Several publicly available databases use this method and additional clustering strategies to develop networks of protein interactions (cluster co-conservation (CCC)). CCC has previously been limited to interactions within a single target species. We have extended CCC to develop protein interaction networks based on co-conservation between protein pairs across multiple species, cross-species cluster co-conservation.
| S-EPMC2375023 | biostudies-literature
Project description:Bacterial expression of full length beta-amyloid (Abeta) is problematic because of toxicity and poor solubility of the expressed protein, and a strong tendency of Met35 to become oxidized in inclusion bodies. We have developed a semisynthetic method in which Abeta1-29 is expressed in bacteria as part of a fusion protein with a C-terminal intein and Chitin-Binding Domain (CBD). There is also a single residue, N-terminal Met extension. The protein, Met-Abeta1-29-Intein-CBD, is well expressed and highly water-soluble. After binding of the expressed protein to Chitin beads, treatment with sodium 2-mercapto-ethane sulfonate (MESNA) yields Met-Abeta1-29-MESNA, with a C-terminal thioester suitable for native chemical ligation. Met-Abeta1-29-MESNA is first subjected to CNBr cleavage, which removes the N-terminal Met residue, but leaves the thioester intact. We synthesized NH2-A30C-Abeta30-40, which has an N-terminal Cys residue and is the partner for native chemical ligation with Met-Abeta1-29-MESNA. Native chemical ligation proceeds rapidly and efficiently (>90% yield) to give A30C-Abeta1-40. The final step is selective desulfurization using Raney-Ni, which also proceeds rapidly and efficiently (>90% yield) to give native sequence Abeta1-40. Overall, this system is highly efficient, and can yield approximately 8-10 mg of pure Abeta1-40 from one liter of bacterial culture medium. This procedure is adaptable for producing other Abeta peptides. We have also expressed an Abeta construct bearing a point mutation associated with one type of familial Alzheimer's Disease, the Iowa mutation, i.e., Met-D23N-Abeta1-29-Intein-CBD. Since expression of the intein-containing fusion protein is robust in minimal media as well as standard enriched media, this procedure also can be readily modified for incorporating 15N or 13C labels for NMR. Future work will also include extending this system to longer Abeta peptides, such as Abeta1-42.
| S-EPMC2965776 | biostudies-literature
Project description:One of the most important challenges in network science is to quantify the information encoded in complex network structures. Disentangling randomness from organizational principles is even more demanding when networks have a multiplex nature. Multiplex networks are multilayer systems of [Formula: see text] nodes that can be linked in multiple interacting and co-evolving layers. In these networks, relevant information might not be captured if the single layers were analyzed separately. Here we demonstrate that such partial analysis of layers fails to capture significant correlations between weights and topology of complex multiplex networks. To this end, we study two weighted multiplex co-authorship and citation networks involving the authors included in the American Physical Society. We show that in these networks weights are strongly correlated with multiplex structure, and provide empirical evidence in favor of the advantage of studying weighted measures of multiplex networks, such as multistrength and the inverse multiparticipation ratio. Finally, we introduce a theoretical framework based on the entropy of multiplex ensembles to quantify the information stored in multiplex networks that would remain undetected if the single layers were analyzed in isolation.
| S-EPMC4048161 | biostudies-literature
Project description:Oncolytic adenoviruses have become ideal agents in the path toward treating cancer. Such viruses have been engineered to conditionally replicate in malignant cells in which certain signaling pathways have been disrupted. Other than such oncolytic properties, the viruses need to activate the immune system in order to sustain a long-term response. Therefore, oncolytic adenoviruses have been genetically modified to express various immune-stimulatory agents to achieve this. However, genetically modifying adenoviruses is very time consuming and labor intensive with the current available methods. In this paper, we describe a novel method we have called GAMER-Ad to genetically modify adenovirus genomes within 2 days. Our method entails the replacement of the gp19k gene in the E3 region with any given gene of interest (GOI) using Gibson Assembly avoiding the homologous recombination between the shuttle and the parental plasmid. In this manuscript as proof of concept we constructed and characterized three oncolytic adenoviruses expressing CXCL9, CXCL10, and interleukin-15 (IL-15). We demonstrate that our novel method is fast, reliable, and simple compared to other methods. We anticipate that our method will be used in the future to genetically engineer oncolytic but also other adenoviruses used for gene therapy as well.
| S-EPMC7907680 | biostudies-literature
Project description:In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.
| S-EPMC3779854 | biostudies-other
Project description:Research on generative models plays a central role in the emerging field of network science, studying how statistical patterns found in real networks could be generated by formal rules. Output from these generative models is then the basis for designing and evaluating computational methods on networks including verification and simulation studies. During the last two decades, a variety of models has been proposed with an ultimate goal of achieving comprehensive realism for the generated networks. In this study, we (a) introduce a new generator, termed ReCoN; (b) explore how ReCoN and some existing models can be fitted to an original network to produce a structurally similar replica, (c) use ReCoN to produce networks much larger than the original exemplar, and finally (d) discuss open problems and promising research directions. In a comparative experimental study, we find that ReCoN is often superior to many other state-of-the-art network generation methods. We argue that ReCoN is a scalable and effective tool for modeling a given network while preserving important properties at both micro- and macroscopic scales, and for scaling the exemplar data by orders of magnitude in size.
| S-EPMC6225971 | biostudies-other
Project description:Predicting the biological function of all the genes of an organism is one of the fundamental goals of computational system biology. In the last decade, high-throughput experimental methods for studying the functional interactions between gene products (GPs) have been combined with computational approaches based on Bayesian networks for data integration. The result of these computational approaches is an interaction network with weighted links representing connectivity likelihood between two functionally related GPs. The weighted network generated by these computational approaches can be used to predict annotations for functionally uncharacterized GPs. Here we introduce Weighted Network Predictor (WNP), a novel algorithm for function prediction of biologically uncharacterized GPs. Tests conducted on simulated data show that WNP outperforms other 5 state-of-the-art methods in terms of both specificity and sensitivity and that it is able to better exploit and propagate the functional and topological information of the network. We apply our method to Saccharomyces cerevisiae yeast and Arabidopsis thaliana networks and we predict Gene Ontology function for about 500 and 10000 uncharacterized GPs respectively.
| S-EPMC3386258 | biostudies-literature
Project description:In the analysis of networks we frequently require the statistical significance of some network statistic, such as measures of similarity for the properties of interacting nodes. The structure of the network may introduce dependencies among the nodes and it will in general be necessary to account for these dependencies in the statistical analysis. To this end we require some form of Null model of the network: generally rewired replicates of the network are generated which preserve only the degree (number of interactions) of each node. We show that this can fail to capture important features of network structure, and may result in unrealistic significance levels, when potentially confounding additional information is available.We present a new network resampling Null model which takes into account the degree sequence as well as available biological annotations. Using gene ontology information as an illustration we show how this information can be accounted for in the resampling approach, and the impact such information has on the assessment of statistical significance of correlations and motif-abundances in the Saccharomyces cerevisiae protein interaction network. An algorithm, GOcardShuffle, is introduced to allow for the efficient construction of an improved Null model for network data.We use the protein interaction network of S. cerevisiae; correlations between the evolutionary rates and expression levels of interacting proteins and their statistical significance were assessed for Null models which condition on different aspects of the available data. The novel GOcardShuffle approach results in a Null model for annotated network data which appears better to describe the properties of real biological networks.An improved statistical approach for the statistical analysis of biological network data, which conditions on the available biological information, leads to qualitatively different results compared to approaches which ignore such annotations. In particular we demonstrate the effects of the biological organization of the network can be sufficient to explain the observed similarity of interacting proteins.
| S-EPMC2241843 | biostudies-other