Cargando…
Algorithms and Complexity Analyses for Control of Singleton Attractors in Boolean Networks
A Boolean network (BN) is a mathematical model of genetic networks. We propose several algorithms for control of singleton attractors in BN. We theoretically estimate the average-case time complexities of the proposed algorithms, and confirm them by computer experiments. The results suggest the impo...
Autores principales: | Hayashida, Morihiro, Tamura, Takeyuki, Akutsu, Tatsuya, Zhang, Shu-Qin, Ching, Wai-Ki |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer
2008
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3171397/ https://www.ncbi.nlm.nih.gov/pubmed/18795107 http://dx.doi.org/10.1155/2008/521407 |
Ejemplares similares
-
Algorithms for Finding Small Attractors in Boolean Networks
por: Zhang, Shu-Qin, et al.
Publicado: (2007) -
On control of singleton attractors in multiple Boolean networks: integer programming-based method
por: Qiu, Yushan, et al.
Publicado: (2014) -
Attractor detection and enumeration algorithms for Boolean networks
por: Mori, Tomoya, et al.
Publicado: (2022) -
An Algorithm for Finding the Singleton Attractors and Pre-Images in Strong-Inhibition Boolean Networks
por: He, Zhiwei, et al.
Publicado: (2016) -
Identification of periodic attractors in Boolean networks using a priori information
por: Münzner, Ulrike, et al.
Publicado: (2022)