Iterated local search for biclustering of microarray data

  • Authors:
  • Wassim Ayadi;Mourad Elloumi;Jin-Kao Hao

  • Affiliations:
  • LERIA, University of Angers, Angers, France and UTIC, Higher School of Sciences and Technologies of Tunis, Tunis, Tunisia;UTIC, Higher School of Sciences and Technologies of Tunis, Tunis, Tunisia;LERIA, University of Angers, Angers, France

  • Venue:
  • PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the context of microarray data analysis, biclustering aims to identify simultaneously a group of genes that are highly correlated across a group of experimental conditions. This paper presents a Biclustering Iterative Local Search (BILS) algorithm to the problem of biclustering of microarray data. The proposed algorithm is highlighted by the use of some original features including a new evaluation function, a dedicated neighborhood relation and a tailored perturbation strategy. The BILS algorithm is assessed on the well-known yeast cell-cycle dataset and compared with two most popular algorithms.