Home | About | Journals | Submit | Contact Us | Français |

**|**BMC Bioinformatics**|**v.9; 2008**|**PMC2605474

Formats

Article sections

- Abstract
- Background
- Results and discussion
- Conclusion
- Methods
- Authors' contributions
- Supplementary Material
- References

Authors

Related links

BMC Bioinformatics. 2008; 9: 458.

Published online 2008 October 27. doi: 10.1186/1471-2105-9-458

PMCID: PMC2605474

Peter A DiMaggio, Jr,^{1} Scott R McAllister,^{1} Christodoulos A Floudas,^{}^{1} Xiao-Jiang Feng,^{2} Joshua D Rabinowitz,^{2} and Herschel A Rabitz^{2}

Peter A DiMaggio, Jr: ude.notecnirp.natit@etep; Scott R McAllister: ude.notecnirp.natit@ttocs; Christodoulos A Floudas: ude.notecnirp.natit@saduolf; Xiao-Jiang Feng: ude.notecnirp@gnefx; Joshua D Rabinowitz: ude.notecnirp.scimoneg@rhsoj; Herschel A Rabitz: ude.notecnirp@ztibarh

Received 2008 September 19; Accepted 2008 October 27.

Copyright © 2008 DiMaggio et al; licensee BioMed Central Ltd.

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This article has been cited by other articles in PMC.

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.

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.

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.

Problems of data organization and data clustering are prevalent across a number of different disciplines. These areas include pattern recognition [1], image processing [2], information retrieval [3], microarray gene expression [4], and protein structure prediction [5,6], just to name a few. The goal of data clustering, regardless of the application, is to organize data in such a way that objects which exhibit "similar" attributes are grouped together. The definition of similarity depends on the application and may correspond to the direct comparison of values or the degree of correlation among trends or patterns of values.

Several methods have been proposed for the clustering of large-scale, dense data. The most common approaches to the data clustering problem are typically categorized as hierarchical [4] or partitioning [7] clustering. Although algorithms to identify the optimal solutions to these categories of problems do exist [8-10], they are frequently solved using heuristic search techniques that result in suboptimal clusters because the comparisons between terms are evaluated locally. Various other frameworks for data clustering have been proposed, including model-based clustering [11,12], neural networks [13], simulated annealing [14], genetic algorithms [15,16], information-based clustering [17], decomposition based approaches [18-20], and data classification [21,22]. The field of rearrangement clustering has emerged as an effective technique for *optimally *minimizing the sum of the pairwise distances between rearranged rows and columns. The bond energy algorithm (BEA) was originally proposed as a method for finding "good" solutions to this problem [23] and it was subsequently discovered that this problem could be formulated as a traveling salesman problem (TSP) which can be solved to optimality [24,25] using existing methods.

If a gene is involved in more than one biological process or belongs to a group of genes that are coexpressed under limited conditions, then alternative cluster definitions and clustering techniques are required [26]. A bicluster is defined as a submatrix which spans a certain set of genes (rows) and certain set of conditions (columns). Common elements can be shared among biclusters and there is no requirement that all members of the original matrix are classified in a bicluster. Several different models and algorithms have been developed for this NP-hard problem [27]. To generate biclusters within a reasonable amount of time, many existing techniques either employ heuristic methods for generating good solutions or simplify the problem representation, such as discretizing the expression level.

The Cheng and Church [27] and cMonkey [28] biclustering algorithms are iterative processes and allow for integration of other data types since they do not transform the data. The Cheng and Church algorithm uses a greedy heuristic to solve an optimization problem based on the mean square residue, which provides a measure of deviation from the actual value of an element and its expected value based on the row, column, and bicluster mean [27]. Other methods for biclustering, such as plaid [26] and spectra models [29], are related to projection methods which regenerate the data matrix by biclusters. The plaid model expresses the value of each element in the gene expression data as a series of additive layers [26] and the spectra model uses singular value decomposition to identify eigenvectors that reveal the existence of checkerboard structures within the rearranged genes and conditions [29]. Another matrix factorization based method, nsNMF [30], utilizes non negative matrix factorization with non-smoothness constraints to identify block-structures (biclusters) in gene expression data for a given factorization rank. In contrast to the plaid model, which focuses on the uniformity of expression levels, biclusters defined by order-preserving submatrices focus on the relative order of the columns [31] in an attempt to identify biclusters with coherent evolutions. The biclustering methods Bimax [32] and Samba [33] discretize the expression level which allows them to enumerate a large number of biclusters in less time than more complicated models. To complement the assortment of problem representations for biclustering, there have been a variety of algorithmic approaches developed to solve these models of varying complexity, such as zero-suppressed binary decision diagrams [34], evolutionary algorithms [35,36], Markov chain Monte Carlo [28], bipartite graphs [33], and 0–1 fractional programming [37]. An excellent review of different bicluster definitions and biclustering algorithms can be found in [38].

In this article, we introduce a biclustering algorithm which iteratively utilizes optimal re-ordering to cluster the rows and columns of dense data matrices in systems biology. We present several objective functions to guide the rearrangement of the data and two different mathematical models (network flow and traveling salesman problem) to perform the row and column permutations of the original data matrix. We demonstrate that this global optimization method provides a closer grouping of interrelated entities than other clustering and biclustering algorithms, produces clusters with insightful molecular functions, and can reconstruct underlying fundamental patterns in the data for several distinct sets of data matrices arising in important biological applications.

In this section, we present the results for our proposed biclustering method for a variety of interesting systems. We first demonstrate the effectiveness of the proposed algorithm by analyzing systems that can be manually or visually assessed. For this purpose, we chose to examine (a) a small data matrix consisting of metabolite concentration data and (b) an image reconstruction problem, which allows for visual inspection of the results. We then apply the proposed methodology to larger systems corresponding to (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. For each of these data sets, we draw comparisons with several other clustering and biclustering techniques.

The proposed method was tested on data comprised of concentration profiles for 68 metabolites (the rows of the data matrix) recorded over time (columns of the data matrix) for the organisms *E. coli *and *S. cerevisiae *under the conditions of nitrogen and carbon starvation for both organisms [39]. The concentration changes were dynamically measured using liquid chromatography-tandem mass spectrometry. We applied our biclustering algorithm to this data using the objective function defined in Eq. 3. The re-ordering problem for the columns was solved to global optimality using the mixed-integer linear programming algorithm in CPLEX [40] in 2.7 seconds on an Intel 3.0 GHz Pentium 4 processor. The optimal ordering for the columns using the objective function in Eq. 3 is shown in Figure Figure1,1, where the top four cluster partitions for the columns are denoted by the solid vertical lines.

It is interesting to note that the two most significant cluster boundaries perfectly partition subsets of the *E. coli *and *S. cerevisiae *conditions. An interesting feature of the column rearragnement is that all the nitrogen starvation conditions occupy one half of the matrix and the carbon starvation conditions occupy the remaining half of the matrix. The regions between these cluster boundaries, labeled A, B, C, D, and E in Figure Figure1,1, are also optimally re-ordered using the proposed method. For the sake of brevity, let us consider the results obtained from optimally re-ordering the submatrices for region E, as shown in the enlarged regions of Figure Figure1.1. The submatrix for region E was optimally re-ordered in 0.18 CPU seconds. The optimally re-ordered metabolites for region E over the conditions of carbon starvation in *E. coli *yields an excellent grouping of amino acid and TCA metabolites. In a cluster of 27 metabolites, 16 are amino acids (out of a total of 19 amino acids in the data) and 8 are ordered consecutively: serine, glycine, valine, glutamate, tryptophan, alanine, threonine, and methionine (see the "***" symbols in Figure Figure1).1). This richness of amino acid metabolites is consistent with the observation that amino acids tend to accumulate during carbon starvation [39]. Another interesting feature is that four out of the six TCA metabolites (trans-aconitate, citrate, malate, and acetly-coa, represented by the "+++" symbols in Figure Figure1)1) are within six positions of each other in the optimal ordering. The biosynthetic intermediates also order well for this submatrix (as shown by the "ooo" symbols in Figure Figure1),1), where all twelve are placed in the top half of the re-ordered matrix, which is rich in metabolites that are decreasing in concentration. An interesting observation is the final position of FBP relative to phospoenolpyruvate (PEP), which are exactly opposite each other in the re-ordered matrix. PEP is a positive regulator of pyruvate kinase, which is the major enzyme consuming PEP [39]. Since carbon-starvation resulted in a decrease of FBP, this presumably down-regulates the activity of pyruvate kinase, which in turn results in PEP accumulation.

