Skip to main content
Figure 11 | Algorithms for Molecular Biology

Figure 11

From: A polynomial time biclustering algorithm for finding approximate expression patterns in gene expression time series

Figure 11

e -CCC-Biclusters extended to "jump over" missing values. This figure shows: (Top) Generalized suffix tree used by e-CCC-Biclustering extended to "jump over" missing values when applied to the transformed matrix in Figure 9. The circles labeled with B1, B2, B3 and B4 identify the node-occurrences of the four maximal 1-CCC-Biclusters discovered when e = 1, q e = 3 and q c = 2; (Bottom) Maximal 1-CCC-Biclusters corresponding, respectively, to the valid models m = [D2 D3] (three node-occurrences labeled with B1), m = [D4 N5] (three node-occurrences labeled with B2), m = [U4 D5] (three node-occurrences labeled with B3) and m = [U4 U5] (three node-occurrences labeled with B4).

Back to article page
\