An enumerative biclustering algorithm based on greatest common divisor: application to DNA microarray data
by Haifa Ben Saber; Mourad Elloumi
International Journal of Computer Applications in Technology (IJCAT), Vol. 55, No. 1, 2017

Abstract: In a number of domains, such as DNA microarray data analysis, we need to cluster simultaneously rows (genes) and columns (conditions) of a data matrix to identify groups of constant rows with a group of columns. This kind of clustering is called biclustering. Biclustering algorithms are extensively used in DNA microarray data analysis. More effective biclustering algorithms are highly desirable and needed. We introduce a new algorithm called BestBinBicluster for biclustering of binary microarray data. Our biclustering algorithm BestBinBicluster extracts a group of biclusters from binary matrix Mb. This algorithm adopts the strategy of one bicluster at a time. It is a novel alternative to extract biclusters from binary data sets. Our algorithm is based on the use of a polynomial function to search Greatest Common Divisor (GCD) and the use of Galois Lattice. We propose to generate the Enumerative BinBicluster Lattice. The performance of the proposed algorithm is assessed using both synthetic and real DNA microarray data; our algorithm outperforms other biclustering algorithms for binary microarray data. We test the biological significance using a gene annotation web tool to show that our proposed method is able to produce biologically relevant biclusters.

Online publication date: Tue, 14-Feb-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com