BicFinder: a biclustering algorithm for microarray data analysis

  • Authors:

  • Wassim Ayadi;Mourad Elloumi;Jin-Kao Hao

  • Affiliations:

  • University of Tunis, UTIC, Higher School of Sciences and Technologies of Tunis, 1008, Tunis, Tunisia and University of Angers, LERIA, 2 Boulevard Lavoisier, 49045, Angers, France;University of Tunis, UTIC, Higher School of Sciences and Technologies of Tunis, 1008, Tunis, Tunisia;University of Angers, LERIA, 2 Boulevard Lavoisier, 49045, Angers, France

  • Venue:
  • Knowledge and Information Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the context of microarray data analysis, biclustering allows the simultaneous identification of a maximum group of genes that show highly correlated expression patterns through a maximum group of experimental conditions (samples). This paper introduces a heuristic algorithm called BicFinder (The BicFinder software is available at: http://www.info.univ-angers.fr/pub/hao/BicFinder.html) for extracting biclusters from microarray data. BicFinder relies on a new evaluation function called Average Correspondence Similarity Index (ACSI) to assess the coherence of a given bicluster and utilizes a directed acyclic graph to construct its biclusters. The performance of BicFinder is evaluated on synthetic and three DNA microarray datasets. We test the biological significance using a gene annotation web-tool to show that our proposed algorithm is able to produce biologically relevant biclusters. Experimental results show that BicFinder is able to identify coherent and overlapping biclusters.