Show simple item record

dc.contributor.authorGrothaus, Gregory Aen_US
dc.contributor.authorMufti, Adeelen_US
dc.contributor.authorMurali, T. M.en_US
dc.identifier.citationAlgorithms for Molecular Biology. 2006 Sep 04;1(1):15en_US
dc.description.abstractBackground Biclustering has emerged as a powerful algorithmic tool for analyzing measurements of gene expression. A number of different methods have emerged for computing biclusters in gene expression data. Many of these algorithms may output a very large number of biclusters with varying degrees of overlap. There are no systematic methods that create a two-dimensional layout of the computed biclusters and display overlaps between them. Results We develop a novel algorithm for laying out biclusters in a two-dimensional matrix whose rows (respectively, columns) are rows (respectively, columns) of the original dataset. We display each bicluster as a contiguous submatrix in the layout. We allow the layout to have repeated rows and/or columns from the original matrix as required, but we seek a layout of the smallest size. We also develop a web-based search interface for the user to query the genes and samples of interest and visualise the layout of biclusters matching the queries. Conclusion We demonstrate the usefulness of our approach on gene expression data for two types of leukaemia and on protein-DNA binding data for two growth conditions in Saccharomyces cerevisiae. The software implementing the layout algorithm is available at
dc.rightsCreative Commons Attribution 4.0 International*
dc.titleAutomatic layout and visualization of biclustersen_US
dc.typeArticle - Refereed
dc.description.versionPeer Reviewed
dc.rights.holderGregory A Grothaus et al.; licensee BioMed Central Ltd.en_US
dc.title.serialAlgorithms for Molecular Biology

Files in this item


This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution 4.0 International
License: Creative Commons Attribution 4.0 International