Skip to main content
Figure 3 | BMC Bioinformatics

Figure 3

From: Detection of the dominant direction of information flow and feedback links in densely interconnected regulatory networks

Figure 3

An example of a network where the greedy algorithm fails to determine the optimal solution. The initial link scores are shown. The link (1, 2) carries the highest score 3 and thus is cut first. However, three 2-node cycles {2, 3}, {2, 4}, and {2, 5} remain to be eliminated, after which the number of removed links becomes 4. The optimal solution would be to cut only three links (2, 3), (2, 4), and (2, 5), each carrying the score 2. This optimal solution has almost always been found by the annealing algorithm.

Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us