Skip to main content
. 2008 Jul 4;2:57. doi: 10.1186/1752-0509-2-57

Table 4.

Contingency table for comparing learned networks to KEGG pathways.

Learned Network

Ideal (KEGG pathway) Edge in network Yes No

Yes TP = |EL| ⋂ |EI| FN = |EI| - TP
No FP = |EL| - TP TN = [(|VI|•|VI - 1|)/2] - FN

Here EL and EI represent the edges in the learned and ideal graphs, respectively, where the ideal graphs are those derived from the KEGG pathways; VI is the set of nodes (vertices) in the ideal graph.