Cargando…

On finite-horizon control of genetic regulatory networks with multiple hard-constraints

BACKGROUND: Probabilistic Boolean Networks (PBNs) provide a convenient tool for studying genetic regulatory networks. There are three major approaches to develop intervention strategies: (1) resetting the state of the PBN to a desirable initial state and letting the network evolve from there, (2) ch...

Descripción completa

Detalles Bibliográficos
Autores principales: Yang, Cong, Wai-Ki, Ching, Nam-Kiu, Tsing, Ho-Yin, Leung
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2010
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2982688/
https://www.ncbi.nlm.nih.gov/pubmed/20840728
http://dx.doi.org/10.1186/1752-0509-4-S2-S14
_version_ 1782191757240303616
author Yang, Cong
Wai-Ki, Ching
Nam-Kiu, Tsing
Ho-Yin, Leung
author_facet Yang, Cong
Wai-Ki, Ching
Nam-Kiu, Tsing
Ho-Yin, Leung
author_sort Yang, Cong
collection PubMed
description BACKGROUND: Probabilistic Boolean Networks (PBNs) provide a convenient tool for studying genetic regulatory networks. There are three major approaches to develop intervention strategies: (1) resetting the state of the PBN to a desirable initial state and letting the network evolve from there, (2) changing the steady-state behavior of the genetic network by minimally altering the rule-based structure and (3) manipulating external control variables which alter the transition probabilities of the network and therefore desirably affects the dynamic evolution. Many literatures study various types of external control problems, with a common drawback of ignoring the number of times that external control(s) can be applied. RESULTS: This paper studies the intervention problem by manipulating multiple external controls in a finite time interval in a PBN. The maximum numbers of times that each control method can be applied are given. We treat the problem as an optimization problem with multi-constraints. Here we introduce an algorithm, the "Reserving Place Algorithm'', to find all optimal intervention strategies. Given a fixed number of times that a certain control method is applied, the algorithm can provide all the sub-optimal control policies. Theoretical analysis for the upper bound of the computational cost is also given. We also develop a heuristic algorithm based on Genetic Algorithm, to find the possible optimal intervention strategy for networks of large size. CONCLUSIONS: Studying the finite-horizon control problem with multiple hard-constraints is meaningful. The problem proposed is NP-hard. The Reserving Place Algorithm can provide more than one optimal intervention strategies if there are. Moreover, the algorithm can find all the sub-optimal control strategies corresponding to the number of times that certain control method is conducted. To speed up the computational time, a heuristic algorithm based on Genetic Algorithm is proposed for genetic networks of large size.
format Text
id pubmed-2982688
institution National Center for Biotechnology Information
language English
publishDate 2010
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-29826882010-11-17 On finite-horizon control of genetic regulatory networks with multiple hard-constraints Yang, Cong Wai-Ki, Ching Nam-Kiu, Tsing Ho-Yin, Leung BMC Syst Biol Proceedings BACKGROUND: Probabilistic Boolean Networks (PBNs) provide a convenient tool for studying genetic regulatory networks. There are three major approaches to develop intervention strategies: (1) resetting the state of the PBN to a desirable initial state and letting the network evolve from there, (2) changing the steady-state behavior of the genetic network by minimally altering the rule-based structure and (3) manipulating external control variables which alter the transition probabilities of the network and therefore desirably affects the dynamic evolution. Many literatures study various types of external control problems, with a common drawback of ignoring the number of times that external control(s) can be applied. RESULTS: This paper studies the intervention problem by manipulating multiple external controls in a finite time interval in a PBN. The maximum numbers of times that each control method can be applied are given. We treat the problem as an optimization problem with multi-constraints. Here we introduce an algorithm, the "Reserving Place Algorithm'', to find all optimal intervention strategies. Given a fixed number of times that a certain control method is applied, the algorithm can provide all the sub-optimal control policies. Theoretical analysis for the upper bound of the computational cost is also given. We also develop a heuristic algorithm based on Genetic Algorithm, to find the possible optimal intervention strategy for networks of large size. CONCLUSIONS: Studying the finite-horizon control problem with multiple hard-constraints is meaningful. The problem proposed is NP-hard. The Reserving Place Algorithm can provide more than one optimal intervention strategies if there are. Moreover, the algorithm can find all the sub-optimal control strategies corresponding to the number of times that certain control method is conducted. To speed up the computational time, a heuristic algorithm based on Genetic Algorithm is proposed for genetic networks of large size. BioMed Central 2010-09-13 /pmc/articles/PMC2982688/ /pubmed/20840728 http://dx.doi.org/10.1186/1752-0509-4-S2-S14 Text en Copyright ©2010 Wai-Ki et al; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Proceedings
Yang, Cong
Wai-Ki, Ching
Nam-Kiu, Tsing
Ho-Yin, Leung
On finite-horizon control of genetic regulatory networks with multiple hard-constraints
title On finite-horizon control of genetic regulatory networks with multiple hard-constraints
title_full On finite-horizon control of genetic regulatory networks with multiple hard-constraints
title_fullStr On finite-horizon control of genetic regulatory networks with multiple hard-constraints
title_full_unstemmed On finite-horizon control of genetic regulatory networks with multiple hard-constraints
title_short On finite-horizon control of genetic regulatory networks with multiple hard-constraints
title_sort on finite-horizon control of genetic regulatory networks with multiple hard-constraints
topic Proceedings
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2982688/
https://www.ncbi.nlm.nih.gov/pubmed/20840728
http://dx.doi.org/10.1186/1752-0509-4-S2-S14
work_keys_str_mv AT yangcong onfinitehorizoncontrolofgeneticregulatorynetworkswithmultiplehardconstraints
AT waikiching onfinitehorizoncontrolofgeneticregulatorynetworkswithmultiplehardconstraints
AT namkiutsing onfinitehorizoncontrolofgeneticregulatorynetworkswithmultiplehardconstraints
AT hoyinleung onfinitehorizoncontrolofgeneticregulatorynetworkswithmultiplehardconstraints