title: Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies.
abstract: BACKGROUND
  The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem in the analysis of gene expression data since genes may only jointly respond over a subset of conditions. Biclustering algorithms also have important applications in sample classification where, for instance, tissue samples can be classified as cancerous or normal. Many of the methods for biclustering, and clustering algorithms in general, utilize simplified models or heuristic strategies for identifying the "best" grouping of elements according to some metric and cluster definition and thus result in suboptimal clusters.
  
  
  RESULTS
  In this article, we present a rigorous approach to biclustering, OREO, which is based on the Optimal RE-Ordering of the rows and columns of a data matrix so as to globally minimize the dissimilarity metric. The physical permutations of the rows and columns of the data matrix can be modeled as either a network flow problem or a traveling salesman problem. Cluster boundaries in one dimension are used to partition and re-order the other dimensions of the corresponding submatrices to generate biclusters. The performance of OREO is tested on (a) metabolite concentration data, (b) an image reconstruction matrix, (c) synthetic data with implanted biclusters, and gene expression data for (d) colon cancer data, (e) breast cancer data, as well as (f) yeast segregant data to validate the ability of the proposed method and compare it to existing biclustering and clustering methods.
  
  
  CONCLUSIONS
  We demonstrate that this rigorous global optimization method for biclustering produces clusters with more insightful groupings of similar entities, such as genes or metabolites sharing common functions, than other clustering and biclustering algorithms and can reconstruct underlying fundamental patterns in the data for several distinct sets of data matrices arising in important biological applications.
authors.affiliation: Department of Chemical Engineering, Princeton University, Princeton, NJ, USA. pete@titan.princeton.edu
authors.forename: Peter A
authors.initials: PA
authors.lastname: DiMaggio
authors.forename: Scott R
authors.initials: SR
authors.lastname: McAllister
authors.forename: Christodoulos A
authors.initials: CA
authors.lastname: Floudas
authors.forename: Xiao-Jiang
authors.initials: XJ
authors.lastname: Feng
authors.forename: Joshua D
authors.initials: JD
authors.lastname: Rabinowitz
authors.forename: Herschel A
authors.initials: HA
authors.lastname: Rabitz
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D001943:Breast Neoplasms / Q000235:genetics; D016000:Cluster Analysis; D003110:Colonic Neoplasms / Q000235:genetics; D003628:Database Management Systems; D030541:Databases, Genetic; D004926:Escherichia coli / Q000235:genetics; D006801:Humans; D007091:Image Processing, Computer-Assisted; D016247:Information Storage and Retrieval / Q000379:methods; D008962:Models, Theoretical; D020411:Oligonucleotide Array Sequence Analysis; D010363:Pattern Recognition, Automated / Q000379:methods; D012441:Saccharomyces cerevisiae / Q000235:genetics; D049490:Systems Biology / Q000379:methods*; D015003:Yeasts / Q000235:genetics