2014
DOI: 10.1186/1756-0500-7-516
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for score aggregation over causal biological networks based on random walk sampling

Abstract: BackgroundWe recently published in BMC Systems Biology an approach for calculating the perturbation amplitudes of causal network models by integrating gene differential expression data. This approach relies on the process of score aggregation, which combines the perturbations at the level of the individual network nodes into a global measure that quantifies the perturbation of the network as a whole. Such "bottom-up" aggregation relates the changes in molecular entities measured by omics technologies to system… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…Some of them utilize Floyd-Warshall algorithm [ 34 ] to compute shortest paths between network’s components, with the aim of representing the underlying molecular mechanisms of genetic interactions [ 28 ]. Other approaches, such as the SST algorithm described in [ 29 ], focus on calculating Spanning Trees to model significant quantities in biochemical networks. While these approaches address different problems, ours addresses the network reconstruction based on proteomic data and prior knowledge of protein connectivity.…”
Section: Introductionmentioning
confidence: 99%
“…Some of them utilize Floyd-Warshall algorithm [ 34 ] to compute shortest paths between network’s components, with the aim of representing the underlying molecular mechanisms of genetic interactions [ 28 ]. Other approaches, such as the SST algorithm described in [ 29 ], focus on calculating Spanning Trees to model significant quantities in biochemical networks. While these approaches address different problems, ours addresses the network reconstruction based on proteomic data and prior knowledge of protein connectivity.…”
Section: Introductionmentioning
confidence: 99%
“…This property means that the edge-based relative sign between any two nodes must be unambiguous (i.e., must not depend of the specific path relating the two nodes). As most networks do not satisfy this condition (e.g., negative feedback loops are not causally consistent), the aggregation option would require additional processing to be operative [32].…”
mentioning
confidence: 99%