 Proceedings
 Open Access
 Published:
Patterndriven neighborhood search for biclustering of microarray data
BMC Bioinformatics volume 13, Article number: S11 (2012)
Abstract
Background
Biclustering aims at finding subgroups of genes that show highly correlated behaviors across a subgroup of conditions. Biclustering is a very useful tool for mining microarray data and has various practical applications. From a computational point of view, biclustering is a highly combinatorial search problem and can be solved with optimization methods.
Results
We describe a stochastic patterndriven neighborhood search algorithm for the biclustering problem. Starting from an initial bicluster, the proposed method improves progressively the quality of the bicluster by adjusting some genes and conditions. The adjustments are based on the quality of each gene and condition with respect to the bicluster and the initial data matrix. The performance of the method was evaluated on two wellknown microarray datasets (Yeast cell cycle and Saccharomyces cerevisiae), showing that it is able to obtain statistically and biologically significant biclusters. The proposed method was also compared with six reference methods from the literature.
Conclusions
The proposed method is computationally fast and can be applied to discover significant biclusters. It can also used to effectively improve the quality of existing biclusters provided by other biclustering methods.
Background
The DNA microarray technology permits to monitor and to measure gene expression levels for 10s of 1000s of genes simultaneously in a cell mixture in a single experiment under diverse experimental conditions. DNA microarray data are typically represented by a large matrix where each row contains the gene expression levels under specific conditions (columns). Since its invention, this technology has found many applications in biological and medical research. For instance, it is being used in cancer studies to better understand the biological mechanisms underlying oncogenesis, to discover new targets and new drugs, and to develop predictors for tailoring individualized treatments [1–3].
Microarray data analysis is a critical step in practical applications and often achieved with the help of data mining techniques [4]. Microarray data analysis can be performed according to at least two different and complementary approaches [1–3]. The first approach is based on supervised classification (also called class prediction or class discrimination). This generally involves selecting predictive genes to build a classifier that can be used to predict the outcome of new samples based on their expression profiles. Various methods based on this approach have been proposed in the literature and examples can be found in [5–15].
Another general approach for microarray data analysis relies on nonsupervised classification (or clustering) methods. These cluster analysis methods try to identify groups of genes, or/and groups of conditions (samples), that exhibit similar expression patterns [16–20]. In the context of cluster analysis, biclustering is a particularly interesting approach which aims to identify simultaneously groups of genes and conditions (called biclusters) such that the genes of a bicluster show similar expression patterns across the selected conditions [21–23]. Formally, given a gene expression data matrix M(I, J) with gene index i ∈ I={1, 2,..., n} and condition index j ∈ J={1, 2,..., m} (n >>m), a bicluster M(I', J') is a group of genes associated with a group of conditions such that I' ⊆ I and J' ⊆J. This paper focuses on finding meaningful biclusters for a given microarray dataset.
From a computational point of view, the biclustering problem is a highly combinatorial search problem and known to be NPhard [22, 24]. A number of heuristic search algorithms have been proposed and some recent reviews can be found in [22, 25, 26]. Generally, existing biclustering algorithms belong to one of the following approaches.

1.
Greedy iterative search approach: Greedy biclustering algorithms build a solution by starting from the initial data matrix (or a transformed matrix) and iteratively remove bad genes/conditions according to a quality criterion. For instance, the algorithm presented in [27] (called Maximum Similarity Biclusters) starts by constructing a similarity matrix based on a reference gene. A greedy strategy is then iteratively applied to remove genes/conditions such that a maximum similarity is achieved in the remaining matrix (bicluster). Greedy algorithms can also proceed by extending greedily an initially empty bicluster. Examples of greedy biclustering algorithms can be found in [27–30]. They differ essentially in the way genes/conditions are added/removed. Greedy algorithms are computationally fast, but the quality of the biclusters found may be mediocre.

2.
Biclusters enumeration approach: This approach tries to enumerate (implicitly) all the biclusters. The enumeration process is often represented by a search tree. During the construction of the search tree, some nodes are closed as soon as some pruning conditions are fulfilled. For instance, in [31], the authors propose the CETree algorithm which builds its tree of biclusters by applying a special local breadthfirst within a global depthfirst search strategy in combination of exploring Maximum Dimension Sets for each pair of conditions. Representative examples of algorithms adopting this enumeration approach are given in [23, 29, 32–34]. This approach has the advantage of achieving high quality solutions. However, algorithms using this approach are expensive in computing time and memory space.

