Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is DIRE Algorithm

Handbook of Research on Computational Methodologies in Gene Regulatory Networks
An algorithm that construct a mapping that solves the reduction problem using the state transition diagram of a given PBN as a constraint.
Published in Chapter:
Complexity of the BN and the PBN Models of GRNs and Mappings for Complexity Reduction
Ivan V. Ivanov (Texas A&M University, USA)
DOI: 10.4018/978-1-60566-685-3.ch014
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.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR