Skip to main content
Figure 7 | Algorithms for Molecular Biology

Figure 7

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

Figure 7

e -CCC-Biclusters ( e > 0) and generalized suffix trees. This figure shows: (Top) Generalized suffix tree constructed for the transformed matrix in Figure 3 (the information stored in the nodes correspond to the number of leaves and row identifiers in their subtree and is used by e-CCC-Biclustering). The circles labeled with B1, B2, B3, B4 and B5 identify the nodes related with the five maximal 1-CCC-Biclusters discovered when e = 1 and q e = q c = 3, shown in Figure 6; (Bottom) Maximal 1-CCC-Biclusters B1 to B5 showed in the matrix as subsets of rows and columns. The strings 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] correspond to the expression patterns defining the maximal 1-CCC-Biclusters identified as B1 to B5, respectively. Note that e-CCC-Biclusters can now be identified (and generally are) by more than one node in the generalized suffix tree. This is the case of 1-CCC-Biclusters B1, B3, B4 and B5. In fact only B2 is identified by a single node in this example. Moreover, a node in the generalized suffix tree might be related with more than one maximal e-CCC-Bicluster. Look for example at the node identifying approximate patterns occurring in both 1-CCC-Biclusters B2 and B4.

Back to article page
\