Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Nikola Beneš"'
Publikováno v:
BMC Bioinformatics, Vol 23, Iss 1, Pp 1-18 (2022)
Abstract Background Boolean networks (BNs) provide an effective modelling formalism for various complex biochemical phenomena. Their long term behaviour is represented by attractors–subsets of the state space towards which the BN eventually converg
Externí odkaz:
https://doaj.org/article/8aab5820f4274e3db54d2030ac333253
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 1 (2022)
Edge-coloured directed graphs provide an essential structure for modelling and analysis of complex systems arising in many scientific disciplines (e.g. feature-oriented systems, gene regulatory networks, etc.). One of the fundamental problems for edg
Externí odkaz:
https://doaj.org/article/b81b0d37cae24805936051030bc24352
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 72, Iss Proc. PDMC 2011, Pp 63-67 (2011)
CoInDiVinE is a tool for parallel distributed model checking of interactions among components in hierarchical component-based systems. The tool extends the DiVinE framework with a new input language (component-interaction automata) and a property spe
Externí odkaz:
https://doaj.org/article/6da0194f92bd4e2e9663b09eaef3c809
Publikováno v:
Bioinformatics. 39
Motivation The problem of model inference is of fundamental importance to systems biology. Logical models (e.g. Boolean networks; BNs) represent a computationally attractive approach capable of handling large biological networks. The models are typic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::174bdf926b9fcc62d6da32f012347f0c
https://doi.org/10.1093/bioinformatics/btad158
https://doi.org/10.1093/bioinformatics/btad158
Publikováno v:
Bioinformatics. 38:4978-4980
Summary AEON.py is a Python library for the analysis of the long-term behaviour in very large asynchronous Boolean networks. It provides significant computational improvements over the state-of-the-art methods for attractor detection. Furthermore, it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8b3849747ba23b07d481bb0059089e3
https://doi.org/10.1093/bioinformatics/btac624
https://doi.org/10.1093/bioinformatics/btac624
Publikováno v:
BMC bioinformatics. 23(1)
Background Boolean networks (BNs) provide an effective modelling formalism for various complex biochemical phenomena. Their long term behaviour is represented by attractors–subsets of the state space towards which the BN eventually converges. These
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba8cdc0557925e6da602e83ff15ee330
https://pubmed.ncbi.nlm.nih.gov/35546394
https://pubmed.ncbi.nlm.nih.gov/35546394
Publikováno v:
Computational Methods in Systems Biology ISBN: 9783030856328
CMSB
CMSB
Aeon is a recent tool which enables efficient analysis of long-term behaviour of asynchronous Boolean networks with unknown parameters. In this tool paper, we present a novel major release of Aeon (Aeon 2021) which introduces substantial new features
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::524cbd9bea64c4741ba170e955035ddb
https://doi.org/10.1007/978-3-030-85633-5_14
https://doi.org/10.1007/978-3-030-85633-5_14
Publikováno v:
Computer Aided Verification ISBN: 9783030816841
CAV (1)
CAV (1)
Detection of bottom strongly connected components (BSCC) in state-transition graphs is an important problem with many applications, such as detecting recurrent states in Markov chains or attractors in dynamical systems. However, these graphs’ size
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2e9f67ed4f0baf5e9be5f5faef444b1
https://doi.org/10.1007/978-3-030-81685-8_24
https://doi.org/10.1007/978-3-030-81685-8_24
Publikováno v:
Computer Aided Verification ISBN: 9783030532871
CAV (1)
CAV (1)
Boolean networks (BNs) provide an effective modelling tool for various phenomena from science and engineering. Any long-term behaviour of a BN eventually converges to a so-called attractor. Depending on various logical parameters, the structure and q
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5eeafcbc859663651fcd1246858e17a
https://doi.org/10.1007/978-3-030-53288-8_28
https://doi.org/10.1007/978-3-030-53288-8_28
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 99:114-142
The parameter synthesis problem for timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis problem is decidable for Cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7e844479ccb2781ab150827d3643b7a9
https://doi.org/10.1016/j.jlamp.2018.05.004
https://doi.org/10.1016/j.jlamp.2018.05.004