Computer Science – Neural and Evolutionary Computing
Scientific paper
2010-11-21
Computer Science
Neural and Evolutionary Computing
9 pages, 6 figures. Presented at WIRN 2010 - Italian workshop on neural networks, May 2010. To appear in a volume published by
Scientific paper
We study the properties of the distance between attractors in Random Boolean Networks, a prominent model of genetic regulatory networks. We define three distance measures, upon which attractor distance matrices are constructed and their main statistic parameters are computed. The experimental analysis shows that ordered networks have a very clustered set of attractors, while chaotic networks' attractors are scattered; critical networks show, instead, a pattern with characteristics of both ordered and chaotic networks.
Benedettini Stefano
Roli Andrea
Serra Roberto
Villani Marco
No associations
LandOfFree
Analysis of attractor distances in Random Boolean Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Analysis of attractor distances in Random Boolean Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of attractor distances in Random Boolean Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-221522