A new decomposition-based method for detecting attractors in synchronous Boolean networks

in Science of Computer Programming (2019), 180

GPU-accelerated steady-state analysis of probabilistic Boolean networks

Poster (2016)

ASSA-PBN 2.0: A software tool for probabilistic Boolean networks.

in Proceedings of 14th International Conference on Computational Methods in Systems Biology (2016)

Improving BDD-based attractor detection for synchronous Boolean networks.

in SCIENCE CHINA Information Sciences (2016), 59(8), 0801011-08010116

Improving BDD-based attractor detection for synchronous Boolean networks

in Proceedings of the 7th Asia-Pacific Symposium on Internetware (2015)

Boolean networks are an important formalism for modelling biological systems and have attracted much attention in recent years. An important direction in Boolean networks is to exhaustively find ... [more ▼]

Boolean networks are an important formalism for modelling biological systems and have attracted much attention in recent years. An important direction in Boolean networks is to exhaustively find attractors, which represent steady states when a biological network evolves for a long term. In this paper, we propose a new approach to improve the efficiency of BDD-based attractor detection. Our approach includes a monolithic algorithm for small networks, an enumerative strategy to deal with large networks, and two heuristics on ordering BDD variables. We demonstrate the performance of our approach on a number of examples, and compare it with one existing technique in the literature. [less ▲]

optPBN: An Optimisation Toolbox for Probabilistic Boolean Networks

in PLoS ONE (2014), 9(7), 980011-15

Background There exist several computational tools which allow for the optimisation and inference of biological networks using a Boolean formalism. Nevertheless, the results from such tools yield only ... [more ▼]

Background There exist several computational tools which allow for the optimisation and inference of biological networks using a Boolean formalism. Nevertheless, the results from such tools yield only limited quantitative insights into the complexity of biological systems because of the inherited qualitative nature of Boolean networks. Results We introduce optPBN, a Matlab-based toolbox for the optimisation of probabilistic Boolean networks (PBN) which operates under the framework of the BN/PBN toolbox. optPBN offers an easy generation of probabilistic Boolean networks from rule-based Boolean model specification and it allows for flexible measurement data integration from multiple experiments. Subsequently, optPBN generates integrated optimisation problems which can be solved by various optimisers. In term of functionalities, optPBN allows for the construction of a probabilistic Boolean network from a given set of potential constitutive Boolean networks by optimising the selection probabilities for these networks so that the resulting PBN fits experimental data. Furthermore, the optPBN pipeline can also be operated on large-scale computational platforms to solve complex optimisation problems. Apart from exemplary case studies which we correctly inferred the original network, we also successfully applied optPBN to study a large-scale Boolean model of apoptosis where it allows identifying the inverse correlation between UVB irradiation, NFκB and Caspase 3 activations, and apoptosis in primary hepatocytes quantitatively. Also, the results from optPBN help elucidating the relevancy of crosstalk interactions in the apoptotic network. Summary The optPBN toolbox provides a simple yet comprehensive pipeline for integrated optimisation problem generation in the PBN formalism that can readily be solved by various optimisers on local or grid-based computational platforms. optPBN can be further applied to various biological studies such as the inference of gene regulatory networks or the identification of the interaction's relevancy in signal transduction networks. [less ▲]

Recent development and biomedical applications of probabilistic Boolean networks

in Cell Communication and Signaling (2013), 11(46),

Probabilistic Boolean network (PBN) modelling is a semi-quantitative approach widely used for the study of the topology and dynamic aspects of biological systems. The combined use of rule-based ... [more ▼]

Probabilistic Boolean network (PBN) modelling is a semi-quantitative approach widely used for the study of the topology and dynamic aspects of biological systems. The combined use of rule-based representation and probability makes PBN appealing for large-scale modelling of biological networks where degrees of uncertainty need to be considered. A considerable expansion of our knowledge in the field of theoretical research on PBN can be observed over the past few years, with a focus on network inference, network intervention and control. With respect to areas of applications, PBN is mainly used for the study of gene regulatory networks though with an increasing emergence in signal transduction, metabolic, and also physiological networks. At the same time, a number of computational tools, facilitating the modelling and analysis of PBNs, are continuously developed. A concise yet comprehensive review of the state-of-the-art on PBN modelling is offered in this article, including a comparative discussion on PBN versus similar models with respect to concepts and biomedical applications. Due to their many advantages, we consider PBN to stand as a suitable modelling framework for the description and analysis of complex biological systems, ranging from molecular to physiological levels. [less ▲]

Mathematical modelling of the Platelet-Derived Growth Factor (PDGF) signalling pathway

in Proceedings of 4th Workshop on Computational Models for Cell Processes (CompMod'13) (2013)

Quantitative analysis of the self-assembly strategies of intermediate filaments from tetrameric vimentin

in IEEE/ACM Transactions on Computational Biology and Bioinformatics (2012), 9(3), 885-898

A Boolean Approach for Disentangling the Roles of Submodules to the Global Properties of a Biomodel

in Fundamenta Informaticae (2012), 116(1-4), 51-63