Published in

Oxford University Press, Bioinformatics, 20(37), p. 3530-3537, 2021

DOI: 10.1093/bioinformatics/btab277

Links

Tools

Export citation

Search in Google Scholar

Capturing dynamic relevance in Boolean networks using graph theoretical measures

This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Abstract Motivation Interaction graphs are able to describe regulatory dependencies between compounds without capturing dynamics. In contrast, mathematical models that are based on interaction graphs allow to investigate the dynamics of biological systems. However, since dynamic complexity of these models grows exponentially with their size, exhaustive analyses of the dynamics and consequently screening all possible interventions eventually becomes infeasible. Thus, we designed an approach to identify dynamically relevant compounds based on the static network topology. Results Here, we present a method only based on static properties to identify dynamically influencing nodes. Coupling vertex betweenness and determinative power, we could capture relevant nodes for changing dynamics with an accuracy of 75% in a set of 35 published logical models. Further analyses of the selected compounds’ connectivity unravelled a new class of not highly connected nodes with high impact on the networks’ dynamics, which we call gatekeepers. We validated our method’s working concept on logical models, which can be readily scaled up to complex interaction networks, where dynamic analyses are not even feasible. Availability and implementation Code is freely available at https://github.com/sysbio-bioinf/BNStatic. Supplementary information Supplementary data are available at Bioinformatics online.