References of "Mizera, Andrzej 50002677"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailAn efficient approach towards the source-target control of Boolean networks
Paul, Soumya UL; Su, Cui UL; Pang, Jun UL et al

in IEEE/ACM Transactions on Computational Biology and Bioinformatics (in press)

We study the problem of computing a minimal subset of nodes of a given asynchronous Boolean network that need to be perturbed in a single-step to drive its dynamics from an initial state to a target ... [more ▼]

We study the problem of computing a minimal subset of nodes of a given asynchronous Boolean network that need to be perturbed in a single-step to drive its dynamics from an initial state to a target steady state (or attractor), which we call the source-target control of Boolean networks. Due to the phenomenon of state-space explosion, a simple global approach that performs computations on the entire network, may not scale well for large networks. We believe that efficient algorithms for such networks must exploit the structure of the networks together with their dynamics. Taking this view, we derive a decomposition-based solution to the minimal source-target control problem which can be significantly faster than the existing approaches on large networks. We then show that the solution can be further optimised if we take into account appropriate information about the source state. We apply our solutions to both real-life biological networks and randomly generated networks, demonstrating the efficiency and efficacy of our approach. [less ▲]

Detailed reference viewed: 55 (8 UL)
Full Text
Peer Reviewed
See detailA new decomposition-based method for detecting attractors in synchronous Boolean networks
Yuan, Qixia; Mizera, Andrzej UL; Pang, Jun UL et al

in Science of Computer Programming (2019), 180

Detailed reference viewed: 56 (5 UL)
Full Text
Peer Reviewed
See detailGPU-accelerated steady-state computation of large probabilistic Boolean networks
Mizera, Andrzej UL; Pang, Jun UL; Yuan, Qixia

in Formal Aspects of Computing (2019), 31(1), 27-46

Detailed reference viewed: 61 (1 UL)
Full Text
Peer Reviewed
See detailTaming asynchrony for attractor detection in large Boolean networks
Mizera, Andrzej UL; Pang, Jun UL; Qu, Hongyang et al

in IEEE/ACM Transactions on Computational Biology and Bioinformatics (2019), 16(1), 31-42

Detailed reference viewed: 67 (3 UL)
Full Text
Peer Reviewed
See detailA Decomposition-based Approach towards the Control of Boolean Networks
Paul, Soumya UL; Su, Cui; Pang, Jun UL et al

in Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (2018)

Detailed reference viewed: 72 (4 UL)
Full Text
Peer Reviewed
See detailReviving the two-state Markov chain approach
Mizera, Andrzej UL; Pang, Jun UL; Yuan, Qixia UL

in IEEE/ACM Transactions on Computational Biology and Bioinformatics (2018), 15(5), 1525-1537

Probabilistic Boolean networks (PBNs) is a well-established computational framework for modelling biological systems. The steady-state dynamics of PBNs is of crucial importance in the study of such ... [more ▼]

Probabilistic Boolean networks (PBNs) is a well-established computational framework for modelling biological systems. The steady-state dynamics of PBNs is of crucial importance in the study of such systems. However, for large PBNs, which often arise in systems biology, obtaining the steady-state distribution poses a significant challenge. In this paper, we revive the two-state Markov chain approach to solve this problem. This paper contributes in three aspects. First, we identify a problem of generating biased results with the approach and we propose a few heuristics to avoid such a pitfall. Secondly, we conduct an extensive experimental comparison of the extended two-state Markov chain approach and another approach based on the Skart method. We analyse the results with machine learning techniques and we show that statistically the two-state Markov chain approach has a better performance. Finally, we demonstrate the potential of the extended two-state Markov chain approach on a case study of a large PBN model of apoptosis in hepatocytes. [less ▲]

Detailed reference viewed: 103 (6 UL)
Full Text
Peer Reviewed
See detailASSA-PBN 3.0: Analysing Context-Sensitive Probabilistic Boolean Networks
Mizera, Andrzej UL; Pang, Jun UL; Qu, Hongyang et al

in Proceedings of the 16th International Conference on Computational Methods in Systems Biology (2018)

Detailed reference viewed: 63 (3 UL)
Full Text
Peer Reviewed
See detailASSA-PBN: A Toolbox for Probabilistic Boolean Networks
Mizera, Andrzej UL; Pang, Jun UL; Su, Cui et al

in IEEE/ACM Transactions on Computational Biology and Bioinformatics (2018), 15(4), 1203-1216

