Comparative Advantages of Novel Algorithms Using MSR Threshold and MSR Difference Threshold for Biclustering Gene Expression Data

Chapter

Abstract

The goal of biclustering in gene expression data matrix is to find a submatrix such that the genes in the submatrix show highly correlated activities across all conditions in the submatrix. A measure called mean squared residue (MSR) is used to simultaneously evaluate the coherence of rows and columns within the submatrix. MSR difference is the incremental increase in MSR when a gene or condition is added to the bicluster. In this chapter, three biclustering algorithms using MSR threshold (MSRT) and MSR difference threshold (MSRDT) are experimented and compared. All these methods use seeds generated from K-Means clustering algorithm. Then these seeds are enlarged by adding more genes and conditions. The first algorithm makes use of MSRT alone. Both the second and third algorithms make use of MSRT and the newly introduced concept of MSRDT. Highly coherent biclusters are obtained using this concept. In the third algorithm, a different method is used to calculate the MSRDT. The results obtained on bench mark datasets prove that these algorithms are better than many of the metaheuristic algorithms.

References

  1. 1.
    Cheng Y and Church G M, “Biclustering of expression data”, Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, pp. 93–103, 2000.Google Scholar
  2. 2.
    Tavazoie S, Hughes J D, Campbell M J, Cho R J and Church G M, “Systematic determination of genetic network architecture”, Nature Genetics, Vol. 22, no. 3 pp. 281–285, 1999.Google Scholar
  3. 3.
    Alizadeh A A et al., “Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling”, Nature Vol. 43, no. 6769, pp. 503–511, 2000.Google Scholar
  4. 4.
    Chakraborty A and Maka H, “Biclustering of gene expression data using genetic algorithm” Proceedings of Computation Intelligence in Bioinformatics and Computational Biology CIBCB, pp. 1–8, 2005.Google Scholar
  5. 5.
    Das S and Idicula S M, “A novel approach in greedy search algorithm for biclustering gene expression data” International Conference on Bioinformatics, Computational and Systems Biology (ICBCSB), Singapore, Aug 27–29, 2009.Google Scholar
  6. 6.
    Das S and Idicula S M, “Iterative search with incremental MSR difference threshold for biclustering gene expression data”, International Journal of Computer Applications, Vol. I, pp. 35–43, 2010.Google Scholar
  7. 7.
    Divina F and Aguilar-Ruize J S, “Biclustering of expression data with evolutionary computation”, IEEE Transactions on Knowledge and Data Engineering, Vol. 18, pp. 590–602, 2006.CrossRefGoogle Scholar
  8. 8.
    Das S and Idicula S M, “Biclustering gene expression data using MSR difference threshold”, International Proceedings of IEEE INDICON, pp. 1–4, 2009.Google Scholar
  9. 9.
    Yang J, Wang H, Wang W and Yu P, “Enhanced biclustering on expression data”, Proceedings of the Third IEEE Symposium on BioInformatics and BioEngineering (BIBE’03), pp. 321–327, 2003.Google Scholar
  10. 10.
    Zhang Z, Teo A, Ooi B C and Tan K L, “Mining deterministic biclusters in gene expression data”, Proceedings of the Fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE’04), pp. 283–292, 2004.Google Scholar
  11. 11.
    Banka H and Mitra S, “Multi-objective evolutionary biclustering of gene expression data”, Journal of Pattern Recognition, Vol. 39, pp. 2464–2477, 2006.CrossRefGoogle Scholar
  12. 12.
    Liu J, Lia Z and Liu F, “Multi-objective particle swarm optimization biclustering of microarray data”, IEEE International Conference on Bioinformatics and Biomedicine, pp. 363–366, 2008.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Computer ScienceCochin University of Science and TechnologyKochinIndia

Personalised recommendations