ASP-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks

被引:7
|
作者
Ben Abdallah, Emna [1 ]
Folschette, Maxime [2 ,3 ]
Roux, Olivier [1 ]
Magnin, Morgan [1 ,4 ]
机构
[1] Ecole Cent Nantes, CNRS, LS2N, UMR 6004, 1 Rue Noe, F-44321 Nantes, France
[2] Univ Nantes, CNRS, LS2N, UMR 6004, 1 Rue Noe, F-44321 Nantes, France
[3] Univ Nice Sophia Antipolis, CNRS, UMR 7271, I3S, 2000 Route Lucioles, F-06900 Nice, France
[4] Natl Inst Informat, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, Japan
关键词
Biological regulatory network; Multiple-valued networks; Attractors; Steady states; Cycles; Answer set programming; REGULATORY NETWORKS; FINDING ATTRACTORS; TOPOLOGY; AUTOMATA;
D O I
10.1186/s13015-017-0111-2
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: This paper addresses the problem of finding attractors in biological regulatory networks. We focus here on non-deterministic synchronous and asynchronous multi-valued networks, modeled using automata networks (AN). AN is a general and well-suited formalism to study complex interactions between different components (genes, proteins, ...). An attractor is a minimal trap domain, that is, a part of the state-transition graph that cannot be escaped. Such structures are terminal components of the dynamics and take the form of steady states (singleton) or complex compositions of cycles (non-singleton). Studying the effect of a disease or a mutation on an organism requires finding the attractors in the model to understand the long-term behaviors. Results: We present a computational logical method based on answer set programming (ASP) to identify all attractors. Performed without any network reduction, the method can be applied on any dynamical semantics. In this paper, we present the two most widespread non-deterministic semantics: the asynchronous and the synchronous updating modes. The logical approach goes through a complete enumeration of the states of the network in order to find the attractors without the necessity to construct the whole state-transition graph. We realize extensive computational experiments which show good performance and fit the expected theoretical results in the literature. Conclusion: The originality of our approach lies on the exhaustive enumeration of all possible (sets of) states verifying the properties of an attractor thanks to the use of ASP. Our method is applied to non-deterministic semantics in two different schemes (asynchronous and synchronous). The merits of our methods are illustrated by applying them to biological examples of various sizes and comparing the results with some existing approaches. It turns out that our approach succeeds to exhaustively enumerate on a desktop computer, in a large model (100 components), all existing attractors up to a given size (20 states). This size is only limited by memory and computation time.
引用
收藏
页数:23
相关论文
共 10 条
  • [1] ASP-based method for the enumeration of attractors in non-deterministic synchronous and asynchronous multi-valued networks
    Emna Ben Abdallah
    Maxime Folschette
    Olivier Roux
    Morgan Magnin
    Algorithms for Molecular Biology, 12
  • [2] Simplification of non-deterministic multi-valued networks
    Mishchenko, A
    Brayton, R
    IEEE/ACM INTERNATIONAL CONFERENCE ON CAD-02, DIGEST OF TECHNICAL PAPERS, 2002, : 557 - 562
  • [3] An ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks
    Khaled, Tarek
    Benhamou, Belaid
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2019, (306): : 295 - 301
  • [4] Non-deterministic Multi-valued Logics - A Tutorial
    Avron, Arnon
    Zamansky, Anna
    40TH IEEE INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC ISMVL 2010, 2010, : 53 - 60
  • [5] Quantification in non-deterministic multi-valued structures
    Avron, A
    Zamansky, A
    35TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2005, : 296 - 301
  • [6] ASP-G: an ASP-based method for finding attractors in genetic regulatory networks
    Mushthofa, Mushthofa
    Torres, Gustavo
    Van de Peer, Yves
    Marchal, Kathleen
    De Cock, Martine
    BIOINFORMATICS, 2014, 30 (21) : 3086 - 3092
  • [7] Utility-Based Scheduling with Non-Deterministic Fading Channels in Wireless Multi-Hop Networks
    Liu, Zheng
    Ma, Maode
    Dai, Jufeng
    GLOBECOM 2009 - 2009 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-8, 2009, : 1780 - 1785
  • [8] Utility-based scheduling in wireless multi-hop networks over non-deterministic fading channels
    Liu, Zheng
    Ma, Maode
    Dai, Jufeng
    COMPUTER NETWORKS, 2012, 56 (09) : 2304 - 2315
  • [9] Synthesization of Multi-valued Associative High-Capacity Memory Based on Continuous Networks with a Class of Non-smooth Linear Nondecreasing Activation Functions
    Chunlin Sha
    Hongyong Zhao
    Yuan Yuan
    Yuzhen Bai
    Neural Processing Letters, 2019, 50 : 911 - 932
  • [10] Synthesization of Multi-valued Associative High-Capacity Memory Based on Continuous Networks with a Class of Non-smooth Linear Nondecreasing Activation Functions
    Sha, Chunlin
    Zhao, Hongyong
    Yuan, Yuan
    Bai, Yuzhen
    NEURAL PROCESSING LETTERS, 2019, 50 (01) : 911 - 932