“…The biclustering algorithm was first proposed in Hartigan (1972), is a two-dimensional data mining technique that allows simultaneous clustering of rows (representing genes) and columns (representing samples/conditions) in a gene expression matrix. Developments continued in the following decades, with (Cheng and Church, 2000;Lazzeroni and Owen, 2000;Bergmann et al, 2003;Kluger et al, 2003;Chiu et al, 2004;Prelić et al, 2006;Dhollander et al, 2007;Gu and Liu, 2008;Li et al, 2009;Hochreiter et al, 2010;Madeira et al, 2010;Medina et al, 2010;Chen et al, 2011;De Smet and Marchal, 2011;Zhao et al, 2011;Zhou et al, 2012;Goncalves and Madeira, 2014;Henriques and Madeira, 2016a,b;Alzahrani et al, 2017;Guo et al, 2021) being articles on different clustering algorithms. Among them, BCPlaid (Lazzeroni and Owen, 2000), QUBIC (Li et al, 2009), C&C (Cheng and Church, 2000), FABIA (Hochreiter et al, 2010) are the more popular biclustering algorithms.…”