CFP last date
20 December 2024
Reseach Article

Application of Cardinality based GRASP to the Biclustering of Gene Expression Data

by Shyama Das, Sumam Mary Idicula
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 18
Year of Publication: 2010
Authors: Shyama Das, Sumam Mary Idicula
10.5120/384-575

Shyama Das, Sumam Mary Idicula . Application of Cardinality based GRASP to the Biclustering of Gene Expression Data. International Journal of Computer Applications. 1, 18 ( February 2010), 44-51. DOI=10.5120/384-575

@article{ 10.5120/384-575,
author = { Shyama Das, Sumam Mary Idicula },
title = { Application of Cardinality based GRASP to the Biclustering of Gene Expression Data },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 18 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 44-51 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number18/384-575/ },
doi = { 10.5120/384-575 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:46:41.864884+05:30
%A Shyama Das
%A Sumam Mary Idicula
%T Application of Cardinality based GRASP to the Biclustering of Gene Expression Data
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 18
%P 44-51
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Biclustering algorithms perform simultaneous row and column clustering of a given data matrix. In gene expression dataset a bicluster is a subset of genes that exhibit similar expression patterns through a subset of conditions. Biclustering is a useful data mining technique for identifying local patterns from gene expression data. In this paper biclusters are identified in two steps. In the first step high quality bicluster seeds are generated using K-Means clustering algorithm. These seeds are then enlarged using Cardinality based Greedy Randomized Adaptive Search Procedure (CGRASP) which is a multi-start metaheuristic method in which there are two phases, construction and local search. The Experimental results on the benchmark datasets prove that CGRASP is capable of identifying biclusters of high quality compared to many of the already existing biclustering algorithms. Moreover far better biclusters are obtained in this algorithm compared to the already existing algorithm based on the same GRASP metaheuristics.

References
  1. Madeira S. C. and Oliveira A. L., "Biclustering algorithms for Biological Data analysis: a survey" IEEE Transactions on computational biology and bioinformatics, 2004. pp. 24-45.
  2. J. A. Hartigan, "Direct clustering of Data Matrix", Journal of the American Statistical Association, 1972. Vol.67, no.337, pp. 123-129.
  3. Yizong Cheng and George M. Church, "Biclustering of expression data", Proc. 8th Int. Conf., Intelligent Systems for Molecular Biology, 2000. pp. 93-103.
  4. Tavazoie S., Hughes J. D., Campbell M. J., Cho R. J. and Church G. M., "Systematic determination of genetic network architecture", Nat. Genet., 1999. Vol. 22, no.3 pp. 281-285.
  5. Anupam Chakraborty and Hitashyam Maka "Biclustering of Gene Expression Data Using GeneticAlgorithm" Proceedings of Computation Intelligence in Bioinformatics and Computational Biology, CIBCB, 2005. pp. 1-8.
  6. Chakraborty A. and Maka H., "Biclustering of gene expression data by simulated annealing", HPCASIA 2005, pp. 627-632.
  7. Feo TA and Resende MGC "Greedy Randomized Adaptive Search Procedures", Journal of Global Optimization Vol. 6 1995. pp. 109-133.
  8. Mauricio G.C Resende and Celso C, Rebeiro, "Greedy Randomized Adaptive Search Procedures" in Handbook of Metaheuristics, Edited by Fred Glover and Gary A Kochenberger, Kluwer Academic Publishers, New York, 2003. p. 221.
  9. R.Cho, M.Campbell, E.Winzeler, L.Steinmetz, A.Conway, L.Wodika, T. Wolfsberg, A. Gabrielian, D. Landsman, D.Lockhart and R.Davis, "A Genome-Wide Transcriptional Analysis of the Mitotic Cell Cycle," Molecular Cell, 1998. Vol. 2, pp. 65-73.
  10. Alizadeh, A. A. et al., "Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling", Nature, 2000. Vol.43, no. 6769, pp. 503-11.
  11. Dharan S and Nair ASN, "Biclustering of gene expression data using greedy randomized adaptive search procedure", IEEE TENCON 2008. pp. 1-5.
  12. Smitha Dharan and Achuthsankar S Nair, "Cardinality based Greedy Randomized Adaptive Search Algorithm for the detection of biclusters in Microarray gene expression data", Proc. Int. Conf. Advanced Computing and Communication Technologies for High Performance Applications, 2008, Vol. 1, pp. 244-248.
  13. Smitha Dharan, Achuthsankar S. Nair, "Biclustering of Gene expression Data using Reactive Greedy Randomized Adaptive Search Procedure", BMC Bioinformatics, 2009. Vol. 10, Suppl 1: s27.
  14. Federico Divina and Jesus S. Aguilar-Ruize, "Biclustering of Expression Data with Evolutionary computation", IEEE Transactions on Knowledge and Data Engineering, 2006. Vol. 18, pp. 590-602.
  15. J. Yang, H. Wang, W. Wang and P. Yu, "Enhanced Biclustering on Expression Data", Proc. Third IEEE Symp. BioInformatics and BioEng. (BIBE'03), 2003. pp. 321-327.
  16. Z. Zhang, A. Teo, B. C. Ooi, K. L. Tan, "Mining deterministic biclusters in gene expression data", In: Proceedings of the fourth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'04), 2004, pp. 283-292.
  17. Banka H. and Mitra S., "Multi-objective Evolutionary biclustering of gene expression data", Journal of Pattern Recognition, 2006. Vol.39, pp. 2464-2477.
Index Terms

Computer Science
Information Sciences

Keywords

Network Security Cryptography Password Authentication Protocol Smart Card Hash Function