Sequential operator for filtering cycles in Boolean networks

Citations of this article
Mendeley users who have this article in their library.


Given a Boolean network without negative circuits, we propose a polynomial algorithm to build another network such that, when updated in parallel, it has the same fixed points than the original one, but it does not have any dynamical cycle. To achieve that, we apply a network transformation related to the sequential update. As a corollary, we can find a fixed point in polynomial time for this kind of networks. © 2010 Elsevier Inc. All rights reserved.




Goles, E., & Salinas, L. (2010). Sequential operator for filtering cycles in Boolean networks. Advances in Applied Mathematics, 45(3), 346–358.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free