Accueil | Aperçu | Revues | Soumettre | Nous Contacter | English |

**|**BMC Bioinformatics**|**vol.13(Suppl 7); 2012**|**PMC3348021

Formats

Sections de l'article

- Abstract
- Background
- Method
- Results and discussion
- Datasets and results
- Conclusions
- Competing interests
- Authors' contributions
- References

Auteurs

Liens connexes

BMC Bioinformatics. 2012; 13(Suppl 7): S11.

Published online 2012 May 8. doi: 10.1186/1471-2105-13-S7-S11

PMCID: PMC3348021

Wassim Ayadi: rf.sregna-vinu.ofni@idaya; Mourad Elloumi: nt.unr.tgesf@imuolle.daruom; Jin-Kao Hao: rf.sregna-vinu.ofni@oah

Renseignements sur l'auteur ► Notes de l'article ► Renseignements sur la licence et le droit d'auteur ►

Advanced intelligent computing theories and their applications in bioinformatics. Proceedings of the 2011 International Conference on Intelligent Computing (ICIC 2011)

M Michael Gromiha and De-Shuang Huang

The conference and publication charges were partly funded by grants from the National Science Foundation of China Nos. 61133010, and 31071168.

The 2011 International Conference on Intelligent Computing (ICIC 2011)

11-14 August 2011

Zhengzhou, China

Copyright ©2012 Ayadi 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.

D'autres articles de PMC font référence à cet article.

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.

We describe a stochastic pattern-driven 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 well-known 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.

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.

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 non-supervised 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 NP-hard [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 CE-Tree algorithm which builds its tree of biclusters by applying a special local breadth-first within a global depth-first 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]. Population-based 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 *Pattern-Driven 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.

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:

$${M}^{\prime}\left[i,l\right]=\left\{\begin{array}{c}1\phantom{\rule{2.77695pt}{0ex}}if\phantom{\rule{2.77695pt}{0ex}}M\left[i,k\right]<M\left[i,q\right]\\ 0\phantom{\rule{2.77695pt}{0ex}}if\phantom{\rule{2.77695pt}{0ex}}M\left[i,k\right]=M\left[i,q\right]\\ -1\phantom{\rule{2.77695pt}{0ex}}if\phantom{\rule{2.77695pt}{0ex}}M\left[i,k\right]>M\left[i,q\right]\\ \end{array}\right)$$

(1)

with *i * [1..*n*], *l * [1..*J''*], *k * [1..*m*- 1], *q * [2..*m*] and *q *≥ *k *+ 1.

Figure Figure11 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.

Our proposed PDNS method can be considered as an Iterated Local Search procedure [46]. It alternates between two basic components: a descent-based 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 pattern-based 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 Figure2.2. We describe in the following sections the ingredients of PDNS.

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:

$$\text{ASR}({I}^{\prime},{J}^{\prime})=2\text{\hspace{0.17em}}\text{max}\left\{\frac{{\displaystyle {\sum}_{i\epsilon {I}^{\prime}}{\displaystyle {\sum}_{\begin{array}{c}j\epsilon {J}^{\prime}\\ j\ge i+1\end{array}}{\rho}_{ij}}}}{\left|{I}^{\prime}\right|(|{I}^{\prime}|-1)},\frac{{\displaystyle {\sum}_{k\epsilon {J}^{\prime}}{\displaystyle {\sum}_{\begin{array}{c}l\epsilon {J}^{\prime}\\ l\ge k+1\end{array}}{\rho}_{kl}}}}{\left|{J}^{\prime}\right|(|{J}^{\prime}|-1)}\right\}$$

(2)

