Skip to main content
Figure 1 | BMC Systems Biology

Figure 1

From: On cycles in the transcription network of Saccharomyces cerevisiae

Figure 1

Classifying TFs and TTs of Luscombe network by their positions on the longest paths, note that class INT is empty. The paths are computed in the graph of scc's, in particular, we view LSCC as a single node. The entry in column i and row j shows the number of nodes with these properties: on the longest path through node u has i + j edges and the longest path from u to another node (a TT) has i edges (consequently, the longest path from another node to u has j edges). Note that the only way a node may be on a path of length 3 is when it has an edge from the node that corresponds to LSCC.

Back to article page