TY - GEN
T1 - Finding incoming global states in Boolean networks
AU - Akutsu, Tatsuya
AU - Hayashida, Morihiro
AU - Zhang, Shu Qin
AU - Ching, Wai Ki
AU - Ng, Michael K.
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=47049095838&partnerID=8YFLogxK
U2 - 10.1109/GENSIPS.2007.4365823
DO - 10.1109/GENSIPS.2007.4365823
M3 - Conference proceeding
AN - SCOPUS:47049095838
SN - 1424409993
SN - 9781424409990
T3 - GENSIPS'07 - 5th IEEE International Workshop on Genomic Signal Processing and Statistics
BT - 5th IEEE International Workshop on Genomic Signal Processing and Statistics, GENSIPS'07
T2 - 5th IEEE International Workshop on Genomic Signal Processing and Statistics, GENSIPS'07
Y2 - 10 June 2007 through 12 June 2007
ER -