The week's pick
Random Articles
Reseach Article
Biclustering of Gene Expression Data using a Two - Phase Method
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 103 - Number 13 |
| Year of Publication: 2014 |
| Authors: Madhuleena Das, Bhogeswar Borah |
10.5120/18132-9232
|
Madhuleena Das, Bhogeswar Borah . Biclustering of Gene Expression Data using a Two - Phase Method. International Journal of Computer Applications. 103, 13 ( October 2014), 6-10. DOI=10.5120/18132-9232
Abstract
Biclustering is a very useful data mining technique which identifies coherent patterns from microarray gene expression data. A bicluster of a gene expression dataset is a subset of genes which exhibit similar expression patterns along a subset of conditions. Biclustering is a powerful analytical tool for the biologist and has generated considerable interest over the past few decades. Many biclustering algorithms optimize a mean squared residue to discover biclusters from a gene expression dataset. In this paper a Two-Phase method of finding a bicluster is developed. In the first phase, a modified version of k-means algorithm is applied to the gene expression data to generate k clusters. In the second phase, an iterative search is performed to check the possibility of removing more genes and conditions within the given threshold value of mean squared residue score. Experimental results on yeast dataset show that our approach can effectively find high quality biclusters
References
- Shyama Das, Sumam and Mary Idicula, " Application of Greedy Randomized Adaptive Search Procedure to the Biclustering of Gene Expression Data ", International Journal of Computer Applications, Volume 2 – No. 3, pp. 0975-8887, 2010.
- S. C. Madeira and A. L. Oliveira, "Biclustering Algorithms for Biological Data Analysis: A Survey", IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1, 24-45, 2004.
- Doruk Bozdag, Ashwin S. Kumar and Umit V. Catalyurek, Comparative Analysis of Biclustering Algorithms, 2010.
- S. Bergmann, J. Ihmels, N. Barkai, "Iterative Signature Algorithm for the Analysis of Large-scale Gene Expression Data", Phys Rev E Stat Nonlin SoftMatter Phys, 67(3), 031902, 2003.
- A. Prelic, S. Bleuler, P. Zimmerman and E. Zitzler, "A Systematic Comparison and Evaluation of Biclustering Methods for Gene Expression Data", Bioinformatics 22(9), 1122-1129, 2006.
- J. A. Hartigan, "Clustering Algorithms", New York: John Willey and Sons, Inc, 1975.
- A. Tanay, R. Sharan and R. Shamir, "Discovering Statistically Significant Biclusters in Gene Expression Data, Bioinformatics", 18, 136S-144, 2002.
- Y. Cheng and G. Church, "Biclustering of Expression Data", "Int'l Conf. " on Intelligent Systems for Molecular Biology, 93-103, 2000.
- S. Busygin, G. jacobsen, and E. Kramer, "Double Conjugated Clustering Applied to Leukemia Microarray Data" Proc. Second SIAM Int'l Conf. Data Mining, Workshop Clustering High Dimensional Data, 2002.
- A. Ben-Dor, B. Chor, R. Karp, and Z. Yakhini, "Discovering Local Structure in Gene Expression Data: The Order-Preserving Sub-Matrix Problem", Proc. Of the 6th Ann. Int'l Conf on Computational Biology, 1-58113-498-3, 49-57,2002.
- L. Lazzeroni and A. Owen, "Plaid Models for Gene Expression Data", technical report, Stanford Univ. , 2000.
- SGD GO Termfinder [http://db. yeastgenome. org/cgi-bin/GO/goTermFinder]
Index Terms
Keywords