Improving performances of suboptimal greedy iterative biclustering heuristics via localization.
BACKGROUND
Biclustering gene expression data is the problem of extracting submatrices of genes and conditions exhibiting significant correlation across both the rows and the columns of a data matrix of expression values. Even the simplest versions of the problem are computationally hard. Most of the proposed solutions therefore employ greedy iterative heuristics that locally optimize a suitably assigned scoring function.


METHODS
We provide a fast and simple pre-processing algorithm called localization that reorders the rows and columns of the input data matrix in such a way as to group correlated entries in small local neighborhoods within the matrix. The proposed localization algorithm takes its roots from effective use of graph-theoretical methods applied to problems exhibiting a similar structure to that of biclustering. In order to evaluate the effectivenesss of the localization pre-processing algorithm, we focus on three representative greedy iterative heuristic methods. We show how the localization pre-processing can be incorporated into each representative algorithm to improve biclustering performance. Furthermore, we propose a simple biclustering algorithm, Random Extraction After Localization (REAL) that randomly extracts submatrices from the localization pre-processed data matrix, eliminates those with low similarity scores, and provides the rest as correlated structures representing biclusters.


RESULTS
We compare the proposed localization pre-processing with another pre-processing alternative, non-negative matrix factorization. We show that our fast and simple localization procedure provides similar or even better results than the computationally heavy matrix factorization pre-processing with regards to H-value tests. We next demonstrate that the performances of the three representative greedy iterative heuristic methods improve with localization pre-processing when biological correlations in the form of functional enrichment and PPI verification constitute the main performance criteria. The fact that the random extraction method based on localization REAL performs better than the representative greedy heuristic methods under same criteria also confirms the effectiveness of the suggested pre-processing method.


BACKGROUND
Supplementary material including code implementations in LEDA C++ library, experimental data, and the results are available at http://code.google.com/p/biclustering/


BACKGROUND
cesim@khas.edu.tr; melihsozdinler@boun.edu.tr


BACKGROUND
Supplementary data are available at Bioinformatics online.
Erten
Cesim
C
Department of Computer Engineering, Kadir Has University, Cibali, Istanbul 34083, Turkey. cesim@khas.edu.tr
Sözdinler
Melih
M
D000465:Algorithms; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D016208:Databases, Factual; D020869:Gene Expression Profiling / Q000379:methods*; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods; D010363:Pattern Recognition, Automated / Q000379:methods