Representation of gene regulation networks by hypothesis logic-based Boolean systems.
Saved in:
| Title: | Representation of gene regulation networks by hypothesis logic-based Boolean systems. |
|---|---|
| Authors: | Siegel, Pierre1 (AUTHOR), Doncescu, Andrei2 (AUTHOR) andrei.doncescu@laas.fr, Risch, Vincent1 (AUTHOR), Sené, Sylvain1 (AUTHOR) |
| Source: | Journal of Supercomputing. Mar2023, Vol. 79 Issue 4, p4556-4581. 26p. |
| Subjects: | Genetic regulation, Propositional calculus, Modal logic, Limit cycles, Dynamical systems |
| Abstract: | Boolean Dynamical Systems (BDSs) are networks described by Boolean variables. A new representation of BDSs is presented in this article by using modal non-monotonic logic (H ). This approach allows Boolean Networks to be represented by a set of modal formulas and therefore can be used to describe and learn their properties. The study of a BDS focuses in particular on the search of stable configurations, limit cycles and unstable cycles, which help to characterize a large type of Gene Networks. In this article is presented the identification of such asymptotic properties by introduction of a new concept, ghost extensions. Using ghost extensions, it is possible to translate BDSs in propositional calculus and consequently to use SAT algorithms. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | Boolean Dynamical Systems (BDSs) are networks described by Boolean variables. A new representation of BDSs is presented in this article by using modal non-monotonic logic (H ). This approach allows Boolean Networks to be represented by a set of modal formulas and therefore can be used to describe and learn their properties. The study of a BDS focuses in particular on the search of stable configurations, limit cycles and unstable cycles, which help to characterize a large type of Gene Networks. In this article is presented the identification of such asymptotic properties by introduction of a new concept, ghost extensions. Using ghost extensions, it is possible to translate BDSs in propositional calculus and consequently to use SAT algorithms. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09208542 |
| DOI: | 10.1007/s11227-022-04809-5 |
