Matching rectangles in d-dimensions: Algorithms and laws of large numbers, Advances in Mathematics, vol.55, issue.1, 1985. ,
DOI : 10.1016/0001-8708(85)90002-7
On Bipartite and Multipartite Clique Problems, Journal of Algorithms, vol.41, issue.2, pp.388-403, 2001. ,
DOI : 10.1006/jagm.2001.1199
Computers and Intractibility: A Guide to NP-Completeness, 1979. ,
Finding biclusters in gene expression data by random projections, 15th Annual Combinatorial Pattern Matching Symp, 2004. ,
The maximum edge biclique problem is NP-complete, Discrete Applied Mathematics, vol.131, issue.3, 2000. ,
DOI : 10.1016/S0166-218X(03)00333-0
Biclustering microarray data by Gibbs sampling, Bioinformatics, vol.19, issue.Suppl 2, 2003. ,
DOI : 10.1093/bioinformatics/btg1078
Average Case Analysis of Algorithms on Sequences, 2001. ,
DOI : 10.1002/9781118032770
Discovering statistically significant biclusters in gene expression data, Bioinformatics, vol.18, issue.Suppl 1, pp.136-144, 2002. ,
DOI : 10.1093/bioinformatics/18.suppl_1.S136
Clustering by pattern similarity in large data sets, Proceedings of the 2002 ACM SIGMOD international conference on Management of data , SIGMOD '02, pp.394-405, 2002. ,
DOI : 10.1145/564691.564737
Gene espression module discovery using Gibbs sampling, Genome Informatics, vol.16, issue.1, pp.239-248, 2004. ,