We are now ready to describe our algorithm for the bicluster layout problem. To minimize the size of L, we can minimize the length of ℛ and the length of C independently. Therefore, we construct the layout L by determining ℛ and C independently. In the rest of this section, we describe the algorithm to construct C, the ordered list of the columns in the layout L. We can compute ℛ, the ordered list of rows in the layout, analogously.