2021
DOI: 10.1007/978-1-0716-1032-9_14
|View full text |Cite
|
Sign up to set email alerts
|

A Practical Step-by-Step Guide for Quantifying Retroactivity in Gene Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 61 publications
0
4
0
Order By: Relevance
“…In this work, for each node n of a network was calculated using the Brandes algorithm [ 77 ]. The betweenness centrality of a node n reflects the amount of control that this node exerts over the interaction between communities of neighboring nodes in the network [ 78 ] and can be computed as follows: where s and t are the source and target nodes in the network different from n , denotes the number of shortest paths from all s to all t , and is the number of shortest paths from s to t that must pass through node n . Here, unweighted betweenness centralities were calculated for each node in the literature-informed protein–protein network.…”
Section: Methodsmentioning
confidence: 99%
“…In this work, for each node n of a network was calculated using the Brandes algorithm [ 77 ]. The betweenness centrality of a node n reflects the amount of control that this node exerts over the interaction between communities of neighboring nodes in the network [ 78 ] and can be computed as follows: where s and t are the source and target nodes in the network different from n , denotes the number of shortest paths from all s to all t , and is the number of shortest paths from s to t that must pass through node n . Here, unweighted betweenness centralities were calculated for each node in the literature-informed protein–protein network.…”
Section: Methodsmentioning
confidence: 99%
“…In this work, C b ( n ) for each node n of a network was calculated using the Brandes algorithm. 47 The betweenness centrality of a node n reflects the amount of control that this node exerts over the interaction between communities of neighboring nodes in the network 48 and can be computed as follows: Where s and t are the source and target nodes in the network different from n , σ s,t denotes the number of shortest paths from all s to all t , and σ s,t is the number of shortest paths from s to t that must pass through node n . Here, unweighted betweenness centralities were calculated for each node in the literature-informed protein-protein network.…”
Section: Methodsmentioning
confidence: 99%
“…In this work, 𝐶 𝑏 (𝑛) for each node n of a network was calculated using the Brandes algorithm. 47 The betweenness centrality of a node n reflects the amount of control that this node exerts over the interaction between communities of neighboring nodes in the network 48 and can be computed as follows:…”
Section: Network Topological Analysismentioning
confidence: 99%
“…Orthogonal systems and resource allocation. Cellular functions are interconnected, and exogenous constructs can be affected by retroactivity, where changes in a downstream process impact the functionality of upstream modules, leading to difficult-to-predict effects [36,37]. For this reason, attention has been dedicated to the development of orthogonal components that enable the insulation of exogenous processes from the native gene expression machinery [38,39].…”
Section: Introductionmentioning
confidence: 99%