We compared our findings with the results for hierarchical clustering [4] applied to the metabolite concentration data [39]. The hierarchical clustering placed the majority of amino acids in the top half of the arranged matrix, with the largest consecutive ordering of amino acids being alanine, glutamate, threonine, methionine, and serine, which is a less significant clustering than those found in region E for OREO. The TCA cycle compounds were also not found to be grouped as well for hierarchical clustering as they were for OREO, where four TCA cycle compounds (aconitate, malate, citrate, and succinate) were assigned to a cluster of ten metabolites [39]. We also optimally re-ordered the hierarchical clustering leaves using the TreeArrange algorithm [41] to see if the clustering of related metabolites would improve. The most notable improvement in the results of the optimal leaf ordering are a grouping of 6 amino acid metabolites out of 9 metabolites (threonine, glutamate, tryptophan, asparigine, alanine, glycine) and an ordering where 8 biosynthetic intermediate metabolites were found in a span of 9 metabolites. Overall, when compared to hierarchical clustering, with and without optimal leaf ordering, OREO arranges the metabolites in an order which more closely reflects their known metabolic functions.

The objective function values for Eq. 3 were evaluated for the final ordering as provided by the hierarchical clustering results and then compared to the optimal values that were determined using our method over all columns and rows (shown in Table Table1).1). The "Gap" column in Table Table11 is a standard measure for quantifying the deviation of an ordering from optimality. Based on Table Table1,1, the final ordering provided by the hierarchical results, with and without optimal leaf ordering, are suboptimal with respect to the squared difference objective function.

Since the rearranged data appears to naturally form biclusters, we compared the results for OREO with the biclustering algorithms ISA, Cheng and Church's, OPSM, BiMax, SAMBA, and nsNMF on the metabolite concentration data set. Each algorithm was run using the default parameter values, which were adjusted in the event that no biclusters were found. The biclustering results were visualized using the BiVoc algorithm [42] and are provided along with a complete description of the results obtained for each method [see Figures S.1 through S.7 in Additional file 1].

The best results were reported by Cheng and Church's Algorithm [27] and nsNMF. For Cheng and Church's algorithm, the best bicluster consisted of 30 metabolites, of which 15 were assigned to the amino acid category [39] over various conditions related to carbon and nitrogen starvation in *E. coli *and *S. cerevisiae*. The longest consecutive ordering of amino acids within this bicluster are serine, methionine, threonine, glutamate, and alanine, which is exactly the same as that reported in the hierarchical clustering results. The majority of the other metabolites in this bicluster are biosynthetic intermediates. The biclustering algorithm nsNMF was applied to the metabolite concentration data set for 100 runs using a cophenetic correlation coefficient of *k *= 2 [30]. Sorting the starvation conditions using the first and second basis metabolites also perfectly separates the nitrogen and carbon starved samples for both basis metabolites, which is consistent with the findings of OREO. When sorting the metabolites using the first basis condition, there is an excellent grouping of 15 amino acid metabolites within a span of 22 metabolites. The metabolites sorted by the second basis condition did not yield any significant grouping of related metabolites.

We also applied the proposed method to a data matrix representing an image, commonly referred to as the "Lenna image", which has been extensively studied in the image processing community. Although the pixels of an image are very different than patterns observed in systems biology data, studying such a matrix allows us to visually assess the ability of the proposed approach. In the experiment presented in [43], the original image, which consists of 512 by 512 pixels, was elongated by replicating it 10 times to create a 5,120 by 512 matrix. The optimal ordering of this replicated image should result in a stretched version of the original image. The results for a Memetic algorithm, CLICK, and two other methods based on hierarchical clustering were presented in this study [43] and here we compare our results to these findings. OREO was able to recover the correct ordering for the original image and a subset of the original image [see Figures S.8 and S.9 in Additional file 1]. This image was also examined after introducing two types of noise: (1) modifying *every *pixel by a random value less than 10% of the maximum pixel intensity (255) and (2) assigning a random value between 0 and 255 to 10% of the pixels (e.g., 262,144 of the pixels). The optimal ordering determined by OREO is presented in Figure Figure2,2, where we see that we again recover the correct image. The Memetic algorithm is able to recover the original image and the agglomerative clustering algorithm performs slightly worse given this noise level, as the misplaced subsection of the image has become larger (compare Figures Figures22 and S.8). As in the case without any noise (see Figure S.8), the EBI hierarchical clustering algorithm and CLICK chop the original image into many disjunct subsections. Although this example does not correspond to biological data, it illustrates the applicability of OREO for other systems.

We also tested our proposed methodology on a data set corresponding to synthetic gene expression data created by an artificial model [32]. In these data sets, both constant and additive biclusters of varying degree of overlap were implanted into a simulated matrix and subjected to different levels of noise. The biclustering methods BiMax, ISA, SAMBA, Cheng and Church's, OPSM, xMotif, and hierarchical clustering were applied to these data matrices and the results were assessed based on two metrics: (1) the average bicluster relevance and (2) the average module recovery, as defined in [32]. The average bicluster relevance is a quality measure for the biclusters that are produced by a particular method and the average module recovery is a measure of how well a particular method is at finding all of the implanted biclusters. We applied OREO to the four sets of synthetic data (provided at http://www.tik.ee.ethz.ch/sop/bimax): (1) non-overlapping constant biclusters, (2) non-overlapping additive biclusters, (3) overlapping constant biclusters, and (4) overlapping additive biclusters, all subjected to varying levels of noise estimated from a normal distribution. The average bicluster relevance and average module recovery were computed for OREO for each of these data sets [see Figures S.10 through S.17 in Additional file 1].

When analyzing the non-overlapping and constant bicluster data sets, the biclusters produced by OREO have a perfect score for average bicluster relevance and average module recovery, as shown in Figures S.10 and S.11. As can be seen in Figure 2(a) in [32], only hierarchical clustering performs as well as OREO for this data set. The biclusters produced by ISA have a perfect score for average bicluster relevance but have slightly worse scores for the average module recovery. BiMax also scores well for these two metrics, but it is observed in Figure 2(a) in [32] that its performance decreases with increasing noise level. The biclusters produced by the other methods do not score very well for this set of synthetic data.

For the non-overlapping and additive bicluster data sets, OREO consistently produces biclusters that have an average bicluster relevance score greater than 0.90 (see Figure S.12). In Figure 2(b) from [32], it is seen that ISA and SAMBA produce biclusters that have almost perfect average bicluster relevance scores. The average bicluster relevance for hierarchical clustering is shown to consistently decrease with increasing noise level for these additive biclusters. In terms of average module recovery, it is seen in Figure S.13 that OREO again consistently scores above 0.92 over the varying levels of noise. The average module recovery of BiMax and ISA are shown to be comparable to that of OREO as observed in Figure 2(b) in [32], whereas the other methods do not score as well for the additive biclusters subject to varying degrees of noise. For the data sets corresponding to overlapping constant biclusters, the average bicluster recovery and average module recovery follow similar trends (see Figures S.14 and S.15); the scores initially start at one (i.e., non-overlapping), slightly fall for overlapping degrees of 1 and 2 elements, then rise back to a score of one for the overlapping degrees ranging from 3 to 7 and then finally descend at an overlap degree of 8 elements. From Figure 2(c) in [32], it is shown that BiMax produces biclusters with perfect scores for the average bicluster relevance and average module recovery, SAMBA produces biclusters with perfect scores for average bicluster relevance but significantly poorer scores for average module recovery (all scores with the exception of the non-overlapping instance are below 0.8), and ISA performs slightly better than OREO in terms of average bicluster relevance for the data matrices with overlapping degrees of 1 and 2 elements. It is observed that the remaining methods produce clusters that consistently score less than 0.7.

