Skip to main content
. 2011 Oct 18;12(Suppl 10):S9. doi: 10.1186/1471-2105-12-S10-S9

Figure 1.

Figure 1

Illustrative overview of the algorithm. Sequential fault detection algorithm for a family Inline graphic that consists of three 3-gene Boolean networks (depicted as a square, triangle, or circle). Suppose N1 is the (unknown) normal network that was altered into the cancerous network through M = 2 mutations. In the first row, all possible single mutations are applied to all networks, where the resulting altered networks are shown in the middle. The algorithm keeps only those networks whose residual value (the distance to the cancerous network) is less than β1, resulting in a reduced family Inline graphic. In the next step, we consider all possible single gene mutations to the networks in Inline graphic, as shown in the middle of second row. The algorithm keeps only those networks whose residual value is less than β2(<β1), which leads to a further reduced set Inline graphic