Abstract

Biclustering is one of the important techniques for gene expression data analysis. A bicluster is a set of genes coherently expressed for a set of biological conditions. Various biclustering algorithms have been proposed to find biclusters of different types. However, most of them are not efficient. We propose a novel algorithm MRCluster to mine constant row biclusters from real-valued dataset. MRCluster uses Apriori property and several novel pruning techniques to mine biclusters efficiently. We compare our algorithm with a recent approach RAP, and experimental results show that MRCluster is much more efficient than RAP in mining biclusters with constant rows from real-valued gene expression data.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.