When examining the overlapping and additive bicluster data sets, the average bicluster relevance for OREO is slightly higher than 0.8 on average and the average module recovery is about 0.9 on average, as shown in Figures S.16 and S.17. From Figure 2(d) in [32], it is seen that BiMax produces biclusters that have perfect scores for the average bicluster relevance and average module recovery. SAMBA also performs well for the additive biclusters, with the exception of very low scores (less than 0.6) for an overlap degree of 7 elements. ISA performs comparably to OREO for the average bicluster recovery but is shown to decrease in performance with respect to increasing noise level. The results for hierarchical clustering for the overlapping data sets are shown to be much worse than for the non-overlapping data sets and the remaining biclustering methods consistently yield scores less than 0.6 in both metrics.

We also tested the proposed method on a standard biclustering sample classification example [38] comprised of gene expression data for 62 colon tissue samples, 22 of which were normal and 40 of which were tumor tissues [44]. In the original work by Alon et al. [44], the 2000 genes with the highest minimal intensity across the samples were examined using a deterministic-annealing algorithm [45]. Two-way clustering was performed on both the genes and the tissue samples and it was found that the algorithm was able to approximately separate the tissues into a normal-rich cluster and a tumor-rich cluster. Figure Figure33 illustrates the separation of the tissues into tumor-rich and normal-rich regions, where the tumor tissues are in black and the normal tissues in white. Only three normal tissues (N8, N12, N34) were assigned in the tumor-rich tissue region and a total of five tumor tissues (T30, T36, T33, T37, T2) were placed in the normal-rich tissue region [see Table S.1 in Additional file 1]. The clustering of the genes revealed a strong correlation among the ribosomal proteins, where a cluster consisting of 22 ribosomal proteins was discovered [44]. We applied our biclustering method to the same set of 2000 genes of highest minimal intensity and 62 tissue samples using the traveling salesman representation and the objective function defined in Eq. 3. The original data was normalized by performing Z-normalization over all genes and all tissues. The optimal re-ordering for the tissues (or columns) was achieved in a CPU time of 0.17 seconds. The normal and tumor tissue samples were partitioned into normal-rich and tumor-rich regions based on the largest two cluster boundaries. Figure Figure33 illustrates the partitioning of the tumor and normal tissues and the tissue names in the normal- and tumor-rich regions are provided [see Table S.1 in Additional file 1]. Note that in Figure Figure3,3, OREO provides the richest grouping of tumor tissues in comparison to all the other methods. Overall, these results are consistent with the findings of Alon et al. in that N8 and N34 were incorrectly grouped with the tumor tissues and T30, T36, T33, T37, T2 were incorrectly grouped with the normal tissues [see Table S.1 Additional file 1]. The genes (or rows) of the data matrix were then optimally re-ordered over both the corresponding tumor and normal-rich submatrices. To compare our clustering with the results presented in Alon et al., we examined the final orderings of the genes related to ribosomal proteins and growth factors. For the tumor-rich submatrix, OREO organized 30 out of the 48 ESTs homologous to ribosomal proteins into one dense cluster, which is very similar to the findings of Alon et al. [44]. Interdispersed among the ribosomal protein cluster are 6 ESTs homologous to genes that are related to cell growth, such as elongation factors, which is also consistent with previous findings [44,46].

The colon cancer data was also examined using hierarchical clustering [4]. The genes related to ribosomal proteins were clustered together, but only 19 out of the 48 were grouped into a larger cluster with 5 ESTs homologous to genes related to cell growth interdispersed throughout. Figure Figure33 shows that the separation of normal and tumor tissues was not as consistent for hierarchical clustering, where there are several alternating regions of tumor- and normal-rich tissues. Even after optimally re-ordering the hierarchical clustering leaves using TreeArrange [41], the tumor and normal tissues do not separate into two distinct groupings as shown in Figure Figure3.3. The clustering of the 25 ribosomal proteins and cell growth factors do not change after optimal re-ordering of the leaves. In Table Table1,1, we present the deviation from optimality for the ordering reported from hierarchical clustering with reference to the optimal ordering over all columns and rows as determined by our method.

The biclustering algorithm nsNMF [30] was applied to this data set and the separation of the tissues after sorting on the first and second basis genes are presented in Figure Figure3,3, where it is shown that both factors fail to separate the normal and tumor tissues into two distinct regions. However, when sorting the genes on the first basis tissue, a cluster of 23 ribosomal proteins and 7 ESTs homologous to genes related to cell growth is discovered with a relative grouping similar to that of OREO. We also examined this data set with the biclustering algorithms ISA, SAMBA, xMotif, OPSM, and Cheng and Church [see Additional file 2] using the default parameters of each method. For all of the biclustering methods, we examined the molecular function and biological process enrichment of the corresponding biclusters using the ontology tool Onto-Express [47], applying a hypergeometric distribution and referencing the calculations by the 2000 genes analyzed. If the algorithm produced more than 15 biclusters, we selected the highest scoring 15 or the first 15 that were reported if no scores were provided. The ontology results for each of the biclustering methods are available [see Additional file 3]. From the ontology analysis, it was found that OREO uncovers several biclusters that are significantly annotated to the molecular function "structural constituent of ribosome", which corresponds to the aforementioned ribosomal proteins that were the focus of discussion in the Alon et al. study. The only other methods that provided biclusters significantly annotated to the molecular function of "structural constituent of ribosome" were nsNMF (after sorting on the first factor) and SAMBA.

The proposed biclustering method was also applied to breast cancer data studied by Van't Veer et al. [48]. In this data matrix, the expression level for approximately 25,000 genes over 98 breast cancer tumors were measured. A supervised clustering method was used to determine the optimal number of reporter genes for classification based on prognosis, ER status, and BRCA1 germline mutation carriers [48]. In this study, it was discovered that about 5,000 of the most significantly regulated genes across the 98 tumor samples, which had at least a two-fold difference and a p-value of less than 0.01 in five or more samples, were effective in separating ER positive from ER negative tumor samples. Missing data values for this matrix were estimated using the k-nearest neighbors approach [49].

OREO was applied to this set of about 5,000 significant genes and 98 tumor samples and the tumors were re-ordered in 0.09 CPU seconds. In Figure Figure44 it is shown that the column re-ordering for OREO is fairly successful in partitioning the ER positive and ER negative tumors, with 13 ER negative tumors assigned to the ER positive region and 1 ER positive tumor assigned in the ER negative region. Hierarchical clustering [4] was also applied to the same data matrix and the resulting arrangement of the tumors is shown in Figure Figure4,4, where it is shown that there is a reasonable grouping of the ER positive and ER negative tumors, but an overall separation is not achieved. However, the partitioning is enhanced after optimally re-ordering the leaves using TreeArrange, as shown in Figure Figure4,4, where 12 ER negative tumors are assigned to the ER positive region and 4 ER positive tumors are assigned in the ER negative region. We examined the clustering of the 550 optimal ER status genes as determined by Van't Veer et al. [48]. On average, OREO required 3115 CPU seconds to optimally re-order these roughly 5,000 genes over the resulting biclusters. We then examined the densest clustering of at least 50 of these genes for OREO and hierarchical clustering, with and without optimal leaf ordering. In other words, we searched for the smallest size neighborhood of genes in which 50 ER status genes were found. For OREO, 50 of the optimal ER status genes were found in a span of only 171 genes (29.2%). For hierarchical clustering, the densest clustering of optimal ER status genes was found to be 53 within a span of 268 genes (19.8%). However, after optimally re-ordering the leaves, a grouping of 56 ER status genes was found in a span of only 172 genes (32.6%). Table Table11 illustrates the deviations from optimality for the re-orderings provided by hierarchical clustering, with and without optimal leaf ordering.

