Skip to main content
Figure 6 | Algorithms for Molecular Biology

Figure 6

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

Figure 6

Maximal e -CCC-Biclusters with row and column quorum constraints in a discretized matrix. This figure shows the five maximal 1-CCC-Biclusters with at least 3 rows/columns (q r = q c = 3) that can be identified in the discretized matrix in Figure 1. These 1-CCC-Biclusters are defined, respectively, by the following patterns: SB 1= [D U D U], SB 2= [D D U], SB 3= [D U N], SB 4= [N D U] and SB 5= [U D U D]. Also clear from this figure is the fact that the same e-CCC-Bicluster can be defined by several patterns. For example, 1-CCC-Bicluster B1 can also be identified by the patterns [N U D U] and [U U D U]. An interesting example is the case of 1-CCC-Bicluster B2, which can also be defined by the patterns [N D U], [U N U], [U U U], [U D D] and [U D N]. Note however, that B2 cannot be identified by the pattern [U D U]. If this was the case, B2 would not be right maximal, since the pattern [U D N] can be extended to the right by allowing one error at column 5. In fact, this leads to the discovery of the maximal 1-CCC-Bicluster B5. Moreover, e-CCC-Biclusters can be defined by expression patterns not occurring in the discretized matrix. This is the case of 1-CCC-Biclusters B2 and B4, defined respectively by the patterns SB 2= [D D U] and SB 4= [N D U], which do not occur in the matrix in the contiguous columns defining B2 and B4 (C2–C3 and C2–C4, respectively).

Back to article page
\