ASSA-PBN: An approximate steady-state analyser of probabilistic boolean networks

17Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present ASSA-PBN, a tool for approximate steady-state analysis of large probabilistic Boolean networks (PBNs). ASSA-PBN contains a constructor, a simulator, and an analyser which can approximately compute the steady-state probabilities of PBNs. For large PBNs, such approximate analysis is the only viable way to study their long-run behaviours. Experiments show that ASSA-PBN can handle large PBNs with a few thousands of nodes.

Cite

CITATION STYLE

APA

Mizera, A., Pang, J., & Yuan, Q. (2015). ASSA-PBN: An approximate steady-state analyser of probabilistic boolean networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9364, pp. 214–220). Springer Verlag. https://doi.org/10.1007/978-3-319-24953-7_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free