3.
Stochastic search approach: This approach can be further divided into neighborhood search and evolutionary search. For neighborhood search, one begins with an initial candidate solution (bicluster) and improves iteratively its quality by replacing the bicluster with a neighboring bicluster. The neighboring bicluster is typically obtained by replacing a gene/condition by a better one. Cheng and Church [24] are probably the first to apply this approach to the biclustering problem. They employ the Mean Squared Residue (MSR) to measure the goodness of genes and conditions and to decide which genes/conditions are to be removed/added. Other biclustering algorithms based on local search are presented in [24, 35–38]. Populationbased evolutionary search generalizes neighborhood search by operating on a pool of candidate solutions. Candidate solutions are improved with operators like crossover and mutation. Examples of evolutionary biclustering algorithms can be found in [39–42].
In this paper we introduce a stochastic neighborhood search algorithm called PatternDriven Neighborhood Search (PDNS) for the biclustering problem. PDNS is based on a solution representation encoded as a behavior matrix and a dedicated neighborhood taking into account various patterns information. It also employs fast greedy algorithms to generate diversified initial biclusters of reasonable quality and a randomized perturbation strategy.
Method
Preprocessing of gene expression matrix
Prior to the search by PDNS, our method first applies a preprocessing step to transform the input data matrix M to a Behavior Matrix M'. This preprocessing step aims to highlight the trajectory patterns of genes. Indeed, according to [43–45], in microarray data analysis, genes are considered to be in the same cluster if their trajectory patterns of expression levels are similar across a set of conditions. Within the transformed matrix M', each row represents the trajectory pattern of a gene across all the combined conditions while each column represents the trajectory pattern of all the genes under a pair of particular conditions in the data matrix M. The whole matrix M' provides thus useful information for the identification of relevant biclusters and the definition of a meaningful neighborhood of a local search algorithm.
Formally, the behavior matrix M' is constructed progressively by merging a pair of columns (conditions) from the input data matrix M. Since M has n rows and m columns, there is m(m−1)/2 distinct combinations between columns, represented by J''. So, M' has n rows and m(m−1)/2 columns. M' is defined as follows:
with i ∈ [1..n], l ∈ [1..J''], k ∈ [1..m 1], q ∈ [2..m] and q ≥ k + 1.
Figure 1 shows an illustrative example. We can observe, by considering each row of M', the trajectory (or behavior) pattern of each gene through all the combined conditions, i.e., up (1), down (1) and no change (0), of all rows (genes) over combined columns (combined conditions). Similarly, the combinations of all the paired conditions give useful information since a bicluster may be composed of a subset of non contiguous conditions. Our PDNS algorithm uses M' to define its search space as well as its neighborhood that is critical for the search process.
Patterndriven neighborhood search for biclustering  general procedure
Our proposed PDNS method can be considered as an Iterated Local Search procedure [46]. It alternates between two basic components: a descentbased improvement procedure and a perturbation operator. PDNS uses the descent procedure to discover locally optimal solutions and the perturbation operator to displace the search to a new starting point in an unexplored search region.
The key originality of PDNS concerns the use of bicluster pattern both in its search space and neighborhood definition. The bicluster pattern is a characteristic representation of a bicluster. It is used to evaluate genes/conditions of bicluster. This representation is defined by the behavior matrix of the bicluster, i.e., the trajectory patterns of the genes under all combined conditions of the bicluster. This representation is important because it is well recognized that in microarray data, genes are considered to belong to the same cluster if they have similar trajectory patterns of expression levels [43–45, 47].
Starting from an initial bicluster (call it current solution s), PDNS uses the descent strategy to explore the patternbased neighborhood and moves to an improving neighboring solution at each iteration. By using the bicluster pattern, we define a set of rules which allow us to qualify the goodness (or badness) of a gene and condition. Using these rules (explained in a later section "Neighborhood and its exploration"), PDNS iteratively replaces within the current bicluster bad genes/conditions by good ones, thus progressively improves the quality of the bicluster under consideration. This iterative improvement procedure stops when the last bicluster attains a fixed quality threshold according to the ASR evaluation function (see next section) or when a fixed number Y of iterations is reached. At this point, PDNS triggers a perturbation phase by replacing randomly 10% of genes and conditions of the recorded best bicluster found so far. This perturbed bicluster is used as a new starting point for the next round of the descent search.
The whole PDNS algorithm stops when the best bicluster is not updated for a fixed number Z of perturbations. The general PDNS procedure is described in Figure 2. We describe in the following sections the ingredients of PDNS.
The ASR evaluation function
Many functions exist for bicluster evaluation. One of the most popular evaluation functions is the Mean Squared Residue (MSR) [24]. It has been used by several biclustering algorithms [33, 38, 42, 48–51]. However, MSR is deficient to assess correctly the quality of certain types of biclusters like multiplicative models [30, 33, 52, 53].
In this paper, we use the Average Spearman's Rho (ASR) function which avoids the drawback of MSR [54]. Let (I', J') be a bicluster in a data matrix M(I, J), the ASR evaluation function is then defined by:
where ρ_{ ij } (i ≠ j) is the Spearman's rank correlation [55] associated with the row indices i and j in the bicluster (I', J'), ρ_{ kl } (k ≠ l) is the Spearman's rank correlation associated with the column indices k and l in the bicluster (I', J'). According to this definition, ASR(I', J') ∈[1..1].
A high (resp. low) ASR value, close to 1 (resp. close to 1), indicates that the genes/conditions of the bicluster are strongly (resp. weakly) correlated.
Let us notice that the existing evaluation functions can roughly be classified into two families: numerical measures and qualitative measures. Numerical measures, like Pearson's correlation or Euclidean distance, are easy to compute but they are quite sensitive toward outliers and noise. Qualitative measures, like measures that consider only ups, downs and no change of conditions, are very sensitive to precise the values of changes. As ASR is based on Spearman's rank correlation it can be considered as a good compromise between numerical and qualitative measures.
Configuration representation
PDNS uses a solution representation based on the behavior matrix M' obtained from the preprocessing step described previously. More precisely, given a bicluster B = (I', J'), we encode the bicluster by its behaviour matrix s = (I',K) which is the submatrix of M' including only the set of genes in I' and all the combinations of paired conditions in J' (see example of Figure 1). It is clear that s has the same rows as B, its number K of columns is equal to J'(J'  1). In the rest of this paper, s is called a configuration (or solution). As it is shown below in Section "Neighborhood and its exploration", such a configuration representation enables the definition of dedicated move operators to improve progressively the quality of the generated biclusters.
Initial solution
Our algorithm needs an initial bicluster to start its search. The initial bicluster can be provided by any means. For instance, this can be done randomly with a risk of starting with an initial solution of bad quality. A more interesting strategy is to employ a fast greedy algorithm to obtain rapidly a bicluster of reasonable quality. We use this strategy in this work and adopt two wellknown algorithms: one is presented by Cheng and Church [24] and the other is called OPSM which is introduced in [29]. As explained above, each initial bicluster is encoded into its behavior matrix before being improved by PDNS.
Neighborhood and its exploration
The neighborhood is one of the most critical elements of any local search algorithm. The neighborhood can be defined by a move operator. Given a solution s, let mv be the move operator that can be applied to s. Then each application of mv transforms s into a new solution s'. This is typically denoted by s' ← s ⊕mv.
In this paper, we devise two specially designed move operators operating respectively on rows (genes) and columns (combinations of pairwise conditions) of a given solution. Both operators are based on the general drop/add operation which removes some elements and adds new elements in the given solution. The critical issue here is the criterion that is employed to determine the elements to be removed and added. In our case, this decision is based on the "behavior pattern".
Our first move operator, denoted by mv_{ g }, performs changes by removing a number of rows (genes) of the bicluster and adding other genes in order to obtain more coherent biclusters. Let s = (I', K) be a solution, we first extract from the behavior matrix M' the associated submatrix ${\stackrel{\u0304}{M}}^{\prime}$. Let R and C denote respectively the index set of rows and columns of ${\stackrel{\u0304}{M}}^{\prime}$. From ${\stackrel{\u0304}{M}}^{\prime}$ we build the bicluster pattern P of s which is defined by a vector indexed by C. P[j], j ∈ C, takes the dominating value k ∈ {1, 0, 1} such that k has the highest appearances in the column i of ${\stackrel{\u0304}{M}}^{\prime}$ (see example of Figure 3).
Now for each gene g_{ i }, i ∈ R of the solution s, we define the quality of g_{ i } as the percentage of concordances between the behavior pattern of g and the behavior pattern P of bicluster s. Let α be a fixed quality threshold of genes. Let D denote the set of bad genes of s such that their quality does not reach the quality threshold fixed by α. Let G denote the set of good genes missing from s such that their quality surpasses the quality threshold α. Then our first move operator mv_{ g } removes from s all the bad genes of D and adds a number of genes selected from G.
Figure 3 shows an example where one bad gene (g_{ 4 }) is deleted and one good gene (g_{ 10 }) is added. g_{ 4 } is bad because its behavior pattern has a low concordance with the bicluster behavior pattern (only 50% which is inferior than the quality threshold α = 70%). Similarly, g_{ 10 } is good because its quality (83%) is higher than α. This replacement increases thus the coherence of the resulting bicluster. In the general case, the number of deleted gene may differ from the number of added genes. Notice that this move operator does not change the columns of the solution.
Our second move operator, denoted by mv_{ c }, performs changes by removing a number of columns (combined conditions) and adding other columns in order to obtain more coherent biclusters. Similar to the first move operator, mv_{ c } uses a quality threshold β for each column. The quality of each column is defined as the percentage of concordances between the column pattern and the value of this column in the bicluster pattern.
Then, when our second move operator mv_{ c } detects a bad condition from the current bicluster, we test if the dominating value of each condition of the current bicluster has the same value with the corresponding value in the bicluster pattern. If it is different, this condition is considered bad (and removed from the current bicluster). To add a good condition from the current bicluster, we select a condition under the same subset of genes from the "behavior matrix" M' which has a dominating value higher than a fixed threshold β. Notice that this move operator does not change the rows of the solution (see example of Figure 4). In the general case, the number of deleted columns may differ from the number of added columns at each application of this move operator.
For a given solution, our PDNS algorithm applies these two move operators to reach a local optimum s (with an ASR value higher than the fixed threshold_ASR threshold). This local optimum solution s is composed of a group of genes and columns, each column representing the trajectory pattern of two conditions across the group of genes. Among the combinations of conditions in s, some conditions may be combined with only a few other conditions. These conditions are in fact insignificant conditions for the extracted bicluster. For this reason, during the decoding process (transforming s into a bicluster B), we retain only conditions which are combined with at least 50% other selected conditions. For instance, if we have s = {(g_{ 1 }, g_{ 2 }, g_{ 3 }, g_{ 4 }); (c_{ 1 }c_{ 2 }, c_{ 1 }c_{ 3 }, c_{ 1 }c_{ 4 }, c_{ 2 }c_{ 3 })}, condition c_{ 4 } will not be kept in the final bicluster because it is not combined at least with 50% of the other conditions, i.e., c_{ 2 } and c_{ 3 }. The bicluster obtained is thus B = {(g_{ 1 }, g_{ 2 }, g_{ 3 }, g_{ 4 }); (c_{ 1 }, c_{ 2 }, c_{ 3 })}.
Results and discussion
Experimental protocol
We perform statistical and biological validations of the obtained biclusters and we evaluate our PDNS algorithm against the results of some prominent biclustering algorithms used by the community, namely, CC [24], OPSM [29], ISA [56] and Bimax [57]. For these reference methods, we use Biclustering Analysis Toolbox (BicAT) which is a recent software platform for clusteringbased data analysis that integrates all these biclustering algorithms [58]. We also compare our method with two additional methods (Samba [23] and RMSBE [27]).
For the experiments, we empirically fix α, β and threshold_ASR of the PDNS algorithm as follows. We experiment a number of combinations (typically several tens) and for each combination, we compute the pvalues of the obtained biclusters. We pick the combination with the lowest pvalue for the final experiment. For CC, OPSM, ISA and Bimax, the default values used in [27] are adopted for the Yeast CellCycle dataset. For all the other experiments, we report the results of the compared algorithms from their original papers. The PDNS algorithm was implemented in Java and run on a PC Intel Core 2 Duo T6400 with 2.0GHz CPU and 3.5Gb RAM.
Datasets and results
Saccharomyces Cerevisiae dataset
The Saccharomyces Cerevisiae dataset (available at http://www.tik.ethz.ch/sop/bimax/) [59] contains the expression levels of 2993 genes under 173 experimental conditions. For this experiment, the parameters of PDNS are experimentally set as follows: α = 0.8, β = 0.8, threshold_ASR = 0.7, Y =100 and Z=50. The average running time of PDNS to improve a bicluster was about 4 minutes.
The results of PDNS are compared against the reported scores of RMSBE, Bimax, OPSM, ISA, Samba and CC from [27, 57]. In order to evaluate the statistical significance of a bicluster, we determine whether the set of genes contained in the bicluster shows significant enrichment with respect to a specific Gene Ontology (GO). We use the webtool FuncAssociate (available at http://llama.mshri.on.ca/funcassociate/) [60] for this purpose. FuncAssociate computes the adjusted significance scores for each bicluster, i.e., adjusted pvalues (p = 5%, 1%, 0.5%, 0.1% and 0.001%) which is the onesided pvalue of the association between attribute and query resulting from Fisher's Exact Test. The best biclusters have an adjusted pvalue less than 0.001%.
Figure 5 presents different significant scores p for each algorithm over the percentage of total extracted biclusters. On the one hand, PDNS and RMSBE seem to outperform other algorithms. PDNS (resp. RMSBE) results show that 100% (resp. 98%) of discovered biclusters are statistically significant with p < 0.001%. On the other hand, apart from CC, other algorithms have reasonably good performance. In particular, the best of the other compared algorithms, OPSM, 87% of its biclusters has p < 0.001%. CC underperforms because it is unable to find coherent biclusters and its lack of robustness against noise.
Yeast CellCycle dataset
The Yeast CellCycle dataset (available at http://arep.med.harvard.edu/biclustering/) is described in [61]. This dataset is processed in [24] and publicly available from [62]. It contains the expression profiles of more than 6000 yeast genes measured at 17 conditions over two complete cell cycles. In our experiments we use 2884 genes selected by [24].
For this dataset, two criteria are used. First, we evaluate the statistical relevance of the extracted biclusters by computing the adjusted pvalue like as for the Saccharomyces Cerevisiae dataset. Second, we identify the biological annotations for the obtained biclusters. For this experiment, the parameters α, β, threshold_ASR, Y and Z of PDNS are set as follows: α=0.5, β =0.7, threshold_ASR =0.5, Y =100 and Z=50. The average running time of PDNS to improve a bicluster was about 2 minutes.
Statistical relevance
To evaluate the statistical relevance of PDNS, we use again the pvalues and apply the webtool FuncAssociate [60]. The results of PDNS are compared against CC, ISA, Bimax and OPSM. Figure 6 shows, for each significant score p (p = 5%, 1%, 0.5%, 0.1% and 0.001%) and for each compared algorithm, the percentage of the statistically significant biclusters extracted by the algorithm with the indicated pvalue. We observe that PDNS outperforms the other algorithms on this dataset. 100% of discovered biclusters of PDNS are statistically significant with p < 0.001%. However, the best of the compared algorithm (Bimax) has only a percentage of 64% for p < 0.001%.
Analysis of biological annotation enrichment of biclusters
To evaluate the biological significance of the obtained biclusters in terms of the associated biological processes, molecular functions and cellular components respectively, we use the Gene Ontology (GO) term finder GOTermFinder (available at http://db.yeastgenome.org/cgibin/GO/goTermFinder). Indeed, the GO project provides a controlled vocabulary to describe gene and gene product attributes in any organism, and it is a collaborative effort to address the need for consistent descriptions of gene products in different databases (cited from http://www.geneontology.org). GOTermFinder can find the significant shared GO terms for genes within the same bicluster.
Table 1 and Table 2 report the top GO terms shared by the biclusters of CC (id2_{ CC }, id9_{ CC }) and OPSM (id7_{ OPSM }, id10_{ OPSM }), and their improvement by PDNS (id2_{ PDNS }, id9_{ PDNS }, id7_{ PDNS }, id10_{ PDNS }), in terms of biological process, molecular function and cellular component. For each GO, we list only the most significant shared term with the smallest pvalue.
For the bicluster labeled id9_{ PDNS } (Table 1), the genes YCR005C, YHR037W, YLR304C, YNL037C, YNR001C and YOR136W are together involved in the glutamate biosynthetic process. Each GO term is associated with a tuple, for example glutamate biosynthetic process (10.2%, 8.62e08) indicates the cluster frequency and the statistical significance. The cluster frequency (10.2%) shows that out of 59 genes in the first bicluster 6 genes take part to this process, and the statistical significance is provided by a pvalue of 8.62e08. Furthermore, PDNS can improve all the biclusters of CC (resp. OPSM) and find biologically meaningful biclusters.
For the worst (resp. the best) biclusters obtained from CC, i.e, id9_{ CC } (resp. id2_{ CC }) and OPSM, i.e., id7_{ OPSM } (resp. id10_{ OPSM }), we verify whether the PDNS algorithm can improve these biclusters to obtain biclusters of more relevant biological significance. We observe that PDNS does improve the worst and the best biclusters of CC and OPSM. For the worst biclusters which have no biological significant ("unknown"), i.e., id9_{ CC } and id7_{ OPSM }, the improved biclusters obtained by PDNS (id9_{ PDNS } and id7_{ PDNS }) tend to be more statistically and biologically significant. Indeed, when a bicluster has a bad quality, PDNS can improve it by replacing the bad genes/conditions by the good ones. For the best biclusters, i.e., id2_{ CC } and id10_{ OPSM }, PDNS can also improve them (id2_{ PDNS } and id10_{ PDNS }) by improving the respective pvalue.
Conclusions
We have presented the patterndriven neighborhood search for the biclustering problem of microarray data. PDNS alternates between a descentbased intensification phase and a perturbation phase. By using a behavior matrix representation of solutions, the descent search procedure is guided by a patternbased neighbourhood which is defined by two move operators. These operators change respectively the rows and columns of the current solution according to the pattern information related to each row and each column of the current solution as well as the initial matrix. Perturbation is realized by changing randomly a percentage of rows and columns of the best recorded solution (an option would be to constraint the changes to some critical rows and columns).
The proposed algorithm has been assessed using two wellknown microarray datasets (Yeast CellCycle and Saccharomyces Cerevisiae). The experimental study showed competitive results of PDNS in comparison with other popular biclustering algorithms by providing statistically and biologically significant biclusters. PDNS is a computationally effective method and can also be used to improve biclusters obtained by other methods.
References
 1.
Butte A: The use and analysis of microarray data. Nat Rev Drug Discov 2002, 1: 951–960. 10.1038/nrd961
 2.
Dupuy A, Simon RM: Critical review of published microarray studies for cancer outcome and guidelines on statistical analysis and reporting. J Natl Cancer Inst 2007, 99(2):147–157. 10.1093/jnci/djk018
 3.
Stoughton RB: Applications of DNA microarrays in biology. Annu Rev Biochem 2005, 74: 53–82. 10.1146/annurev.biochem.74.082803.133212
 4.
Larranaga P, Calvo B, Santana R, Bielza C, Galdiano J, Inza I, Lozano JA, Armananzas R, Santafe G, Perez A, Robles V: Machine learning in bioinformatics. Brief Bioinform 2006, 7: 86–112. 10.1093/bib/bbk007
 5.
Bonilla Huerta E, Duval B, Hao JK: A hybrid LDA and genetic algorithm for gene selection and classification of microarray data. Neurocomputing 2010, 73(13–15):2375–2383. 10.1016/j.neucom.2010.03.024
 6.
Duval B, Hao JK: Advances in metaheuristics for gene selection and classification of microarray data. Brief Bioinform 2010, 11(1):127–142. 10.1093/bib/bbp035
 7.
Furey TS, Cristianini N, Duffy N, Bednarski DW, Schummer M, Haussler D: Support vector machine classification and validation of cancer tissue samples using microarray expression data. Bioinformatics 2000, 16(10):906–914. 10.1093/bioinformatics/16.10.906
 8.
Guyon I, Weston J, Barnhill S, Vapnik V: Gene selection for cancer classification using support vector machines. Machine Learning 2002, 46: 389–422. 10.1023/A:1012487302797
 9.
Hernandez Hernandez JC, Duval B, Hao JK: A genetic embedded approach for gene selection and classification of microarray data. The Fifth European Conference on Evolutionary Computation, Machine Learning and Datamining in Bioinformatics. LNCS 2007, 4447: 90–101. 10.1007/9783540717836_9
 10.
Huang DS, Zheng CH: Independent component analysis based penalized discriminant method for tumor classification using gene expression data. Bioinformatics 2006, 22(15):1855–1862. 10.1093/bioinformatics/btl190
 11.
Li L, Weinberg CR, Darden TA, Pedersen LG: Gene selection for sample classification based on gene expression data: study of sensitivity to choice of parameters of the ga/knn method. Bioinformatics 2001, 17(12):1131–1142. 10.1093/bioinformatics/17.12.1131
 12.
Li L, Jiang W, Li X, Moser KL, Guo Z, Du L, Wang Q, Topol EJ, Wang Q, Rao S: A robust hybrid between genetic algorithm and support vector machine for extracting an optimal feature gene subset. Genomics 2005, 85(1):16–23. 10.1016/j.ygeno.2004.09.007
 13.
Zheng CH, Zhang L, Ng VTY, Shiu SCK, Huang DS: Metasamplebased sparse representation for tumor classification. IEEE/ACM Trans Comput Biol Bioinform 2011, 8(5):1273–1282.
 14.
Zheng CH, Huang DS, Kong XZ, Zhao XM: Gene expression data classification using consensus independent component analysis. Genomics Proteomics & Bioinformatics 2008, 6(2):74–82.
 15.
Zheng CH, Huang DS, Shang L: Feature selection in independent component subspace for microarray data classification. Neurocomputing 2006, 69(16–18):2407–2410. 10.1016/j.neucom.2006.02.006
 16.
Alizadeh A, Eisen MB, Davis RE, Ma C, Lossos IS, Rosenwald A, Boldrick JC, Sabet H, Tran T, Yu X, Powell JI, Yang L, Marti GE, Moore T, Hudson JJ, Lu L, Lewis DB, Tibshirani R, Sherlock G, Chan WC, Greiner TC, Weisenburger DD, Armitage JO, Warnke R, Levy R, Wilson W, Grever MR, Byrd JC, Botstein D, Brown PO, Staudt LM: Distinct types of diffuse large (b)cell lymphoma identified by gene expression profiling. Nature 2000, 403: 503–511. 10.1038/35000501
 17.
Golub T, Slonim D, Tamayo P, Huard C, Gaasenbeek M, Mesirov J, Coller H, Loh M, Downing J, Caligiuri M, Bloomfield C, Lander E: Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Science 1999, 286: 531–537. 10.1126/science.286.5439.531
 18.
Liu B, Cui Q, Jiang T, Ma S: A combinational feature selection and ensemble neural network method for classification of gene expression data. BMC Bioinformatics 2004, 5: 136. 10.1186/147121055136
 19.
Zheng CH, Zhang L, Ng VTY, Shiu SCK, Huang DS: Molecular pattern discovery based on penalized matrix decomposition. IEEE/ACM Trans Comput Biol Bioinform 2011, 8(6):1592–1603.
 20.
Zheng CH, Huang DS, Zhang L, Kong XZ: Tumor clustering using nonnegative matrix factorization with gene selection. IEEE Trans Inf Technol Biomed 2009, 13(4):599–607.
 21.
Dimaggio P, Mcallister S, Feng C, Floudas XJ, Rabinowitz JD, Rabitzl HA: Biclustering via optimal reordering of data matrices in systems biology: rigorous methods and comparative studies. BMC Bioinformatics 2008, 9(1):458. 10.1186/147121059458
 22.
Madeira SC, Oliveira AL: Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Trans Comput Biol Bioinform 2004, 1(1):24–45. 10.1109/TCBB.2004.2
 23.
Tanay A, Sharan R, Shamir R: Discovering statistically significant biclusters in gene expression data. Bioinformatics 2002, 18: S136S144. 10.1093/bioinformatics/18.suppl_1.S136
 24.
Cheng Y, Church GM: Biclustering of expression data. Proc Int Conf Intell Syst Mol Biol 2000, 8: 93–103.
 25.
Ayadi W, Elloumi M: Biclustering of microarray data. In Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications. Wiley Book Series on Bioinformatics: Computational Techniques and Engineering. New Jersey, USA: John Wiley & Sons Ltd; 2011:651–664.
 26.
Busygin S, Prokopyev O, Pardalos PM: Biclustering in data mining. Computers and Operations Research 2008, 35(9):2964–2987. 10.1016/j.cor.2007.01.005
 27.
Liu X, Wang L: Computing the maximum similarity biclusters of gene expression data. Bioinformatics 2007, 23(1):50–56. 10.1093/bioinformatics/btl560
 28.
Ayadi W, Elloumi M, Hao JK: BicFinder: a biclustering algorithm for microarray data analysis. Knowledge and Information Systems: An International Journal 2012, 30(2):341–358. 10.1007/s1011501103837
 29.
BenDor A, Chor B, Karp R, Yakhini Z: Discovering local structure in gene expression data: the orderpreserving submatrix problem. In Proceedings of the Sixth Annual International Conference on Computational Biology. New York, NY, USA; 2002:49–57.
 30.
Teng L, Chan L: Discovering biclusters by iteratively sorting with weighted correlation coefficient in gene expression data. J Signal Process Syst 2008, 50(3):267–280. 10.1007/s1126500701212
 31.
Chen JR, Chang YI: A conditionenumeration tree method for mining biclusters from DNA microarray data sets. Biosystems 2009, 97: 44–59. 10.1016/j.biosystems.2009.04.003
 32.
Ayadi W, Elloumi M, Hao JK: BiMine+: an efficient algorithm for discovering relevant biclusters of DNA microarray data. (Submitted)
 33.
Cheng KO, Law NF, Siu WC, Liew AW: Identification of coherent patterns in gene expression data using an efficient biclustering algorithm and parallel coordinate visualization. BMC Bioinformatics 2008, 9: 210. 10.1186/147121059210
 34.
Liu J, Wang W: Opcluster: clustering by tendency in high dimensional space. IEEE International Conference on Data Mining 2003, 187–194.
 35.
Ayadi W, Elloumi M, Hao JK: Iterated local search for biclustering of microarray data. In Proceedings of 5th IAPR International Conference on Pattern Recognition in Bioinformatics, PRIB2010. LNCS. Volume 6282. SpringerVerlag; 2010:219–229.
 36.
Bryan K, Cunningham P, Bolshakova N: Application of simulated annealing to the biclustering of gene expression data. IEEE Trans Inf Technol Biomed 2006, 10(3):519–525. 10.1109/TITB.2006.872073
 37.
Das S, Idicula SM: Application of reactive grasp to the biclustering of gene expression data. In Proceedings of the International Symposium on Biocomputing. New York, NY, USA: ACM; 2010:1–8.
 38.
Dharan A, Nair AS: Biclustering of gene expression data using reactive greedy randomized adaptive search procedure. BMC Bioinformatics 2009, 10(Suppl 1):S27. 10.1186/1471210510S1S27
 39.
Divina F, AguilarRuiz JS: Biclustering of expression data with evolutionary computation. IEEE Transactions on Knowledge & Data Engineering 2006, 18(5):590–602.
 40.
Divina F, AguilarRuiz JS: A multiobjective approach to discover biclusters in microarray data. In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation. New York, NY, USA: ACM; 2007:385–392.
 41.
Gallo CA, Carballido JA, Ponzoni I: Microarray biclustering: a novel memetic approach based on the pisa platform. Proceedings of the 7th European Conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics 2009, 44–55.
 42.
Mitra S, Banka H: Multiobjective evolutionary biclustering of gene expression data. Pattern Recognition 2006, 39(12):2464–2477. 10.1016/j.patcog.2006.03.003
 43.
Luan Y, Li H: Clustering of timecourse gene expression data using a mixedeffects model with bsplines. Bioinformatics 2003, 19: 474–482. 10.1093/bioinformatics/btg014
 44.
Peddada SD, Lobenhofer EK, Li L, Afshari CA, Weinberg CR, Umbach DM: Gene selection and clustering for timecourse and doseresponse microarray experiments using orderrestricted inference. Bioinformatics 2003, 19: 834–841. 10.1093/bioinformatics/btg093
 45.
Schliep A, Schonhuth A, Steinhoff C: Using hidden markov models to analyze gene expression time course data. Bioinformatics 2003, 19: i255i263. 10.1093/bioinformatics/btg1036
 46.
Lourenco HR, Martin O, Stutzle T: Iterated local search. In Handbook of Metaheuristics. Edited by: Glover F, Kochenberger G. SpringerVerlag; 2003:321–353.
 47.
Guan J, Gan Y, Wang H: Discovering patternbased subspace clusters by pattern tree. KnowledgeBased Systems 2009, 22(8):569–579. 10.1016/j.knosys.2009.02.011
 48.
Angiulli F, Cesario E, Pizzuti C: Random walk biclustering for microarray data. Information Sciences 2008, 178(6):1479–1497. 10.1016/j.ins.2007.11.007
 49.
Bleuler S, Prelic A, Zitzler E: An EA framework for biclustering of gene expression data. Proceedings of Congress on Evolutionary Computation 2004, 166–173.
 50.
Yang J, Wang H, Wang W, Yu P: Enhanced biclustering on expression data. In Proceedings of the 3rd IEEE Symposium on Bioinformatics and Bioengineering. Washington, DC, USA: IEEE Computer Society; 2003:321–327.
 51.
Zhang Z, Teo A, Ooi BC, Tan KL: Mining deterministic biclusters in gene expression data. IEEE International Symposium on Bioinformatics and Bioengineering 2004, 283–290.
 52.
AguilarRuiz JS: Shifting and scaling patterns from gene expression data. Bioinformatics 2005, 21: 3840–3845. 10.1093/bioinformatics/bti641
 53.
Pontes B, Divina F, Giráldez R, AguilarRuiz JS: Virtual error: a new measure for evolutionary biclustering. Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics 2007, 217–226.
 54.
Ayadi W, Elloumi M, Hao JK: A biclustering algorithm based on a bicluster enumeration tree: application to DNA microarray data. BioData Min 2009, 2(1):9. 10.1186/1756038129
 55.
Lehmann EL, D'Abrera HJM: Nonparametrics: Statistical Methods Based on Ranks. Englewood Cliffs, NJ: Prentice Hall; 1998:292–323.
 56.
Bergmann S, Ihmels J, Barkai N: Defining transcription modules using largescale gene expression data. Bioinformatics 2004, 20(13):1993–2003. 10.1093/bioinformatics/bth166
 57.
Prelic A, Bleuler S, Zimmermann P, 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(9):1122–1129. 10.1093/bioinformatics/btl060
 58.
Barkow S, Bleuler S, Prelic A, Zimmermann P, Zitzler E: BicAt: a biclustering analysis toolbox. Bioinformatics 2006, 22(10):1282–1283. 10.1093/bioinformatics/btl099
 59.
Gasch AP, Spellman PT, Kao CM, CarmelHarel O, Eisen MB, Storz G, Botstein D, Brown PO: Genomic expression programs in the response of yeast cells to environmental changes. Mol Biol Cell 2000, 11(12):4241–4257.
 60.
Berriz GF, King OD, Bryant B, Sander C, Roth FP: Characterizing gene sets with funcassociate. Bioinformatics 2003, 19(18):2502–2504. 10.1093/bioinformatics/btg363
 61.
Tavazoie S, Hughes JD, Campbell MJ, Cho RJ, Church GM: Systematic determination of genetic network architecture. Nat Genet 1999, 22: 281–285. 10.1038/10343
 62.
Cheng Y, Church GM: Biclustering of expression data. Technical Report, (Supplementary Information) 2006.
Acknowledgements
This work was partially supported by the projects 'Bioinformatique Ligérienne  BIL' (20092011, Pays de La Loire, France) and Radapop (20092013, Pays de La Loire, France) which are acknowledged. We thank the reviewers of the paper for their comments and suggestions.
This article has been published as part of BMC Bioinformatics Volume 13 Supplement 7, 2012: Advanced intelligent computing theories and their applications in bioinformatics. Proceedings of the 2011 International Conference on Intelligent Computing (ICIC 2011). The full contents of the supplement are available online at http://www.biomedcentral.com/bmcbioinformatics/supplements/13/S7.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
WA carried out the implementation of the proposed idea, performed the statistical and biological experiments using FuncAssociate and GoTermFinder, and wrote the draft manuscript. JKH supervised the project and cowrote the manuscript. ME participated in the correction of the final manuscript. All authors read and approved the final manuscript.
Rights and permissions
Open Access This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Ayadi, W., Elloumi, M. & Hao, JK. Patterndriven neighborhood search for biclustering of microarray data. BMC Bioinformatics 13, S11 (2012). https://doi.org/10.1186/1471210513S7S11
Published:
Keywords
 Gene Ontology
 Neighborhood Search
 Move Operator
 Trajectory Pattern
 Neighborhood Search Algorithm