Detailed reference viewed: 49 (4 UL)
Full Text
Peer Reviewed
See detailA new decomposition method for attractor detection in large synchronous Boolean networks
Mizera, Andrzej UL; Pang, Jun UL; Qu, Hongyang et al

in Proceedings of the 3rd International Symposium on Dependable Software Engineering: Theories, Tools, and Applications (2017)

Detailed reference viewed: 109 (5 UL)
Full Text
Peer Reviewed
See detailParallel Approximate Steady-state Analysis of Large Probabilistic Boolean Networks
Mizera, Andrzej UL; Pang, Jun UL; Yuan, Qixia UL

in Proceedings of the 31st ACM Symposium on Applied Computing (2016, April)

Probabilistic Boolean networks (PBNs) is a widely used computational framework for modelling biological systems. The steady-state dynamics of PBNs is of special interest in the analysis of biological ... [more ▼]

Probabilistic Boolean networks (PBNs) is a widely used computational framework for modelling biological systems. The steady-state dynamics of PBNs is of special interest in the analysis of biological machinery. However, obtaining the steady-state distributions for such systems poses a significant challenge due to the state space explosion problem which arises in the case of large PBNs. The only viable way is to use statistical methods. In the literature, the two-state Markov chain approach and the Skart method have been proposed for the analysis of large PBNs. However, the sample size required by both methods is often huge in the case of large PBNs and generating them is expensive in terms of computation time. Parallelising the sample generation is an ideal way to solve this issue. In this paper, we consider combining the Gelman & Rubin method with either the two-state Markov chain approach or the Skart method for parallelisation. The first method can be used to run multiple independent Markov chains in parallel and to control their convergence to the steady-state while the other two methods can be used to determine the sample size required for computing the steady-state probability of states of interest. Experimental results show that our proposed combinations can reduce time cost of computing stead-state probabilities of large PBNs significantly. [less ▲]

Detailed reference viewed: 117 (9 UL)
Full Text
Peer Reviewed
See detailImproving BDD-based attractor detection for synchronous Boolean networks.
Yuan, Qixia UL; Qu, Hongyang; Pang, Jun UL et al

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

Detailed reference viewed: 126 (24 UL)
Full Text
Peer Reviewed
See detailChemometric analysis of attenuated total reflectance infrared spectra of Proteus mirabilis strains with defined structures of LPS.
Zarnowiec, Paulina; Mizera, Andrzej UL; Chrapek, Magdalena et al

in Innate Immunity (2016), 22(5), 325-335

Detailed reference viewed: 128 (5 UL)
Full Text
Peer Reviewed
See detailASSA-PBN 2.0: A software tool for probabilistic Boolean networks.
Mizera, Andrzej UL; Pang, Jun UL; Yuan, Qixia UL

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

Detailed reference viewed: 120 (10 UL)
Full Text
Peer Reviewed
See detailFast simulation of probabilistic Boolean networks.
Mizera, Andrzej UL; Pang, Jun UL; Yuan, Qixia UL

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

Detailed reference viewed: 89 (5 UL)
Full Text
Peer Reviewed
See detailImproving BDD-based attractor detection for synchronous Boolean networks
Qu, Hongyang; Yuan, Qixia UL; Pang, Jun UL et al

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 ▲]

Detailed reference viewed: 88 (6 UL)
Full Text
Peer Reviewed
See detailASSA-PBN: An approximate steady-state analyser for probabilistic Boolean networks
Mizera, Andrzej UL; Pang, Jun UL; Yuan, Qixia UL

in Proceedings of the 13th International Symposium on Automated Technology for Verification and Analysis (ATVA'15) (2015)

Detailed reference viewed: 113 (10 UL)
Full Text
Peer Reviewed
See detailActivity tracking: A new attack on location privacy
Chen, Xihui; Mizera, Andrzej UL; Pang, Jun UL

in Proceedings of the 3rd IEEE Conference on Communications and Network Security (CNS'15) (2015)

Detailed reference viewed: 97 (11 UL)
Full Text
Peer Reviewed
See detailoptPBN: An Optimisation Toolbox for Probabilistic Boolean Networks
Trairatphisan, Panuwat UL; Mizera, Andrzej UL; Pang, Jun UL et al

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 ▲]

Detailed reference viewed: 167 (17 UL)
Full Text
Peer Reviewed
See detailModel-checking based approaches to parameter estimation of gene regulatory networks
Mizera, Andrzej UL; Pang, Jun UL; Yuan, Qixia UL

in Proceedings of 19th IEEE Conference on Engineering of Complex Computer Systems (2014)

Detailed reference viewed: 97 (11 UL)