The biclustering algorithm nsNMF [30] was also applied to this data set for 100 runs with a cophenetic correlation coefficient of *k *= 2. The ordering of the tumors after sorting on the first and second basis genes are presented in Figure Figure4,4, where one can see that the nsNMF algorithm is also fairly successful in partitioning the tumors which exhibit ER expression. Although the orderings are different for sorting on the two factors, both result in 14 ER negative tumors assigned to the ER positive region and 6 ER positive tumors assigned in the ER negative region. The biclustering methods ISA, SAMBA, xMotif, OPSM, and Cheng and Church were applied to this breast cancer data set for comparison using the default parameters [see Additional file 3]. We examined the molecular function and biological enrichment of the corresponding biclusters using Onto-Express [47], using a hypergeometric distribution and referencing the calculations by the 5000 genes analyzed [see Additional file 4]. If the algorithm produced more than 15 biclusters for this data set, we examined the biological enrichment for the highest scoring 15 or the first 15 that were reported if no scores were provided. It is observed from the ontology results [see Table S.3 in Additional file 1] that OREO had uncovered biclusters with a significant enrichment for the molecular functions "MHC class II receptor activity" and "MHC class I receptor activity". It is well-known that MHC proteins are cell-surface glycoproteins that bind peptides within the cell, then bring the peptide to the surface for interaction with T cells, which is part of the mechanism in which the body identifies and responds to foreign antigens. These findings are complemented by several OREO biclusters that are enriched in the biological process "immune response". The only other method which found biclusters annotated to both the molecular process "MHC class I receptor activity" and the biological process "immune response" was OPSM. The algorithms nsNMF and SAMBA also identified biclusters annotated to the "immune response" biological process.

To assess the quality of the biclusters produced as a function of the input data, we computed the average correlation among the rows and columns as a function of (1) the bicluster area (the number of rows times the number of columns in a bicluster), (2) the number of rows per bicluster, and (3) the number of columns per bicluster for the (a) metabolite concentration data, (b) colon cancer data, and (c) breast cancer data sets. The average correlation values for each of these scenarios were computed [see Figures S.18 through S.29 in Additional file 1].

For the average correlation over the bicluster rows as a function of bicluster area (see Figures S.18, S.22, and S.26), it is observed that OPSM consistently produces biclusters with the highest average row correlation values for the smaller bicluster areas. Note that in each of these data sets, the average correlation values for OPSM are monotonically decreasing as a function of the bicluster area. It is also observed in each of the data sets that OREO produces biclusters that are the largest in area and have average row correlation values ranging between 0.4 and 0.7. In the majority of instances, no other biclustering methods produce biclusters comparable to this size. The average row correlation values for the biclusters produced by ISA range from 0 to 0.7, with an average row correlation of about 0.25 over the data sets. The biclusters produced by SAMBA generally have better average row correlation values than ISA for a given bicluster area. In particular, SAMBA performs well for the breast cancer data set (see Figure S.26) and produces many biclusters with row correlation values that range from 0.18 to 0.84. For the colon cancer data set, SAMBA produces sizable biclusters that are similar in area to those produced by OREO, but the row correlation values for OREO are consistently higher. Cheng and Church's algorithm produces biclusters of consistently lower average row correlation values than the other biclustering methods, with the exception of a few biclusters corresponding to the metabolite concentration data set (in Figure S.18) that have correlation values greater than 0.5. The aforementioned trends are consisently observed for the average correlation over rows as a function of number of rows for all biclustering methods (presented in Figures S.19, S.23, and S.27).

We also examined the average correlation among the bicluster columns as a function of bicluster area, and the results are presented in Figures S.20, S.24, and S.28. In contrast to the row correlation as a function of bicluster area, there were no discernable trends for the correlation of columns as a function of bicluster area for OPSM. In fact, the average correlation values over the columns are not dominant for OPSM as they were for the row correlations, although it typically produces average bicluster column correlation values greater than 0.5. As previously mentioned, OREO produces biclusters that are much larger than the other biclustering techniques, and it is interesting to note that the average correlation values over the columns for OREO are as large, and in some cases greater, than those found in the smaller biclusters produced by other methods. This observation is consistent when considering the column correlation as a function of the number of bicluster columns, as presented in Figures S.21, S.25, and S.29. It should be noted that ISA is observed to produce biclusters of substantially greater column correlation than row correlation (compare Figures S.18, S.22, and S.26 with Figures S.20, S.24, and S.28). However, this is a mathematical artifact since ISA produces biclusters that typically contain less than 5 columns, as shown in Figures S.21, S.25, and S.29, which presents the average column correlation as a function of the number of bicluster columns. The column correlations for the biclusters produced by SAMBA are of varying quality and have a high variation throughout the data sets. One should note that although the bicluster areas for SAMBA and ISA are generally consistent, SAMBA consistently has more columns per bicluster than ISA, which implies that ISA typically contains more rows per bicluster than SAMBA (this is confirmed in Figures S.19, S.23, and S.27). Cheng and Church's algorithm yields biclusters whose column correlations are of higher value than its row correlations; note that this observation is not a mathematical artifact of having a small number of columns per bicluster, as it was with ISA.

The last data set used to test the proposed methodology is comprised of expression data for 6216 genes subject to 131 stress conditions [50]. Solving such a large-scale data set to optimality is a challenging task. OREO was able to optimally re-order the rows and columns of the matrix according to the objective function defined in Eq. 3 in approximately 19 hours of wall-clock time. Hierarchical clustering [4] and nsNMF [30] were also applied to re-order the experiments and genes of this data set and the hierarchical clustering leaves were also optimally re-ordered using TreeArrange [41]. The cophenetic correlation coefficient was computed for nsNMF [30] for factors *k *= 2 through 12 and it was found that a rank of four factors resulted in the highest coefficient. We also applied the biclustering algorithms BiMax and ISA to this data set and neither method was able identify significant biclusters for a variety of search parameters. To assess the biological significance of the re-ordered genes over all conditions, we examined biological processes from a curated gene ontology network for *S. cerevisiae *[51]. To evaluate the biological significance for neighboring genes, we evaluated the average enrichment for each of the 130 gene ontology terms over all possible neighborhoods of size L genes in the final ordering. For a specific neighborhood of size L genes, the biological process with the greatest enrichment is defined as the process with the maximum value according to the expression in Eq. 1.

$$\text{Enrichmentofprocessk}=\frac{(N{G}_{L}^{k}-1)/L}{N{G}^{k}/NG}$$

(1)

Where $N{G}_{L}^{k}$ denotes the number of genes in a neighborhood of size *L *for process *k*, *NG*^{k }denotes the number of genes for process *k *in the entire experiment, and *NG *represents the total number of genes in the experiment. The term in the numerator in Eq. 1 represents the frequency of genes annotated with a given process, k, over the total number of genes considered, L. The frequency is adjusted for neighborhoods that have poor or random enrichment by subtracting one from the gene frequency. This enrichment is normalized by the term in the denominator, which is the fraction of the total number of genes annotated to process k in the experiment. This form of enrichment was applied to the re-ordered genes in order to fairly represent the contributions of interesting biological processes that are annotated to only a small subset of genes [see Additional file 1 for discussion]. Eq. 1 is applied for every process over all possible neighborhoods of genes, where the initial neighborhood of genes is comprised of genes of 1 though L in the final ordering and this neighborhood window is incremented by one gene (i.e., the next neighborhood contains genes 2 through L+1) until the last gene in the final ordering has been reached. The enrichment values in Eq. 1 are then averaged over the total number of neighborhoods considered. This process is repeated for several gene neighborhood sizes in the range of 4 to 15 genes and the results comparing our method to hierarchical clustering are shown in Figure Figure55.

One can see from Figure Figure55 that OREO achieves about 13 percent improvement in enrichment on average over the grouping of genes provided by hierarchical clustering. Although the enrichment for hierarchical clustering increases about 6 percent on average after applying TreeArrange to optimally re-order the leaves, it is still notably less than that provided by OREO. It is also shown in Figure Figure55 that the orderings provided by nsNMF after 50 runs when sorting the genes by either of the four basis conditions does not result in significant enrichment values.

The increased enrichment indicates that genes which are annotated to similar biological processes are arranged closer relative to one another in the final arrangement provided by OREO than for hierarchical clustering, with and without optimal leaf ordering, and nsNMF. When examining the individual process contributions to the average enrichment, we observed that electron transport, translation, hydrogen transport, ribosomal biogenesis/assembly and rRNA metabolism were the largest contributors to the overall enrichment value for both OREO and hierarchical clustering. Other biological processes of similar enrichment magnitudes for OREO include sulfur metabolism, aldehyde metabolism, carbohydrate transport, and mitochondrial transport, suggesting a better clustering of these genes. The deviations from optimality for the re-orderings provided by hierarchical clustering, with and without optimal leaf ordering, are presented in Table Table1.1. We also present the results of our method for another data set consisting of an aggregation of experiments on budding yeast [4] [see Additional file 5].

