
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Victor Olman, Fenglou Mao, Hongwei Wu, Ying Xu, "Parallel Clustering Algorithm for Large Data Sets with Applications in Bioinformatics," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 6, no. 2, pp. 344352, AprilJune, 2009.  
BibTex  x  
@article{ 10.1109/TCBB.2007.70272, author = {Victor Olman and Fenglou Mao and Hongwei Wu and Ying Xu}, title = {Parallel Clustering Algorithm for Large Data Sets with Applications in Bioinformatics}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {6}, number = {2}, issn = {15455963}, year = {2009}, pages = {344352}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2007.70272}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Parallel Clustering Algorithm for Large Data Sets with Applications in Bioinformatics IS  2 SN  15455963 SP344 EP352 EPD  344352 A1  Victor Olman, A1  Fenglou Mao, A1  Hongwei Wu, A1  Ying Xu, PY  2009 KW  Pattern recognition KW  clustering algorithm KW  genome application KW  parallel processing. VL  6 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] S.F. Altschul et al., “Gapped BLAST and PSIBLAST: A New Generation of Protein Database Search Programs,” Nucleic Acids Research, vol. 25, pp. 33893402, 1997.
[2] D.A. Bader and G. Cong, “A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs),” J. Parallel and Distributed Computing, vol. 65, no. 9, pp. 9941006, 2005.
[3] J.L. Bentley, “Parallel Algorithm for Constructing Minimum Spanning Trees,” J. Algorithms, vol. 1, pp. 5159, 1980.
[4] J.C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum Press, 1981.
[5] C.M. Bishop, Neural Networks for Pattern Recognition. Oxford Univ. Press, 1995.
[6] O. Borůvka, “O jistém problému minimálnim. Práce Mor.Přorodovd,” Spol. v Brn (Acta Societ. Natur. Moravicae), vol. 3, pp.3758, 1926.
[7] C. Dass, An Introduction to Biological Mass Spectrometry. John Wiley & Sons, 2002.
[8] R. Dementiev, P. Sanders, and D. Schultes, “Engineering an Eternal Memory Minimum Spanning Tree Algorithm,” Proc. Third IFIP Int'l Conf. Theoretical Computer Science (TCS '04), pp.195208, 2004.
[9] Z. Du and F. Lin, “A Novel Approach for Hierarchical Clustering,” Parallel Computing, vol. 31, no. 5, pp. 523527, 2005.
[10] A.J. Enright, S. Van Dongen1, and S.A. Ouzounis, “An Efficient Algorithm for LargeScale Detection of Protein Families,” Nucleic Acids Research, vol. 30, no. 7, pp. 15751584, 2002.
[11] R.D. Finn et al., “PFAM: Clans, Web Tools and Services,” Nucleic Acids Research, vol. 34, pp. 247251, 2006.
[12] H.R. Gregorius, “The Isolation Approach to Hierarchical Clustering,” J. Classification, vol. 21, pp. 5169, 2004.
[13] D.B. Johnson and P. Metaxas, “A Parallel Algorithm for Computing Minimum Spanning Trees,” Proc. Fourth Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '92), pp. 363372, 1992.
[14] X. Li and Z. Fang, “Parallel Clustering Algorithms,” Parallel Computing, vol. 11, pp. 275290, 1989.
[15] TwoHybrid Systems: Methods and Protocols (Methods in Molecular Biology), P.N. Macdonald, ed., vol. 177. The Humana Press Inc., 2001.
[16] F. Murtagh, “Clustering in Massive Data Sets,” Handbook of Massive Data Sets, pp. 501543, 2002.
[17] V. Olman, D. Xu, and Y. Xu, “CUBIC: Identification of Regulatory Binding Sites through Data Clustering,” J. Bioinformatics and Computational Biology, vol. 1, no. 1, pp. 2140, 2003.
[18] V. Olman, C. Hicks, P. Wang, and X. Ying, “Gene Expression Data Analysis in Subtypes of Ovarian Cancer Using Covariance Analysis,” J. Bioinformatics and Computational Biology, vol. 4, no. 5, pp. 9991013, 2006.
[19] C.F. Olson, “Parallel Algorithms for Hierarchical Clustering,” Parallel Computing, vol. V21, pp. 13131325, 1995.
[20] E.M. Rasmussen and P. Willet, “Efficiency of Hierarchical Agglomerative Clustering Using ICL Distributed Array Processors,” J. Documentation, vol. 45, no. 1, pp. 124, 1989.
[21] H.C. Romesburg, Cluster Analysis for Researchers, 2004.
[22] Handbook of Discrete and Combinatorial Mathematics, K.H.Rosen, ed. CRC Press, 1999.
[23] R. Sibson, “SLINK: An Optimally Efficient Algorithm for the Single Link Cluster Methods,” Computer J., vol. 16, pp. 3034, 1973.
[24] R.L. Tatusov, E.V. Koonin, and D.J. Lipman, “A Genomic Perspective on Protein Families,” Science, vol. 278, pp. 631637, 1997.
[25] R.L. Tatusov, D.A. Natale, I.V. Garkavtsev, T.A. Tatusova, U.T. Shankavaram, B.S. Rao, B. Kiryutin, M.Y. Galperin, N.D. Fedorova, and E.V. Koonin, “The COG Database: NewDevelopments in Phylogenetic Classification of Proteins from Complete Genomes,” Nucleic Acids Research, vol. 29, pp.2228, 2001.
[26] S.S. Wilks, Mathematical Statistics. John Wiley & Sons, 1962.
[27] H. Wu, F. Mao, V. Olman, and Y. Xu, “Accurate Prediction of Orthologous Gene Groups in Microbes,” Proc. IEEE Computational Systems Bioinformatics Conf. (CSB '05), pp. 7379, 2005.
[28] H. Wu, Z. Su, F. Mao, V. Olman, and Y. Xu, “Prediction of Functional Modules through Comparative Genome Analysis and Application of Gene Ontology,” Nucleic Acids Research, vol. 33, pp.28222837, 2005.
[29] H. Wu, F. Mao, V. Olman, and X. Ying, “Hierarchical Classification of Functionally Equivalent Genes of Prokaryotes,” Nuclear Acids Research, vol. 35, pp. 21252140, 2007.
[30] Y. Xu, V. Olman, and D. Xu, “Clustering Gene Expression Data Using a GraphTheoretic Approach: An Application of Minimum Spanning Tree,” Bioinformatics, vol. 18, no. 4, pp. 526535, 2001.