Browse
Submit Data
Databases
API
Help

Dataset Information

20 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

An activation force-based affinity measure for analyzing complex networks.

ABSTRACT: Affinity measure is a key factor that determines the quality of the analysis of a complex network. Here, we introduce a type of statistics, activation forces, to weight the links of a complex network and thereby develop a desired affinity measure. We show that the approach is superior in facilitating the analysis through experiments on a large-scale word network and a protein-protein interaction (PPI) network consisting of ?5,000 human proteins. The experiment on the word network verifies that the measured word affinities are highly consistent with human knowledge. Further, the experiment on the PPI network verifies the measure and presents a general method for the identification of functionally similar proteins based on PPIs. Most strikingly, we find an affinity network that compactly connects the cancer-associated proteins to each other, which may reveal novel information for cancer study; this includes likely protein interactions and key proteins in cancer-related signal transduction pathways.

SUBMITTER: Guo J

PROVIDER: S-EPMC3216595 | biostudies-literature | 2011

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

An activation force-based affinity measure for analyzing complex networks.

Guo Jun J Guo Hanliang H Wang Zhanyi Z

Scientific reports 20111012

Affinity measure is a key factor that determines the quality of the analysis of a complex network. Here, we introduce a type of statistics, activation forces, to weight the links of a complex network and thereby develop a desired affinity measure. We show that the approach is superior in facilitating the analysis through experiments on a large-scale word network and a protein-protein interaction (PPI) network consisting of ∼5,000 human proteins. The experiment on the word network verifies that t ...[more]

PMID: 22355630

Similar Datasets

Method for analyzing signaling networks in complex cellular systems.

Project description:Now that the human genome has been sequenced, the challenge of assigning function to human genes has become acute. Existing approaches using microarrays or proteomics frequently generate very large volumes of data not directly related to biological function, making interpretation difficult. Here, we describe a technique for integrative systems biology in which: (i) primary cells are cultured under biologically meaningful conditions; (ii) a limited number of biologically meaningful readouts are measured; and (iii) the results obtained under several different conditions are combined for analysis. Studies of human endothelial cells overexpressing different signaling molecules under multiple inflammatory conditions show that this system can capture a remarkable range of functions by a relatively small number of simple measurements. In particular, measurement of seven different protein levels by ELISA under four different conditions is capable of reconstructing pathway associations of 25 different proteins representing four known signaling pathways, implicating additional participants in the NF-kappaBorRAS/mitogen-activated protein kinase pathways and defining additional interactions between these pathways.

| S-EPMC337034 | biostudies-literature

A weighted communicability measure applied to complex brain networks.

Project description:Recent advances in experimental neuroscience allow non-invasive studies of the white matter tracts in the human central nervous system, thus making available cutting-edge brain anatomical data describing these global connectivity patterns. Through magnetic resonance imaging, this non-invasive technique is able to infer a snapshot of the cortical network within the living human brain. Here, we report on the initial success of a new weighted network communicability measure in distinguishing local and global differences between diseased patients and controls. This approach builds on recent advances in network science, where an underlying connectivity structure is used as a means to measure the ease with which information can flow between nodes. One advantage of our method is that it deals directly with the real-valued connectivity data, thereby avoiding the need to discretize the corresponding adjacency matrix, i.e. to round weights up to 1 or down to 0, depending upon some threshold value. Experimental results indicate that the new approach is able to extract biologically relevant features that are not immediately apparent from the raw connectivity data.

| S-EPMC2658663 | biostudies-literature

Hierarchical Decomposition for Betweenness Centrality Measure of Complex Networks.

Project description:Betweenness centrality is an indicator of a node's centrality in a network. It is equal to the number of shortest paths from all vertices to all others that pass through that node. Most of real-world large networks display a hierarchical community structure, and their betweenness computation possesses rather high complexity. Here we propose a new hierarchical decomposition approach to speed up the betweenness computation of complex networks. The advantage of this new method is its effective utilization of the local structural information from the hierarchical community. The presented method can significantly speed up the betweenness calculation. This improvement is much more evident in those networks with numerous homogeneous communities. Furthermore, the proposed method features a parallel structure, which is very suitable for parallel computation. Moreover, only a small amount of additional computation is required by our method, when small changes in the network structure are restricted to some local communities. The effectiveness of the proposed method is validated via the examples of two real-world power grids and one artificial network, which demonstrates that the performance of the proposed method is superior to that of the traditional method.