where *ρ _{ij }*(

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.

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 sub-matrix of *M' *including only the set of genes in *I' *and all the combinations of paired conditions in *J' *(see example of Figure Figure1).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.

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 well-known 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.

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

Now for each gene *g _{i}*,

Figure Figure33 shows an example where one bad gene (*g _{4}*) is deleted and one good gene (

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,

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"

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}*); (

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 clustering-based 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 *p*-values of the obtained biclusters. We pick the combination with the lowest *p*-value for the final experiment. For CC, OPSM, ISA and Bimax, the default values used in [27] are adopted for the Yeast Cell-Cycle 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.

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 *p*-values (*p *= 5%, 1%, 0.5%, 0.1% and 0.001%) which is the one-sided *p*-value of the association between attribute and query resulting from Fisher's Exact Test. The best biclusters have an adjusted *p*-value less than 0.001%.

Figure Figure55 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 under-performs because it is unable to find coherent biclusters and its lack of robustness against noise.

The Yeast Cell-Cycle 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 *p*-value 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.

To evaluate the statistical relevance of PDNS, we use again the *p*-values and apply the web-tool *FuncAssociate *[60]. The results of PDNS are compared against CC, ISA, Bimax and OPSM. Figure Figure66 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 *p*-value. 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%.

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/cgi-bin/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 Table11 and Table Table22 report the top GO terms shared by the biclusters of CC (*id2 _{CC}*,

Most significant shared GO terms (process, function, component) of CC and PDNS for biclusters on Yeast Cell-Cycle dataset

Most significant shared GO terms (process, function, component) of OPSM and PDNS for biclusters on Yeast Cell-Cycle dataset

For the bicluster labeled *id9 _{PDNS }*(Table (Table1),1), the genes

For the worst (resp. the best) biclusters obtained from CC, i.e, *id9 _{CC }*(resp.

We have presented the pattern-driven neighborhood search for the biclustering problem of microarray data. PDNS alternates between a descent-based intensification phase and a perturbation phase. By using a behavior matrix representation of solutions, the descent search procedure is guided by a pattern-based 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 well-known microarray datasets (Yeast Cell-Cycle 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.

The authors declare that they have no competing interests.

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 co-wrote the manuscript. ME participated in the correction of the final manuscript. All authors read and approved the final manuscript.

This work was partially supported by the projects 'Bioinformatique Ligérienne - BIL' (2009-2011, Pays de La Loire, France) and Radapop (2009-2013, 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.

- Butte A. The use and analysis of microarray data. Nat Rev Drug Discov. 2002;1:951–960. doi: 10.1038/nrd961. [PubMed] [Cross Ref]
- 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. doi: 10.1093/jnci/djk018. [PubMed] [Cross Ref]
- Stoughton RB. Applications of DNA microarrays in biology. Annu Rev Biochem. 2005;74:53–82. doi: 10.1146/annurev.biochem.74.082803.133212. [PubMed] [Cross Ref]
- 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. doi: 10.1093/bib/bbk007. [PubMed] [Cross Ref]
- 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. doi: 10.1016/j.neucom.2010.03.024. [Cross Ref]
- Duval B, Hao JK. Advances in metaheuristics for gene selection and classification of microarray data. Brief Bioinform. 2010;11(1):127–142. doi: 10.1093/bib/bbp035. [PubMed] [Cross Ref]
- 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. doi: 10.1093/bioinformatics/16.10.906. [PubMed] [Cross Ref]
- Guyon I, Weston J, Barnhill S, Vapnik V. Gene selection for cancer classification using support vector machines. Machine Learning. 2002;46:389–422. doi: 10.1023/A:1012487302797. [Cross Ref]
- 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. doi: 10.1007/978-3-540-71783-6_9. [Cross Ref]
- Huang DS, Zheng CH. Independent component analysis based penalized discriminant method for tumor classification using gene expression data. Bioinformatics. 2006;22(15):1855–1862. doi: 10.1093/bioinformatics/btl190. [PubMed] [Cross Ref]
- 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. doi: 10.1093/bioinformatics/17.12.1131. [PubMed] [Cross Ref]
- 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. doi: 10.1016/j.ygeno.2004.09.007. [PubMed] [Cross Ref]
- Zheng CH, Zhang L, Ng VTY, Shiu SCK, Huang DS. Metasample-based sparse representation for tumor classification. IEEE/ACM Trans Comput Biol Bioinform. 2011;8(5):1273–1282. [PubMed]
- 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. doi: 10.1016/S1672-0229(08)60022-4. [PubMed] [Cross Ref]
- Zheng CH, Huang DS, Shang L. Feature selection in independent component subspace for microarray data classification. Neurocomputing. 2006;69(16-18):2407–2410. doi: 10.1016/j.neucom.2006.02.006. [Cross Ref]
- 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. doi: 10.1038/35000501. [PubMed] [Cross Ref]
- 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. doi: 10.1126/science.286.5439.531. [PubMed] [Cross Ref]
- 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. doi: 10.1186/1471-2105-5-136. [PMC free article] [PubMed] [Cross Ref]
- 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. [PubMed]
- Zheng CH, Huang DS, Zhang L, Kong XZ. Tumor clustering using non-negative matrix factorization with gene selection. IEEE Trans Inf Technol Biomed. 2009;13(4):599–607. [PubMed]
- 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. doi: 10.1186/1471-2105-9-458. [PMC free article] [PubMed] [Cross Ref]
- Madeira SC, Oliveira AL. Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Trans Comput Biol Bioinform. 2004;1(1):24–45. doi: 10.1109/TCBB.2004.2. [PubMed] [Cross Ref]
- Tanay A, Sharan R, Shamir R. Discovering statistically significant biclusters in gene expression data. Bioinformatics. 2002;18:S136–S144. doi: 10.1093/bioinformatics/18.suppl_1.S136. [PubMed] [Cross Ref]
- Cheng Y, Church GM. Biclustering of expression data. Proc Int Conf Intell Syst Mol Biol. 2000;8:93–103. [PubMed]
- Ayadi W, Elloumi M. 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. Biclustering of microarray data; pp. 651–664.
- Busygin S, Prokopyev O, Pardalos PM. Biclustering in data mining. Computers and Operations Research. 2008;35(9):2964–2987. doi: 10.1016/j.cor.2007.01.005. [Cross Ref]
- Liu X, Wang L. Computing the maximum similarity biclusters of gene expression data. Bioinformatics. 2007;23(1):50–56. doi: 10.1093/bioinformatics/btl560. [PubMed] [Cross Ref]
- 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. doi: 10.1007/s10115-011-0383-7. [Cross Ref]
- Ben-Dor A, Chor B, Karp R, Yakhini Z. Proceedings of the Sixth Annual International Conference on Computational Biology. New York, NY, USA; 2002. Discovering local structure in gene expression data: the order-preserving submatrix problem; pp. 49–57.
- 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. doi: 10.1007/s11265-007-0121-2. [Cross Ref]
- Chen JR, Chang YI. A condition-enumeration tree method for mining biclusters from DNA microarray data sets. Biosystems. 2009;97:44–59. doi: 10.1016/j.biosystems.2009.04.003. [PubMed] [Cross Ref]
- Ayadi W, Elloumi M, Hao JK. BiMine+: an efficient algorithm for discovering relevant biclusters of DNA microarray data. (Submitted)
- 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. doi: 10.1186/1471-2105-9-210. [PMC free article] [PubMed] [Cross Ref]
- Liu J, Wang W. Op-cluster: clustering by tendency in high dimensional space. IEEE International Conference on Data Mining. 2003. pp. 187–194.
- Ayadi W, Elloumi M, Hao JK. Proceedings of 5th IAPR International Conference on Pattern Recognition in Bioinformatics, PRIB2010. LNCS. Vol. 6282. Springer-Verlag; 2010. Iterated local search for biclustering of microarray data; pp. 219–229.
- 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. doi: 10.1109/TITB.2006.872073. [PubMed] [Cross Ref]
- Das S, Idicula SM. Proceedings of the International Symposium on Biocomputing. New York, NY, USA: ACM; 2010. Application of reactive grasp to the biclustering of gene expression data; pp. 1–8.
- Dharan A, Nair AS. Biclustering of gene expression data using reactive greedy randomized adaptive search procedure. BMC Bioinformatics. 2009;10(Suppl 1):S27. doi: 10.1186/1471-2105-10-S1-S27. [PMC free article] [PubMed] [Cross Ref]
- Divina F, Aguilar-Ruiz JS. Biclustering of expression data with evolutionary computation. IEEE Transactions on Knowledge & Data Engineering. 2006;18(5):590–602.
- Divina F, Aguilar-Ruiz JS. Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation. New York, NY, USA: ACM; 2007. A multi-objective approach to discover biclusters in microarray data; pp. 385–392.
- 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. pp. 44–55.
- Mitra S, Banka H. Multi-objective evolutionary biclustering of gene expression data. Pattern Recognition. 2006;39(12):2464–2477. doi: 10.1016/j.patcog.2006.03.003. [Cross Ref]
- Luan Y, Li H. Clustering of time-course gene expression data using a mixed-effects model with b-splines. Bioinformatics. 2003;19:474–482. doi: 10.1093/bioinformatics/btg014. [PubMed] [Cross Ref]
- Peddada SD, Lobenhofer EK, Li L, Afshari CA, Weinberg CR, Umbach DM. Gene selection and clustering for time-course and dose-response microarray experiments using order-restricted inference. Bioinformatics. 2003;19:834–841. doi: 10.1093/bioinformatics/btg093. [PubMed] [Cross Ref]
- Schliep A, Schonhuth A, Steinhoff C. Using hidden markov models to analyze gene expression time course data. Bioinformatics. 2003;19:i255–i263. doi: 10.1093/bioinformatics/btg1036. [PubMed] [Cross Ref]
- Lourenco HR, Martin O, Stutzle T. In: Handbook of Meta-heuristics. Glover F, Kochenberger G, editor. Springer-Verlag; 2003. Iterated local search; pp. 321–353.
- Guan J, Gan Y, Wang H. Discovering pattern-based subspace clusters by pattern tree. Knowledge-Based Systems. 2009;22(8):569–579. doi: 10.1016/j.knosys.2009.02.011. [Cross Ref]
- Angiulli F, Cesario E, Pizzuti C. Random walk biclustering for microarray data. Information Sciences. 2008;178(6):1479–1497. doi: 10.1016/j.ins.2007.11.007. [Cross Ref]
- Bleuler S, Prelic A, Zitzler E. An EA framework for biclustering of gene expression data. Proceedings of Congress on Evolutionary Computation. 2004. pp. 166–173.
- Yang J, Wang H, Wang W, Yu P. Proceedings of the 3rd IEEE Symposium on Bioinformatics and Bioengineering. Washington, DC, USA: IEEE Computer Society; 2003. Enhanced biclustering on expression data; pp. 321–327.
- Zhang Z, Teo A, Ooi BC, Tan KL. Mining deterministic biclusters in gene expression data. IEEE International Symposium on Bioinformatics and Bioengineering. 2004. pp. 283–290.
- Aguilar-Ruiz JS. Shifting and scaling patterns from gene expression data. Bioinformatics. 2005;21:3840–3845. doi: 10.1093/bioinformatics/bti641. [PubMed] [Cross Ref]
- Pontes B, Divina F, Giráldez R, Aguilar-Ruiz JS. Virtual error: a new measure for evolutionary biclustering. Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics. 2007. pp. 217–226.
- 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. doi: 10.1186/1756-0381-2-9. [PMC free article] [PubMed] [Cross Ref]
- Lehmann EL, D'Abrera HJM. Nonparametrics: Statistical Methods Based on Ranks. Englewood Cliffs, NJ: Prentice Hall; 1998. pp. 292–323.
- Bergmann S, Ihmels J, Barkai N. Defining transcription modules using large-scale gene expression data. Bioinformatics. 2004;20(13):1993–2003. doi: 10.1093/bioinformatics/bth166. [PubMed] [Cross Ref]
- 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. doi: 10.1093/bioinformatics/btl060. [PubMed] [Cross Ref]
- Barkow S, Bleuler S, Prelic A, Zimmermann P, Zitzler E. BicAt: a biclustering analysis toolbox. Bioinformatics. 2006;22(10):1282–1283. doi: 10.1093/bioinformatics/btl099. [PubMed] [Cross Ref]
- Gasch AP, Spellman PT, Kao CM, Carmel-Harel 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. [PMC free article] [PubMed]
- Berriz GF, King OD, Bryant B, Sander C, Roth FP. Characterizing gene sets with funcassociate. Bioinformatics. 2003;19(18):2502–2504. doi: 10.1093/bioinformatics/btg363. [PubMed] [Cross Ref]
- Tavazoie S, Hughes JD, Campbell MJ, Cho RJ, Church GM. Systematic determination of genetic network architecture. Nat Genet. 1999;22:281–285. doi: 10.1038/10343. [PubMed] [Cross Ref]
- Cheng Y, Church GM. Biclustering of expression data. Technical Report, (Supplementary Information) 2006.

Les articles de BMC Bioinformatics ont été offerts à titre gracieux par **BioMed Central**.

PubMed Central Canada est un service des Instituts de recherche en santé du Canada (IRSC) offert en partenariat avec la bibliothèque scientifique nationale du Conseil national de recherches du Canada et le National Center for Biotechnology Information de la National Library of Medicine (NCBI/NLM) des États-Unis. Il renferme du contenu des archives de PubMed Central International par les éditeurs participants. |