| Literature DB >> 25436094 |
Nahid Safari-Alighiarloo1, Mohammad Taghizadeh2, Mostafa Rezaei-Tavirani1, Bahram Goliaei2, Ali Asghar Peyvandi3.
Abstract
The physical interaction of proteins which lead to compiling them into large densely connected networks is a noticeable subject to investigation. Protein interaction networks are useful because of making basic scientific abstraction and improving biological and biomedical applications. Based on principle roles of proteins in biological function, their interactions determine molecular and cellular mechanisms, which control healthy and diseased states in organisms. Therefore, such networks facilitate the understanding of pathogenic (and physiologic) mechanisms that trigger the onset and progression of diseases. Consequently, this knowledge can be translated into effective diagnostic and therapeutic strategies. Furthermore, the results of several studies have proved that the structure and dynamics of protein networks are disturbed in complex diseases such as cancer and autoimmune disorders. Based on such relationship, a novel paradigm is suggested in order to confirm that the protein interaction networks can be the target of therapy for treatment of complex multi-genic diseases rather than individual molecules with disrespect the network.Entities:
Keywords: Complex diseases; Networks; PPI
Year: 2014 PMID: 25436094 PMCID: PMC4017556
Source DB: PubMed Journal: Gastroenterol Hepatol Bed Bench ISSN: 2008-2258
Basic definitions in PPI network
| Term | Definition |
|---|---|
| Node or (Vertices) | Each protein in network |
| Edge or (link) | Physical or functional interactions between proteins |
| Hub | Each “high-degree” node of a network |
| Modules | Group of sub networks in which each sub network includes a high number of inside-sub network links and a low number of between- sub network links |
| Degree (k) | The number of adjacent links |
| Average degree (<k> ) | The mean of all degree values of nodes in a network. |
| Clustering Coefficient (<C> ) | The proportion of links between the nodes within the |
| Shortest Path Length | The steps (number of links) needed to connect every pair of nodes through their shortest path. |
| Diameter | The minimum number of links that separate the two most distant nodes in a network. |
| Betweenness centrality | Measures how often nodes occur on the shortest paths between other nodes |
| Heterogeneity of a network | the coefficient of variation of the degree distribution |