DocumentCode
1900190
Title
Finding Incoming Global States in Boolean Networks
Author
Akutsu, Tatsuya ; Hayashida, Morihiro ; Zhang, Shu-Qin ; Ching, Wai-Ki ; Ng, Michael K.
Author_Institution
Kyoto Univ., Kyoto
fYear
2007
fDate
10-12 June 2007
Firstpage
1
Lastpage
4
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.
Keywords
Boolean functions; computational complexity; optimisation; search problems; Boolean networks; NP-hard problem; attraction basin; exhaustive search-based algorithm; incoming global states; Bioinformatics; Boolean functions; Chemicals; Genetics; Genomics; Intelligent networks; Mathematical model; Mathematics; Signal analysis; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Genomic Signal Processing and Statistics, 2007. GENSIPS 2007. IEEE International Workshop on
Conference_Location
Tuusula
Print_ISBN
978-1-4244-0998-3
Electronic_ISBN
978-1-4244-0999-0
Type
conf
DOI
10.1109/GENSIPS.2007.4365823
Filename
4365823
Link To Document