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...

Descripción completa

Detalles Bibliográficos
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:
Research Article
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

Internet

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