By Topic

Qualitative Analysis of Gene Regulatory Networks by Satisfiability Checking of Linear Temporal Logic

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ito, S. ; Dept. of Comput. Sci., Tokyo Inst. of Technol., Tokyo, Japan ; Izumi, N. ; Hagihara, S. ; Yonezaki, N.

We developed a method for analyzing the dynamics of gene regulatory networks in purely qualitative fashion. In our method, constraints for possible behaviors of a network and a biological property of interest are described as Linear Temporal Logic formulas, being automatically analyzed by satisfiability checking. In this way, we can investigate whether there exists some behavior which satisfies a specified property or whether all the behaviors satisfy a specified property, which are difficult in quantitative analysis.

Published in:

BioInformatics and BioEngineering (BIBE), 2010 IEEE International Conference on

Date of Conference:

May 31 2010-June 3 2010