title: Recent patents on biclustering algorithms for gene expression data analysis.
abstract: In DNA microarray experiments, discovering groups of genes that share similar transcriptional characteristics is instrumental in functional annotation, tissue classification and motif identification. However, in many situations a subset of genes only exhibits a consistent pattern over a subset of conditions. Although used extensively in gene expression data analysis, conventional clustering algorithms that consider the entire row or column in an expression matrix can therefore fail to detect useful patterns in the data. Recently, biclustering has been proposed as a powerful computational tool to detect subsets of genes that exhibit consistent pattern over subsets of conditions. In this article, we review several recent patents in bicluster analysis, and in particular, highlight a recent patent from our group about a novel geometric-based biclustering method that handles the class of bicluster patterns with linear coherent variation across the row and/or column dimension. This class of bicluster patterns is of particular importance since it subsumes all constant, additive, and multiplicative bicluster patterns normally used in gene expression data analysis.
authors.affiliation: School of Information and Communication Technology, Gold Coast Campus, Griffith University, QLD 4222, Australia. a.liew@griffith.edu.au
authors.forename: Alan Wee-Chung
authors.initials: AW
authors.lastname: Liew
authors.forename: Ngai-Fong
authors.initials: NF
authors.lastname: Law
authors.forename: Hong
authors.initials: H
authors.lastname: Yan
mesh_terms: D000465:Algorithms; D016000:Cluster Analysis; D015870:Gene Expression; D020869:Gene Expression Profiling / Q000379:methods*; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods; D010330:Patents as Topic; D010363:Pattern Recognition, Automated / Q000379:methods