Abstract
Learning gene regulatory networks under the threshold Boolean network model is presented. To accomplish this, the swarm intelligence technique called the bees algorithm is formulated to learn networks with predefined attractors. The resulting technique is compared with simulated annealing through simulations. The ability of the networks to preserve the attractors when the updating schemes is changed from parallel to sequential is analyzed as well. Results show that Boolean networks are not very robust when the updating scheme is changed. Robust networks were found only for limit cycle length equal to two and specific network topologies. Throughout the simulations, the bees algorithm outperformed simulated annealing, showing the effectiveness of this swarm intelligence technique for this particular application.
Original language | English |
---|---|
Pages (from-to) | 63-70 |
Number of pages | 8 |
Journal | Neural Computing and Applications |
Volume | 22 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2013 |
Externally published | Yes |
Keywords
- Attractors
- Boolean networks
- Simulated annealing
- Swarm intelligence
- The bees algorithm