Therapeutic target discovery using Boolean network attractors: avoiding pathological phenotypes
Target identification, one of the steps of drug discovery, aims at identifying biomolecules whose function should be therapeutically altered in order to cure the considered pathology. This work proposes an algorithm for in silico target identification using Boolean network attractors. It assumes that attractors of dynamical systems, such as Boolean networks, correspond to phenotypes produced by the modeled biological system. Under this assumption, and given a Boolean network modeling a pathophysiology, the algorithm identifies target combinations able to remove attractors associated with pathological phenotypes. It is tested on a Boolean model of the mammalian cell cycle bearing a constitutive inactivation of the retinoblastoma protein, as seen in cancers, and its applications are illustrated on a Boolean model of Fanconi anemia. The results show that the algorithm returns target combinations able to remove attractors associated with pathological phenotypes and then succeeds in performing the proposed in silico target identification. However, as with any in silico evidence, there is a bridge to cross between theory and practice, thus requiring it to be used in combination with wet lab experiments. Nevertheless, it is expected that the algorithm is of interest for target identification, notably by exploiting the inexpensiveness and predictive power of computational approaches to optimize the efficiency of costly wet lab experiments.
Code (0)
등록된 구현이 없습니다.
Tasks
Drug DiscoverySimilar Papers 제목 키워드 기반
Therapeutic target discovery using Boolean network attractors: improvements of kali
In a previous article, an algorithm for identifying therapeutic targets in Boolean networks modeling pathological mechanisms was introduced. In the present article, the improvements made on this algorithm, named kali, ar…
Drug DiscoveryAn ASP-based Approach for Attractor Enumeration in Synchronous and Asynchronous Boolean Networks
Boolean networks are conventionally used to represent and simulate gene regulatory networks. In the analysis of the dynamic of a Boolean network, the attractors are the objects of a special attention. In this work, we pr…
Molecular Network Control Through Boolean Canalization
Boolean networks are an important class of computational models for molecular interaction networks. Boolean canalization, a type of hierarchical clustering of the inputs of a Boolean function, has been extensively studie…
Universal computation using localized limit-cycle attractors in neural networks
Neural networks are dynamical systems that compute with their dynamics. One example is the Hopfield model, forming an associative memory which stores patterns as global attractors of the network dynamics. From studies of…
Structure-based approach can identify driver nodes in ensembles of biologically-inspired Boolean networks
Because the attractors of biological networks reflect stable behaviors (e.g., cell phenotypes), identifying control interventions that can drive a system towards its attractors (attractor control) is of particular releva…
Feedback Vertex Set (FVS)