Skip to main content
Figure 10 | Algorithms for Molecular Biology

Figure 10

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

Figure 10

e -CCC-Biclusters extended to consider missing values as valid errors. This figure shows: (Top) Generalized suffix tree used by e-CCC-Biclustering extended to consider missing values as valid errors when applied to the transformed matrix in Figure 9. The circles labeled with B1 and B2 identify the node-occurrences of the two maximal 1-CCC-Biclusters discovered when e = 1 and q e = q c = 3; (Bottom) Maximal 1-CCC-Biclusters corresponding, respectively, to the valid models m = [D3 U4 N5] (three node-occurrences labeled with B1) and m = [U2 D3 U4] (three node-occurrences labeled with B2).

Back to article page
\