QUBIC: a qualitative biclustering algorithm for analyses of gene expression data

Biclustering extends the traditional clustering techniques by attempting to find (all) subgroups of genes with similar expression patterns under to-be-identified subsets of experimental conditions when applied to gene expression data. Still the real power of this clustering strategy is yet to be ful...

Full description

Saved in:
Bibliographic Details
Published inNucleic acids research Vol. 37; no. 15; p. e101
Main Authors Li, Guojun, Ma, Qin, Tang, Haibao, Paterson, Andrew H, Xu, Ying
Format Journal Article
LanguageEnglish
Published England Oxford University Press 01.08.2009
Oxford Publishing Limited (England)
Subjects
Online AccessGet full text
ISSN0305-1048
1362-4962
1362-4954
1362-4962
DOI10.1093/nar/gkp491

Cover

More Information
Summary:Biclustering extends the traditional clustering techniques by attempting to find (all) subgroups of genes with similar expression patterns under to-be-identified subsets of experimental conditions when applied to gene expression data. Still the real power of this clustering strategy is yet to be fully realized due to the lack of effective and efficient algorithms for reliably solving the general biclustering problem. We report a QUalitative BIClustering algorithm (QUBIC) that can solve the biclustering problem in a more general form, compared to existing algorithms, through employing a combination of qualitative (or semi-quantitative) measures of gene expression data and a combinatorial optimization technique. One key unique feature of the QUBIC algorithm is that it can identify all statistically significant biclusters including biclusters with the so-called 'scaling patterns', a problem considered to be rather challenging; another key unique feature is that the algorithm solves such general biclustering problems very efficiently, capable of solving biclustering problems with tens of thousands of genes under up to thousands of conditions in a few minutes of the CPU time on a desktop computer. We have demonstrated a considerably improved biclustering performance by our algorithm compared to the existing algorithms on various benchmark sets and data sets of our own. QUBIC was written in ANSI C and tested using GCC (version 4.1.2) on Linux. Its source code is available at: http://csbl.bmb.uga.edu/~maqin/bicluster. A server version of QUBIC is also available upon request.
Bibliography:ArticleID:gkp491
ark:/67375/HXZ-V4L2906B-R
istex:FBDDCF7254638126E1BA09AB2D569FAF08990143
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ObjectType-Undefined-1
ObjectType-Feature-3
ISSN:0305-1048
1362-4962
1362-4954
1362-4962
DOI:10.1093/nar/gkp491