Scholars Central

Conference abstractPublished 4 May 2015

Novel biclustering algorithms for binary microarray data

Authors: Haifa Ben Saber, Mourad Elloumi

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

In this paper, we present three new algorithms called, BiBinConsmeans, BiBinConsmax, BiBinAltermeans, BiBinAltermax, BiBinConvmeans and BiBinConvmax, for biclustering of binary microarray data. There are novel alternatives to extract biclusters from sparse binary datasets. Our algorithms are based on Iterative Row and Column Clustering Combination (IRCCC) and Divide and Conquer (DC) approaches, BiMax initialization and the CroBin evaluation function. Applied on binary synthetic datasets, our algorithms outperform other biclustering algorithms for binary microarray data. Biclusters with different numbers of rows and columns can be detected, varying from many rows to few columns and few rows to many columns. Our algorithms allow the user to guide the search towards biclusters of specific dimensions.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Computer Science & Systems Biology.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Computer Science & Systems Biology
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Haifa Ben Saber”
  • BylineArticles whose byline prints “Mourad Elloumi”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels