抄録

On Observability of Steady States in a Boolean Network

○阿久津達也・田村武幸（京大）

We consider the problem of finding a minimum set of genes by which all given singleton attractors in a Boolean network can be discriminated. We present a simple *O(m*^{m} poly(m,n)) time dynamic programming algorithm to solve the problem, where *n* is the number of genes and *m* is the number of singleton attractors. We also discuss a relation between the minimum set of genes and the minimum feedback vertex set.