Computational Techniques for Analysis of Genetic Network Dynamics

Loading...
Thumbnail Image
Penn collection
Departmental Papers (MEAM)
General Robotics, Automation, Sensing and Perception Laboratory
Degree type
Discipline
Subject
GRASP
genetic networks
hybrid systems
formal analysis
rapidly-exploring random trees
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Belta, Calin
Esposito, Joel M
Kim, Jongwoo
Contributor
Abstract

In this paper we propose modeling and analysis techniques for genetic networks that provide biologists with insight into the dynamics of such systems. Central to our modeling approach is the framework of hybrid systems and our analysis tools are derived from formal analysis of such systems. Given a set of states characterizing a property of biological interest P, we present the Multi-Affine Rectangular Partition (MARP) algorithm for the construction of a set of infeasible states I that will never reach P and the Rapidly Exploring Random Forest of Trees (RRFT) algorithm for the construction of a set of feasible states F that will reach P. These techniques are scalable to high dimensions and can incorporate uncertainty (partial knowledge of kinetic parameters and state uncertainty). We apply these methods to understand the genetic interactions involved in the phenomenon of luminescence production in the marine bacterium V. fischeri.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2005-02-01
Journal title
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Copyright Sage Publications. Postprint version. Published in International Journal of Robotics Research, Volume 24, Issue 2-3, February 2005, pages 219-235.
Reprinted from International Journal of Robotics Research, Volume 24, No. 2-3, February 2005, pages 219-235. Publisher URL: http://www.ijrr.org/contents/24_02/IJR24_02.html
Recommended citation
Collection