A rigorous method for biclustering based on the optimal re-ordering of dense data matrices, OREO, was presented in this article. The re-ordering of the rows and columns can be accomplished via either a network flow model or a traveling salesman problem representation, where the network flow model can be extended to include more than pairwise interactions. This iterative approach uses cluster boundaries in one dimension to define submatrices that are then optimally re-ordered in the other dimension to generate biclusters. Several different objective functions can be used to quantify the degree of similarity between adjacent rows and columns in the final arrangement and the selection of the appropriate metric is left as an option to the user. We compared the results of our method with several clustering and biclustering methods for (a) metabolite concentration data, (b) an image matrix, (c) synthetic data with implanted biclusters, and gene expression data for (d) colon cancer data, (e) breast cancer data, and (f) yeast segregant data. For each of these data sets, our method provides a closer grouping of related metabolites and annotated genes than the other clustering and biclustering algorithms, which suggests that the optimal re-ordering has distinct advantages over a local re-ordering and the simplifying assumptions of biclustering methods. It was also shown that OREO has the ability to separate objects into distinct groups, as was illustrated with the separation of the starvation conditions in the metabolite concentration data and the separation of samples in the colon and breast cancer data sets.

In this section, we present the components of the mathematical model: (1) the variables, (2) the objective functions used to quantify pairwise similarity, and (3) two problem formulations which provide the optimal rearrangement of rows and columns, namely (a) a network flow model and (b) a traveling salesman (TSP) model. We then present a method for identifying cluster boundaries and iteratively biclustering submatrices via optimal re-ordering of submatrices. In the future, we plan to make this biclustering framework available to the academic community as a web-based tool.

The index pair (*i*, *j*) corresponds to a specific row *i *and column *j *of a matrix, where the value of this pair is denoted as *a*_{i,j}. The cardinality (or in this case, the dimension) of the rows and columns of the matrix will be represented as |*I*| and |*J*|, respectively. For the sake of brevity in this section and the remainder of the article, we present the terminology and mathematical model only for the rows of the matrix, but an analogous representation follows for the columns. We define the rows *i *and *i' *to be adjacent in the *final *arrangement of the matrix, where row *i' *is directly below row *i*. The final ordering of adjacent rows is represented via the following binary 0–1 variables.

