On the length of attractors in boolean networks with an interaction graph by layers

Details On the length of attractors in boolean networks with an interaction graph by layers On the length of attractors in boolean networks with an interaction graph by layers

2008-10-30

arxiv.org/abs/0810.5482v1

Computer Science

Discrete Mathematics

7 pages

Scientific paper

We consider a boolean network whose interaction graph has no circuit of
length >1. Under this hypothesis, we establish an upper bound on the length of
the attractors of the network which only depends on its interaction graph.

Affiliated with

Also associated with

No associations

Rating

On the length of attractors in boolean networks with an interaction graph by layers 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 On the length of attractors in boolean networks with an interaction graph by layers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the length of attractors in boolean networks with an interaction graph by layers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278892