Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Finding the fixed points of a Boolean network from a positive feedback
  vertex set   In the modeling of biological systems by Boolean networks a key problem is
finding the set of fixed points of a given network. Some constructed algorithms
consider certain structural properties of the interaction graph like those
proposed by Akutsu et al. in \cite{akutsu1998system,zhang2007algorithms} which
consider a feedback vertex set of the graph. However, these methods do not take
into account the type of action (activation, inhibition) between its
components.
  In this paper we propose a new algorithm for finding the set of fixed points
of a Boolean network, based on a positive feedback vertex set $P$ of its
interaction graph and which works, by applying a sequential update schedule, in
time $O(2^{|P|} \cdot n^2)$, where $n$ is the number of components. The
theoretical foundation of this algorithm is due a nice characterization, that
we give, of the dynamical behavior of the Boolean networks without positive
cycles and with a fixed point.
  An executable file of \Afp made in Java and some examples of input files are
available at:
\href{http://www.inf.udec.cl/~lilian/FPCollector/}{\url{www.inf.udec.cl/~lilian/FPCollector/}}

7
The categories of this paper are: hep-th
16
The categories of this paper are: stat
34
The categories of this paper are: chem-ph
25
The categories of this paper are: patt-sol
24
The categories of this paper are: dg-ga
4
The categories of this paper are: cond-mat
8
The categories of this paper are: hep-ex
10
The categories of this paper are: q-bio
14
The categories of this paper are: math-ph
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
18
The categories of this paper are: econ
19
The categories of this paper are: eess
0
The categories of this paper are: hep-ph