$${y}_{i,{i}^{\prime}}^{row}=\{\begin{array}{ll}1,\hfill & \text{ifrowiisadjacentandabove}\hfill \\ \hfill & \text{rowi'inthefinalordering}\hfill \\ 0,\hfill & \text{otherwise}\hfill \end{array}$$

For instance, if the binary variable *y*_{8,3 }is equal to one then row 8 is immediately above row 3 in the final arrangement of the matrix. The assignment of *y*_{8,3 }= 0 implies that row 8 is *not *immediately above row 3 in the final arrangement, but does not provide any additional information regarding the final positions of rows 8 and 3 in the matrix.

The first stage of the proposed method optimally rearranges the rows and columns of a data matrix according to a given metric of similarity, which is left to the user to specify. In this section, we present common expressions that can be used for quantifying the similarity between two rows of a matrix. An intuitive metric of similarity is to minimize the relative difference in value for adjacent rows of a matrix, as presented in Eq. 2.

$$\sum _{i}{\displaystyle \sum _{{i}^{\prime}}{\displaystyle \sum _{j}{y}_{i,{i}^{\prime}}^{row}\cdot \left|{a}_{i,j}-{a}_{{i}^{\prime},j}\right|}}$$

(2)

The emphasis can be placed on penalizing specifically large differences in value by squaring the difference in value between two adjacent rows and columns, as shown in Eq. 3.

$$\sum _{i}{\displaystyle \sum _{{i}^{\prime}}{\displaystyle \sum _{j}{y}_{i,{i}^{\prime}}^{row}\cdot {\left({a}_{i,j}-{a}_{{i}^{\prime},j}\right)}^{2}}}$$

(3)

A metric similar to the root-mean squared deviation of values can also be used to guide the rearrangement of the matrix, as shown in Eq. 4.

$$\sum _{i}{\displaystyle \sum _{{i}^{\prime}}{y}_{i,{i}^{\prime}}^{row}\cdot \sqrt{\frac{{\displaystyle {\sum}_{j}{\left({a}_{i,j}-{a}_{{i}^{\prime},j}\right)}^{2}}}{\left|J\right|}}}$$

(4)

The aforementioned objective functions can be tailored to exploit physical trends in the data set. For instance, suppose it is known a priori that the values of the data are monotonic when arranged in a particular order and that this final configuration is desirable. Then the terms in any of these objective functions could be easily restricted to include only those rows that violate such a monotonicity trend (i.e., *a*_{i,j }> *a*_{i',j}). It is should be noted here that this monotonicity criterion is different than that of the biclustering algorithm OPSM [31]. Where OPSM is searching for the largest order-preserving submatrices for which the expression levels of all genes induce the same linear ordering across a subset of columns, the approach presented here would *allow *for monotonicity violations but penalize their contributions in the objective function. This is accomplished by only including the cost of placing elements *i *and *i' *adjacent in the final ordering if they violate the imposed monotonicity trend.

It should be noted that the objective functions defined in Eqs. 2 through 4 are symmetric, whereas incorporating monotonicity into these expressions introduces asymmetry. Each of these proposed metrics can result in distinctly different permutations of the final rearranged matrix. The objective functions presented in this section are typically used, however the model is not limited to these forms.

A network flow model [52-57] is adequate for solving small and medium-sized problems and can be extended to incorporate more than pairwise comparisons. Note that the objective functions introduced in the previous section are independent of how the rows are physically permuted. The final ordering of the row permutations can be represented as a directed acyclic graph, where an edge connects two rows if these rows are *adjacent *in the final ordering.

As previously mentioned, the binary variables ${y}_{i,{i}^{\prime}}^{row}$ represent the assignment of a neighboring row *i' *directly below row *i *in the final arrangement. In network flow terminology, we say that the binary variable ${y}_{i,{i}^{\prime}}^{row}$ represents the existence of the edge between rows *i *and *i'*. We introduce another set of binary variables, $y\text{\_}sourc{e}_{i}^{row}$ and $y\text{\_}sin{k}_{i}^{row}$, to indicate which rows are assigned at the top and bottom of the final rearranged matrix, respectively.

$$\begin{array}{c}y\text{\_}sourc{e}_{i}^{row}=\{\begin{array}{ll}1,\hfill & \text{ifrowiisthetop-most}\hfill \\ \hfill & \text{rowinthefinalordering}\hfill \\ 0,\hfill & \text{otherwise}\hfill \end{array}\\ y\text{\_}sin{k}_{i}^{row}=\{\begin{array}{ll}1,\hfill & \text{ifrowiisthebottom-most}\hfill \\ \hfill & \text{rowinthefinalordering}\hfill \\ 0,\hfill & \text{otherwise}\hfill \end{array}\end{array}$$

The flows values assigned to the edges connecting the rows are continuous variables denoted by ${f}_{i,{i}^{\prime}}^{row}$ These flows start from a fictitious source row and end at a fictitious sink row.

$$\begin{array}{lll}{f}_{i,{i}^{\prime}}^{row}\hfill & \equiv \hfill & \begin{array}{l}\text{theflowfromrow}i\hfill \\ \text{torow}{i}^{\prime}\hfill \end{array}\hfill \\ f\text{\_}sourc{e}_{i}^{row}\hfill & \equiv \hfill & \begin{array}{l}\text{theflowentering}\hfill \\ \text{thesourcerow}i\hfill \end{array}\hfill \\ f\text{\_}sin{k}_{i}^{row}\hfill & \equiv \hfill & \begin{array}{l}\text{theflowleaving}\hfill \\ \text{thesinkrow}i\hfill \end{array}\hfill \end{array}$$

It should be noted that the variables ${y}_{i,i}^{row}$ and ${f}_{i,i}^{row}$ are zero since row *i *can never be adjacent to *itself*.

The physical act of connecting two rows by an edge (i.e., putting two rows adjacent to one another in the final arrangement) is modeled via the following constraint equations.

$$\begin{array}{cc}{\displaystyle \sum _{{i}^{\prime}\ne i}{y}_{{i}^{\prime},i}^{row}+y\text{\_}sourc{e}_{i}^{row}}=1& \forall i\end{array}$$

(5)

$$\begin{array}{cc}{\displaystyle \sum _{{i}^{\prime}\ne i}{y}_{i,{i}^{\prime}}^{row}+y\text{\_}sin{k}_{i}^{row}}=1& \forall i\end{array}$$

(6)

These constraints enforce that each row, *i*, has only one neighboring row above it (or is the top-most row) and only one neighboring row below it (or is the bottom-most row) in the final arrangement, respectively. The next two constraints ensure that only one top-most (source) row and only one bottom-most (sink) row should be assigned in the final matrix.

$$\sum _{i}y\text{\_}sourc{e}_{i}^{row}}=1$$

(7)

$$\sum _{i}y\text{\_}sin{k}_{i}^{row}}=1$$

(8)

The set of constraints defined by Eqs. 5 through 8 are sufficient for assigning unique neighbors to every row. However, *cyclic *arrangements of the rows also satisfy these constraint equations (i.e., it is possible to have ${y}_{i,{i}^{\prime}}^{row}={y}_{{i}^{\prime},{i}^{\u2033}}^{row}={y}_{{i}^{\u2033},i}^{row}=10$, which results in a cyclic final ordering of *i*, *i'*, *i"*, *i*, ... etc.) To ensure that the final arrangement of the rows is acyclic, unique flow values are assigned to each edge, ${y}_{i,{i}^{\prime}}^{row}$, that connects rows *i *and *i'*. The value for the flow entering the source row (or top-most row) is defined to be the total number of rows (|*I*|) to indicate that this is the top-most row in the final arrangement.

$$\begin{array}{cc}f\text{\_}sourc{e}_{i}^{row}=\left|I\right|\cdot y\text{\_}sourc{e}_{i}^{row}& \forall i\end{array}$$

(9)

Note that the above constraint, in conjunction with Eq. 7, ensures that only one source flow is assigned to an edge. Starting from this source row, each subsequent row in the final arrangement will have an entering flow value of |*I*| - 1, |*I*| - 2, and so on. This cascading property of the flow values will ensure a unique final ordering of the rows and eliminate cyclic arrangements. A flow conservation equation is used to model this cascading of the flows by requiring that the flow entering a row is exactly one unit greater than the flow leaving that row.

$$\begin{array}{c}{\displaystyle \sum _{{i}^{\prime}}({f}_{{i}^{\prime},i}^{row}-{f}_{i,{i}^{\prime}}^{row})+f\text{\_}sourc{e}_{i}^{row}}\\ \begin{array}{cc}-f\text{\_}sin{k}_{i}^{row}=1& \forall i\end{array}\end{array}$$

(10)

Since we have defined the convention that $f\text{\_}sourc{e}_{i}^{row}$ starts at |*I*|, then $f\text{\_}sin{k}_{i}^{row}$ has a flow value of *zero *and thus can be eliminated from the above constraint.

Lastly, we can assign general upper and lower bounds for all flow values since a flow connecting two rows *i *and *i' *(i.e., ${y}_{i,{i}^{\prime}}^{row}$ = 1) can never be greater than |*I*| - 1 nor less than 1.

$$\begin{array}{cc}{f}_{i,{i}^{\prime}}^{row}\le (|I|-1)\cdot {y}_{i,{i}^{\prime}}^{row}& \forall (i,{i}^{\prime})\end{array}$$

(11)

$$\begin{array}{cc}{f}_{i,{i}^{\prime}}^{row}\ge {y}_{i,{i}^{\prime}}^{row}& \forall (i,{i}^{\prime})\end{array}$$

(12)

These constraint equations also ensure that if rows *i *and *i' *are not connected by an edge (i.e., ${y}_{i,{i}^{\prime}}^{row}$ = 0) then no flow is assigned (${f}_{i,{i}^{\prime}}^{row}$ = 0). The set of constraint equations (5)–(12) comprise the entire mathematical model necessary for performing the row and column permutations, which are guided by any of the aforementioned objective functions.

The re-ordering of the rows and columns can also be modeled as a traveling salesman problem (TSP), which is one of the most well-studied problems in the area of combinatorial optimization. The problem objective is to visit a list of *N *cities and return to the starting city via the minimum cost route (often referred to as the optimal tour). Finding the best tour and guaranteeing its optimality remains challenging for large-scale problems. It has been pointed out that the row and column re-ordering problems can be solved as two independent traveling salesman problems [58].

In the TSP formulation, each row in the matrix is a vertex, *i * |*I*|. The existence of an edge between rows *i *and *i' *is again represented by the binary variable ${y}_{i,{i}^{\prime}}^{row}$. For each edge there is an associated cost, *c*_{i, i' }of "traveling" from row *i *to *i'. *Thus, the objective of the problem is to visit each row in the matrix only once via these edges while incurring the minimum total cost and the order in which these rows are visited denotes their final positions in the matrix. The problem definition requires that the tour start and end at the same row, so we introduce a dummy city to connect the top-most and bottom-most row in the final arrangement with edges that have zero cost. A formal definition of the problem is provided below.

$$\mathrm{min}{\displaystyle \sum _{i,{i}^{\prime}}{c}_{i,{i}^{\prime}}\cdot {y}_{i,{i}^{\prime}}^{row}}$$

(13)

$$\begin{array}{cc}{\displaystyle \sum _{{i}^{\prime}}{y}_{i,{i}^{\prime}}^{row}=1}& \forall i\end{array}$$

(14)

$$\begin{array}{cc}{\displaystyle \sum _{{i}^{\prime}}{y}_{{i}^{\prime},i}^{row}=1}& \forall i\end{array}$$

(15)

The cost associated with traversing an edge, *c*_{i, i'}, is computed using the aforementioned objective functions. As in the network flow model, cyclic tours satisfy Eqs. 14 and 15, thus additional constraints are required to eliminate these *subtours*. These constraints are efficiently incorporated into TSP solvers, such as Concorde [59], via cutting plane methods and are beyond the scope of this paper so will not be discussed here.

Although the idea of traveling implies moving from one row to the next, if the cost of traveling in either direction is the same for any row, then the problem is symmetric and only *undirected *edges between rows need to be considered. However, the objective functions that incorporate monotonicity violations are by definition asymmetric and require an asymmetric TSP formulation. The asymmetric traveling salesman problem can be recast as a symmetric traveling salesman problem by introducing a duplicate set of N rows and restricting the overall connectivity of edges. The details of how to perform such a transformation have been described elsewhere [60,61] and will not be presented here.

The algorithm begins by optimally re-ordering a single dimension of the data matrix. Let us denote the dimension that is re-ordered as the columns and the dimension that is not re-ordered as the rows of the data matrix. For instance, in gene expression data the columns would correspond to the time series or set of conditions over which the expression level for the genes of interest (i.e., the rows) were measured. The objective function value for each pair-wise term between neighboring columns in the final ordering is evaluated and the median of these values is computed. That is, for each column *j *and *j *+ 1 in the *final *ordering, the median of each pairwise term of the objective function, *ϕ*(*a*_{i,j}, *a*_{i,j+1}), is computed, as shown in Eq. 16.

(16)

The median was selected as the evaluating metric since it is statistically less biased to outliers than the average. Cluster boundaries are defined to lie between those columns which have the *largest *median values (since the objective function is being minimized). In other words, the median is computed for all pairs *j *and *j *+ 1 in the final ordering and the top 10 percent of largest median values are selected as boundaries between the re-ordered columns. These cluster boundaries are used to partition the original matrix into several submatrices. The rows of each submatrix are then optimally re-ordered over their subset of columns and clusters in this dimension are again defined using the median value of the objective function between neighboring rows in the final ordering. The algorithmic steps for the iterative framework are presented below:

1. Optimally re-order a single dimension of the data matrix. This re-ordered dimension will be denoted as the columns.

2. Compute the median for each pair of neighboring columns in the final ordering using Eq. 16. Sort these values from highest to lowest; the largest median values define the cluster boundaries between the columns. Submatrices are defined by the columns that lie between these cluster boundaries.

3. Optimally re-order the rows of each submatrix and compute the cluster boundaries for the re-ordered rows analogous to step 2.

PAD, CAF, and SRM developed and implemented the proposed mathematical models, conducted the numerical experiments and subsequent analysis, and drafted the manuscript. XJF, JDR, and HAR participated in the design of the study, interpretation of data, and helped to draft and revise the manuscript. All authors read and approved the final manuscript.

**This additional file contains all of the additional figures and results referenced in the article**.

Click here for file^{(1.3M, pdf)}

**This text file contains the results for the biclustering algorithms Cheng and Church's, ISA, OPSM, BiMax, xMotif, and SAMBA for the Alon et. al colon cancer data set**.

Click here for file^{(94K, txt)}

**This Excel spreadsheet contains the complete ontology results for all biclustering algorithms using Onto-Express for the Alon et al. and van't Veer cancer data sets**.

Click here for file^{(36K, xls)}

**This text file contains the results for the biclustering algorithms Cheng and Church's, ISA, OPSM, BiMax, xMotif, and SAMBA for the van't Veer et al. breast cancer data set**.

Click here for file^{(203K, txt)}

**This text file contains the corresponding clusters for OREO described in the article for the Eisen et al. budding yeast data set (described in Additional file**1**).**

Click here for file^{(12K, txt)}

The authors gratefully acknowledge funding from the US Environmental Protection Agency (GAD R 832721-010) and C.A.F. gratefully acknowledges financial support from the National Science Foundation. Although the research described in the article has been funded in part by the U.S. Environmental Protection Agency's STAR program through grant (R 832721-010), it has not been subjected to any EPA review and therefore does not necessarily reflect the views of the Agency, and no official endorsement should be inferred. Special thanks to Chad Myers for providing the curated set of biological processes and helpful discussions during the preparation of this manuscript.

- Anderberg MR. Cluster Analysis for Applications. New York, NY: Academic Press; 1973.
- Jain AK, Flynn PJ. Image segmentation using clustering. In: Ahuja N, Bowyer K, Piscataway NJ, editor. Advances in Image Understanding: A Festschrift for Azriel Rosenfeld. IEEE Press; 1996. pp. 65–83.
- Salton G. Developments in automatic text retrieval. Science. 1991;253:974–980. doi: 10.1126/science.253.5023.974. [PubMed] [Cross Ref]
- Eisen MB, Spellman PT, Brown PO, Botstein D. Cluster analysis and display of genome-wide expression patterns. Proc Natl Acad Sci. 1998;95:14863–14868. doi: 10.1073/pnas.95.25.14863. [PubMed] [Cross Ref]
- Zhang Y, Skolnick J. SPICKER: A clustering approach to identify near-native protein folds. Journal of Computational Chemistry. 2004;25:865–871. doi: 10.1002/jcc.20011. [PubMed] [Cross Ref]
- Monnigmann M, Floudas CA. Protein Loop Structure Prediction With Flexible Stem Geometries. Protein: Structure, Function, and Bioinformatics. 2005;61:748–762. doi: 10.1002/prot.20669. [PubMed] [Cross Ref]
- Hartigan JA, Wong MA. Algorithm AS 136: a K-means clustering algorithm. Applied Statistics. 1979;28:100–108. doi: 10.2307/2346830. [Cross Ref]
- Sherali HD, Desai J. A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem. J Glo Opt. 2005;32:281–306. doi: 10.1007/s10898-004-2706-7. [Cross Ref]
- Sherali HD, Desai J. A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem. J Glo Opt. 2005;33:597–615. doi: 10.1007/s10898-004-7390-0. [Cross Ref]
- Bar-Joseph Z, Demaine E, Gifford D, Srebro N, Hamel A, Jaakola T. K-ary clustering with optimal leaf ordering for gene expression data. Bioinformatics. 2003;19:1070–1078. doi: 10.1093/bioinformatics/btg030. [PubMed] [Cross Ref]
- Edwards AWF, Cavalli-Sforza LL. A method for cluster analysis. Biometrics. 1965;21:362–375. doi: 10.2307/2528096. [PubMed] [Cross Ref]
- Wolfe JH. Pattern clustering by multivariate mixture analysis. Multivariate Behavioral Research. 1970;5:329–350. doi: 10.1207/s15327906mbr0503_6. [Cross Ref]
- Jain AK, Mao J. Artificial neural networks: a tutorial. IEEE Computer. 1996;29:31–44.
- Klein RW, Dubes RC. Experiments in projection and clustering by simulated annealing. Pattern Recognition. 1989;22:213–220. doi: 10.1016/0031-3203(89)90067-8. [Cross Ref]
- Raghavan VV, Birchand K. A clustering strategy based on a formalism of the reproductive process in a natural system. Proceedings of the Second International Conference on Information Storage and Retrieval. 1979. pp. 10–22.
- Bhuyan JN, Raghavan VV, Venkatesh KE. Genetic algorithm for clustering with an ordered representation. Proceedings of the Fourth International Conference on Genetic Algorithms. 1991. pp. 408–415.
- Slonim N, Atwal G, Tkacik G, Bialek W. Information-based clustering. Proc Natl Acad Sci. 2005;102:18297–18302. doi: 10.1073/pnas.0507432102. [PubMed] [Cross Ref]
- Tan M, Broach J, Floudas C. A Novel Clustering Approach and Prediction of Optimal Number of Clusters: Global Optimum Search with Enhanced Positioning. J Glo Opt. 2007;39:323–346. doi: 10.1007/s10898-007-9140-6. [Cross Ref]
- Tan M, Broach J, Floudas C. Evaluation of Normalization and Pre-Clustering Issues in a Novel Clustering Approach: Global Optimum Search with Enhanced Positioning. J Bioin Comp Bio. 2007;5:895–913. doi: 10.1142/S0219720007002941. [PubMed] [Cross Ref]
- Tan M, Smith E, Broach J, Floudas C. Microarray data mining: a novel optimization-based approach to uncover biologically coherent structures. BMC Bioinformatics. 2008;9:268–283. doi: 10.1186/1471-2105-9-268. [PMC free article] [PubMed] [Cross Ref]
- Busygin S, Prokopyev O, Pardalos P. An optimization based approach for data classification. Opt Meth Soft. 2007;22:3–9. doi: 10.1080/10556780600881639. [Cross Ref]
- Pardalos P, Boginski V, Vazakopoulos A. Data mining in biomedicine. Springer; 2007.
- Jr WM, Schweitzer P, White T. Problem Decomposition and Data Reorganization by a Clustering Technique. Operations Research. 1972;20:993–1009. doi: 10.1287/opre.20.5.993. [Cross Ref]
- Lenstra J. Clustering a Data Array and the Traveling-Salesman Problem. Operations Research. 1974;22:413–414. doi: 10.1287/opre.22.2.413. [Cross Ref]
- Lenstra J, Kan AR. Some Simple Applications of the Traveling-Salesman Problem. Operations Research Quarterly. 1975;26:717–733.
- Turner H, Bailey T, Krzanowski W, Hemingway C. Biclustering models for structured microarray data. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2005;2:316–329. doi: 10.1109/TCBB.2005.49. [PubMed] [Cross Ref]
- Cheng Y, Church G. Biclustering of expression data. Proc ISMB 2000. 2000. pp. 93–103. [PubMed]
- Reiss D, Baliga N, Bonneau R. Integrated biclustering of heterogeneous genome-wide datasets for the inference of global regulatory networks. BMC Bioinformatics. 2006;7:280–302. doi: 10.1186/1471-2105-7-280. [PMC free article] [PubMed] [Cross Ref]
- Kluger Y, Basri R, Chang J, Gerstein M. Spectral Biclustering of Microarray Data: Coclustering Genes and Conditions. Genome Research. 2003;13:703–716. doi: 10.1101/gr.648603. [PubMed] [Cross Ref]
- Carmona-Saez P, Pasqual-Marqui R, Tirado F, Carazo J, Pascual-Montano A. Biclustering of gene expression data by non-smooth non-negative matrix factorization. BMC Bioinformatics. 2006;7:78–96. doi: 10.1186/1471-2105-7-78. [PMC free article] [PubMed] [Cross Ref]
- Ben-Dor A, Chor B, Karp R, Yakhini Z. Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. J Comput Biol. 2003;10:373–384. doi: 10.1089/10665270360688075. [PubMed] [Cross Ref]
- Prelic A, Bleuler S, Zimmermann P, Wille A, Buhlmann P, Gruissem W, Hennig L, Thiele L, Zitzler E. A systematic comparison and evaluation of biclustering methods for gene expression data. Bioinformatics. 2006;22:1122–1129. doi: 10.1093/bioinformatics/btl060. [PubMed] [Cross Ref]
- Tanay A, Sharan R, Shamir R. Discovering statistically significant biclusters in gene expression data. Bioinformatics. 2002;18:S136–S144. [PubMed]
- Yoon S, Nardini C, Benini L, Micheli GD. Discovering Coherent Biclusters from Gene Expression Data Using Zero-Suppressed Binary Decision Diagrams. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2005;2:339–354. doi: 10.1109/TCBB.2005.55. [PubMed] [Cross Ref]
- Bleuler S, Prelic A, Zitzler E. An EA framework for biclustering of gene expression data. IEEE Congress on Evolutionary Computation. 2004. pp. 166–173.
- Divina F, Aguilar J. Biclustering of expression data with evolutionary computation. IEEE Transactions on Knowledge and Data Engineering. 2006;18:590–602. doi: 10.1109/TKDE.2006.74. [Cross Ref]
- Busygin S, Prokopyev O, Pardalos P. Feature Selection for Consistent Biclustering via Fractional 0–1 Programming. J Comb Opt. 2005;10:7–21. doi: 10.1007/s10878-005-1856-y. [Cross Ref]
- Madeira SC, Oliveira A. Biclustering Algorithms for Biological Data Analysis: A Survey. IEE-ACM Trans Comp Bio. 2004;1:24–45. doi: 10.1109/TCBB.2004.2. [PubMed] [Cross Ref]
- Brauer MJ, Yuan J, Bennett B, Lu W, Kimball E, Bostein D, Rabinowitz J. Conservation of the metabolomic response to starvation across two divergent microbes. Proc Natl Acad Sci. 2006;103:19302–19307. doi: 10.1073/pnas.0609508103. [PubMed] [Cross Ref]
- CPLEX ILOG CPLEX 90 User's Manual. 2005.
- Bar-Joseph Z, Biedl T, Brejova B, Demaine E, Gifford D, Hamel A, Jaakola T, Srebro N, Vinar T. Tech Rep 14. Department of Computer Science, University of Waterloo; 2001. Optimal arrangement of leaves in the tree representing hierarchical clustering of gene expression data.
- Grothaus G, Mufti A, Murali T. Automatic layout and visualization of biclusters. Algorithms for Molecular Biology. 2006;1:1–15. doi: 10.1186/1748-7188-1-15. [PMC free article] [PubMed] [Cross Ref]
- Moscato P, Mendes A, Berretta R. Benchmarking a Memetic algorithm for ordering microarray data. Biosystems. 2007;88:56–75. doi: 10.1016/j.biosystems.2006.04.005. [PubMed] [Cross Ref]
- Alon U, Barkai N, Notterman D, Gish K, Ybarra S, Mack D, Levine A. Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Proc Natl Acad Sci. 1999;96:6745–6750. doi: 10.1073/pnas.96.12.6745. [PubMed] [Cross Ref]
- Rose K. Deterministic annealing for clustering, compression, classification, regression, and related optimization. Proc IEEE. 1998;11:2210–2239. doi: 10.1109/5.726788. [Cross Ref]
- Getz G, Levine E, Domany E. Coupled two-way clustering analysis of gene microarray data. Proc Natl Acad Sci. 2000;97:12079–12084. doi: 10.1073/pnas.210134797. [PubMed] [Cross Ref]
- Draghici S, Khatri P, Bhavsar P, Shah A, Krawetz S, Tainsky M. Onto-Tools, the toolkit of the modern biologist: Onto-Express, Onto-Compare, Onto-Design, and Onto-Translate. Nuc Acids Res. 2003;31:3775–3781. doi: 10.1093/nar/gkg624. [PMC free article] [PubMed] [Cross Ref]
- van't Veer L, Dai H, Vijver M, He Y, Hart A, Mao M, Peterse H, Kooy K van der, Marton M, Witteveen A, Schreiber G, Kerkhoven R, Roberts C, Linsley P, Bernards R, Friend S. Gene expression profiling predicts clinical outcome of breast cancer. Nature. 2002;415:530–536. doi: 10.1038/415530a. [PubMed] [Cross Ref]
- Troyanskaya O, Cantor M, Sherlock G, Brown P, Hastie T, Tibshirani R, Botstein D, Altman R. Missing value estimation methods for DNA microarrays. Bioinformatics. 2001;17:520–525. doi: 10.1093/bioinformatics/17.6.520. [PubMed] [Cross Ref]
- Brem R, Kruglyak L. The landscape of genetic complexity across 5,700 gene expression traits in yeast. Proc Natl Acad Sci. 2005;102:1572–1577. doi: 10.1073/pnas.0408709102. [PubMed] [Cross Ref]
- Reguly T, Breitkreutz A, Boucher L, Breitkreutz B, Hon G, Myers C, Parsons A, Friesen H, Oughtred R, Tong A, Ho Y, Botstein D, Andrews B, Boone C, Troyanskya O, Ideker T, Dolinski K, Batada N, Tyers M. Comprehensive Curation and Analysis of Global Interaction Networks in Saccharomyces cerevisiae. J Biol. 2006;5:11. doi: 10.1186/jbiol36. [PMC free article] [PubMed] [Cross Ref]
- Ford L, Fulkerson D. Flows in Networks. Princeton University Press; 1962.
- Floudas C, Grossmann I. Synthesis of flexible heat exchanger networks with uncertain flowrates and temperatures. Comp and Chem Eng. 1987;11:319–336. doi: 10.1016/0098-1354(87)85014-7. [Cross Ref]
- Ciric A, Floudas C. A retrofit approach for heat-exchanger networks. Comp and Chem Eng. 1989;13:703–715. doi: 10.1016/0098-1354(89)80008-0. [Cross Ref]
- Floudas C, Anastasiadis S. Synthesis of Distillation Sequences with Several Multicomponent Feed and Product Streams. Chem Eng Sci. 1988;43:2407–2419. doi: 10.1016/0009-2509(88)85175-3. [Cross Ref]
- Kokossis A, Floudas C. Optimization of complex reactor networks-II: nonisothermal operation. Chem Eng Sci. 1994;49:1037–1051. doi: 10.1016/0009-2509(94)80010-3. [Cross Ref]
- Aggarwal A, Floudas C. Synthesis of general separation sequences – nonsharp separations. Comp and Chem Eng. 1990;14:631–653. doi: 10.1016/0098-1354(90)87033-L. [Cross Ref]
- Climer S, Zhang W. Rearrangement Clustering: Pitfalls, Remedies, and Applications. J Machine Learning Res. 2006;7:919–943.
- Applegate D, Bixby R, Chvatal V, Cook W. The traveling salesman problem: A computational study. Princeton, NJ: Princeton University Press; 2007.
- Jonker R, Volgenant T. Transforming asymmetric into symmetric traveling salesman problems. Operations Research Letters. 1983;2:161–163. doi: 10.1016/0167-6377(83)90048-2. [Cross Ref]
- Jonker R, Volgenant T. Transforming asymmetric into symmetric traveling salesman problems: erratum. Operations Research Letters. 1986;5:215–216. doi: 10.1016/0167-6377(86)90081-7. [Cross Ref]

Articles from BMC Bioinformatics are provided here courtesy of **BioMed Central**

PubMed Central Canada is a service of the Canadian Institutes of Health Research (CIHR) working in partnership with the National Research Council's national science library in cooperation with the National Center for Biotechnology Information at the U.S. National Library of Medicine(NCBI/NLM). It includes content provided to the PubMed Central International archive by participating publishers. |