Skip to main content
Figure 4 | Algorithms for Molecular Biology

Figure 4

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

Figure 4

Maximal CCC-Biclusters and generalized suffix trees. This figure shows: (Top) Generalized suffix tree constructed for the transformed matrix in Figure 3. For clarity, this figure does not contain the leaves that represent string terminators that are direct daughters of the root. Each internal node, other than the root, is labeled with the number of leaves in its subtree. We show the suffix links between nodes although (for clarity) we omit the suffix links pointing to the root. All maximal CCC-Biclusters are identified using a circle. The labels B1 to B6 identify the nodes corresponding to all maximal CCC-Biclusters with at least two rows/genes. Note that the rows in each CCC-Bicluster identified by a given node v are obtained from the string terminators in its subtree. The value of the string-depth of v and the first symbol in the string-label of v provide the information needed to identify the set of contiguous columns. (Bottom) Maximal CCC-Biclusters B1 to B6 showed in the discretized matrix as subsets of rows and columns. The strings SB 1= [U], SB 2= [U], SB 3= [U N], SB 4= [U D U], SB 5= [U] and SB 6= [N] correspond to the expression patterns of the maximal CCC-Biclusters identified as B1 to B6, respectively.

Back to article page
\