| S-EPMC5397849 | biostudies-other

Analyzing networks of phenotypes in complex diseases: methodology and applications in COPD.

Project description:The investigation of complex disease heterogeneity has been challenging. Here, we introduce a network-based approach, using partial correlations, that analyzes the relationships among multiple disease-related phenotypes.We applied this method to two large, well-characterized studies of chronic obstructive pulmonary disease (COPD). We also examined the associations between these COPD phenotypic networks and other factors, including case-control status, disease severity, and genetic variants. Using these phenotypic networks, we have detected novel relationships between phenotypes that would not have been observed using traditional epidemiological approaches.Phenotypic network analysis of complex diseases could provide novel insights into disease susceptibility, disease severity, and genetic mechanisms.

| S-EPMC4105829 | biostudies-literature

A novel perturbation based compression complexity measure for networks.

Project description:Measuring complexity of brain networks in the form of integrated information is a leading approach towards building a fundamental theory of consciousness. Integrated Information Theory (IIT) has gained attention in this regard due to its theoretically strong framework. Nevertheless, it faces some limitations such as current state dependence, computational intractability and inability to be applied to real brain data. On the other hand, Perturbational Complexity Index (PCI) is a clinical measure for distinguishing different levels of consciousness. Though PCI claims to capture the functional differentiation and integration in brain networks (similar to IIT), its link to integrated information is rather weak. Inspired by these two perspectives, we propose a new complexity measure for brain networks - ΦC using a novel perturbation based compression-complexity approach that serves as a bridge between the two, for the first time. ΦC is founded on the principles of lossless data compression based complexity measures which is computed by a perturbational approach. ΦC exhibits following salient innovations: (i) mathematically well bounded, (ii) negligible current state dependence unlike Φ, (iii) network complexity measured as compression-complexity rather than as an infotheoretic quantity, and (iv) lower computational complexity since number of atomic bipartitions scales linearly with the number of nodes of the network, thus avoiding combinatorial explosion. Our computations have revealed that ΦC has similar hierarchy to <Φ> for several multiple-node networks and it demonstrates a rich interplay between differentiation, integration and entropy of the nodes of a network. ΦC is a promising heuristic measure to characterize network complexity (and hence might be useful in contributing to building a measure of consciousness) with potential applications in estimating brain complexity on neurophysiological data.

| S-EPMC6383034 | biostudies-literature

Degree difference: a simple measure to characterize structural heterogeneity in complex networks.

Project description:Despite the growing interest in characterizing the local geometry leading to the global topology of networks, our understanding of the local structure of complex networks, especially real-world networks, is still incomplete. Here, we analyze a simple, elegant yet underexplored measure, 'degree difference' (DD) between vertices of an edge, to understand the local network geometry. We describe the connection between DD and global assortativity of the network from both formal and conceptual perspective, and show that DD can reveal structural properties that are not obtained from other such measures in network science. Typically, edges with different DD play different structural roles and the DD distribution is an important network signature. Notably, DD is the basic unit of assortativity. We provide an explanation as to why DD can characterize structural heterogeneity in mixing patterns unlike global assortativity and local node assortativity. By analyzing synthetic and real networks, we show that DD distribution can be used to distinguish between different types of networks including those networks that cannot be easily distinguished using degree sequence and global assortativity. Moreover, we show DD to be an indicator for topological robustness of scale-free networks. Overall, DD is a local measure that is simple to define, easy to evaluate, and that reveals structural properties of networks not readily seen from other measures.

| S-EPMC7721722 | biostudies-literature

Low-affinity binding in cis to P2Y2R mediates force-dependent integrin activation during hantavirus infection.

