The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Complexity of the BN and the PBN Models of GRNs and Mappings for Complexity Reduction
Abstract
Constructing computational models of genomic regulation faces several major challenges. While the advances in technology can help in obtaining more and better quality gene expression data, the complexity of the models that can be inferred from data is often high. This high complexity impedes the practical applications of such models, especially when one is interested in developing intervention strategies for disease control, for example, preventing tumor cells from entering a proliferative state. Thus, estimating the complexity of a model and designing strategies for complexity reduction become crucial in problems such as model selection, construction of tractable sub-network models, and control of the dynamical behavior of the model. In this chapter we discuss these issues in the setting of Boolean networks and probabilistic Boolean networks – two important classes of network models for genomic regulatory networks.
Related Content
|
S. Karthigai Selvi, Sharmistha Dey, Siva Shankar Ramasamy, Krishan Veer Singh.
© 2025.
16 pages.
|
|
S. Sheeba Rani, M. Mohammed Yassen, Srivignesh Sadhasivam, Sharath Kumar Jaganathan.
© 2025.
22 pages.
|
|
U. Vignesh, K. Gokul Ram, Abdulkareem Sh. Mahdi Al-Obaidi.
© 2025.
22 pages.
|
|
Monica Bhutani, Monica Gupta, Ayushi Jain, Nishant Rajoriya, Gitika Singh.
© 2025.
24 pages.
|
|
U. Vignesh, Arpan Singh Parihar.
© 2025.
34 pages.
|
|
Sharmistha Dey, Krishan Veer Singh.
© 2025.
20 pages.
|
|
Kalpana Devi.
© 2025.
26 pages.
|
|
|