Fig. 2

The underlying concepts of the encoding and the searching strategy of the RUBic algorithm are illustrated with the help of an example; A the composition of the set \(V=\{V_{i}\}, \forall i \in D\), and B the steps involved in formation of a bicluster is illustrated with 6 rows, where \(r_1\) and \(r_2\) are the seed rows that form the template \(\rho _12\); and the rationale behind exclusion of three rows and eventual inclusion of a row \((r_3)\) in the new bicluster, is explained