A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs

Erten, Cesim and Sözdinler, Melih (2009) A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs. In: Graph Drawing 16th International Symposium, GD 2008, September 21- 24, 2008, Heraklion, Crete, Greece , pp. 439-440 (Official URL: http://dx.doi.org/10.1007/978-3-642-00219-9_45).

Full text not available from this repository.

Item Type:Conference Paper
Additional Information:10.1007/978-3-642-00219-9_45
Classifications:G Algorithms and Complexity > G.420 Crossings
J Applications > J.999 Others
ID Code:933

Repository Staff Only: item control page


Abdullah, A., Hussain, A.: A new biclustering technique based on crossing minimization. In: Neurocomputing, vol. 69 (16-18), 1882–1896 (2006)

Cakiroglu, O., Erten, C., Karatas, Ö., Sözdinler, M.: Crossing minimization in weighted bi-partite graphs. In: LNCS, vol. 4525, Proc. of Workshop on Experimental Algorithms WEA. pp. 122–135. Springer, Heidelberg(2007)

Hartigan, J.A.: Direct clustering of a data matrix. Journal of the American Statistical Association, vol. 67 (337), 123–129 (1972)

Lonardi, S., Szpankowski, W., Yang, Q.: Finding biclusters by random projections. Theor. Comput. Sci., vol. 368 (3), 217–230 (2006)

Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis:A survey. In: IEEE/ACM Trans. on Comp. Biol. and Bioinf.(TCBB), vol. 1 (1), 24–45 (2004)

Mishra, N., Ron, D., Swaminathan, R.: On finding large conjunctive clusters. In: COLT. pp. 448–462 (2003)

Tanay, A., Sharan, R., Shamir, R.: Discovering statistically significant biclusters in gene expression data. Bioinformatics, vol. 18 Supagesl 1 pp. 136–144 (2002)