Finding incoming global states in Boolean networks

Tatsuya Akutsu*, Morihiro Hayashida, Shu Qin Zhang, Wai Ki Ching, Kwok Po NG

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

1 Citation (Scopus)

Abstract

This paper considers the problem of finding global states incoming to a specified global state in a Boolean network, which may be useful for pre-processing of finding a sequence of control actions for a Boolean network and for identifying the basin of attraction for a given attractor, We show that this problem is NP-hard in general along with related theoretical results, On the other hand, we present algorithms that are much faster than the naive exhaustive search-based algorithm.

Original languageEnglish
Title of host publication5th IEEE International Workshop on Genomic Signal Processing and Statistics, GENSIPS'07
DOIs
Publication statusPublished - 2007
Event5th IEEE International Workshop on Genomic Signal Processing and Statistics, GENSIPS'07 - Tuusula, Finland
Duration: 10 Jun 200712 Jun 2007

Publication series

NameGENSIPS'07 - 5th IEEE International Workshop on Genomic Signal Processing and Statistics

Conference

Conference5th IEEE International Workshop on Genomic Signal Processing and Statistics, GENSIPS'07
Country/TerritoryFinland
CityTuusula
Period10/06/0712/06/07

Scopus Subject Areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science Applications
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Finding incoming global states in Boolean networks'. Together they form a unique fingerprint.

Cite this