Project description:Pathogenic hantaviruses bind to the plexin-semaphorin-integrin (PSI) domain of inactive, ?3 integrins. Previous studies have implicated a cognate cis interaction between the bent conformation ?5/?3 integrins and an arginine-glycine-aspartic acid (RGD) sequence in the first extracellular loop of P2Y2R. With single-molecule atomic force microscopy, we show a specific interaction between an atomic force microscopy tip decorated with recombinant ?IIb?3 integrins and (RGD)P2Y2R expressed on cell membranes. Mutation of the RGD sequence to RGE in the P2Y2R removes this interaction. Binding of inactivated and fluorescently labeled Sin Nombre virus (SNV) to the integrin PSI domain stimulates higher affinity for (RGD)P2Y2R on cells, as measured by an increase in the unbinding force. In CHO cells, stably expressing ?IIb?3 integrins, virus engagement at the integrin PSI domain, recapitulates physiologic activation of the integrin as indicated by staining with the activation-specific mAB PAC1. The data also show that blocking of the G?13 protein from binding to the cytoplasmic domain of the ?3 integrin prevents outside-in signaling and infection. We propose that the cis interaction with P2Y2R provides allosteric resistance to the membrane-normal motion associated with the switchblade model of integrin activation, where the development of tensile force yields physiological integrin activation.

| S-EPMC5638590 | biostudies-literature

Affinity-based proteomics reveal cancer-specific networks coordinated by Hsp90.

Project description:Most cancers are characterized by multiple molecular alterations, but identification of the key proteins involved in these signaling pathways is currently beyond reach. We show that the inhibitor PU-H71 preferentially targets tumor-enriched Hsp90 complexes and affinity captures Hsp90-dependent oncogenic client proteins. We have used PU-H71 affinity capture to design a proteomic approach that, when combined with bioinformatic pathway analysis, identifies dysregulated signaling networks and key oncoproteins in chronic myeloid leukemia. The identified interactome overlaps with the well-characterized altered proteome in this cancer, indicating that this method can provide global insights into the biology of individual tumors, including primary patient specimens. In addition, we show that this approach can be used to identify previously uncharacterized oncoproteins and mechanisms, potentially leading to new targeted therapies. We further show that the abundance of the PU-H71-enriched Hsp90 species, which is not dictated by Hsp90 expression alone, is predictive of the cell's sensitivity to Hsp90 inhibition.

| S-EPMC3265389 | biostudies-literature

Action-based Modeling of Complex Networks.

Project description:Complex networks can model a wide range of complex systems in nature and society, and many algorithms (network generators) capable of synthesizing networks with few and very specific structural characteristics (degree distribution, average path length, etc.) have been developed. However, there remains a significant lack of generators capable of synthesizing networks with strong resemblance to those observed in the real-world, which can subsequently be used as a null model, or to perform tasks such as extrapolation, compression and control. In this paper, a robust new approach we term Action-based Modeling is presented that creates a compact probabilistic model of a given target network, which can then be used to synthesize networks of arbitrary size. Statistical comparison to existing network generators is performed and results show that the performance of our approach is comparable to the current state-of-the-art methods on a variety of network measures, while also yielding easily interpretable generators. Additionally, the action-based approach described herein allows the user to consider an arbitrarily large set of structural characteristics during the generator design process.

| S-EPMC5532273 | biostudies-literature

Analyzing synchronized clusters in neuron networks.

Project description:The presence of synchronized clusters in neuron networks is a hallmark of information transmission and processing. Common approaches to study cluster synchronization in networks of coupled oscillators ground on simplifying assumptions, which often neglect key biological features of neuron networks. Here we propose a general framework to study presence and stability of synchronous clusters in more realistic models of neuron networks, characterized by the presence of delays, different kinds of neurons and synapses. Application of this framework to two examples with different size and features (the directed network of the macaque cerebral cortex and the swim central pattern generator of a mollusc) provides an interpretation key to explain known functional mechanisms emerging from the combination of anatomy and neuron dynamics. The cluster synchronization analysis is carried out also by changing parameters and studying bifurcations. Despite some modeling simplifications in one of the examples, the obtained results are in good agreement with previously reported biological data.

| S-EPMC7530773 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data