References

Abhishek, K., 2006. Clustering genes and inferring gene regulatory networks using multiple information sources. Ph.D Thesis, Indian Institute of Technology Kanpur, Kanpur, India.

Ashok, S. and M. Judy, 2016. Exploring key gene interactions using particle swarm optimization. Intl. J. Pharma Bio Sci., 7: 734-741.
Direct Link  |  

Ashok, S. and M.V. Judy, 2015. A novel iterative partitioning approach for building prime clusters. Intl. J. Adv. Intell. Paradigms, 7: 313-325.
Direct Link  |  

Chapman, T. and A. Kalyanaraman, 2011. An OpenMP algorithm and implementation for clustering biological graphs. Proceedings of the 1st Workshop on Irregular Applications: Architectures and Algorithms, November 13, 2011, ACM, New York, USA., ISBN:978-1-4503-1121-2, pp: 3-10.

Chaudhari, D. and V. Shah, 2015. MRI brain image segmentation using MST. Intl. J. Adv. Res. Electr. Electron. Instrumentation Eng., 4: 5386-5390.
CrossRef  |  Direct Link  |  

Hruz, T., M. Wyss, C. Lucas, O. Laule and V.P. Rohr et al., 2013. A multilevel gamma-clustering layout algorithm for visualization of biological networks. Adv. Bioinf., 2013: 1-10.
PubMed  |  Direct Link  |  

Jain, A.K., 2010. Data clustering: 50 years beyond K-means. Pattern Recogn. Lett., 31: 651-666.
CrossRef  |  Direct Link  |  

Johnson, D.B. and P. Metaxas, 1992. A parallel algorithm for computing minimum spanning trees. Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, June 29-July 1, 1992, ACM, San Diego, California, USA., ISBN:0-89791-483-X, pp: 363-372.

Katajainen, J. and O. Nevalainen, 1983. An alternative for the implementation of kruskal’s minimal spanning tree algorithm. Sci. Comput. Program., 3: 205-216.
Direct Link  |  

Li, X. and F. Zhu, 2013. On clustering algorithms for biological data. Eng., 5: 549-552.
Direct Link  |  

Olman, V., F. Mao, H. Wu and Y. Xu, 2009. Parallel clustering algorithm for large data sets with applications in bioinformatics. IEEE. ACM. Trans. Comput. Biol. Bioinf., 6: 344-352.
CrossRef  |  Direct Link  |  

Pirim, H., B. Ekşioglu and A.D. Perkins, 2015. Clustering high throughput biological data with B-MST, a minimum spanning tree based heuristic. Comput. Biol. Med., 62: 94-102.
PubMed  |  Direct Link  |  

Pramanik, S., U.N. Chowdhury, B.K. Pramanik and N. Huda, 2010. A comparative study of bagging, boosting and C4.5: The recent improvements in decision tree learning algorithm. Asian J. Inform. Technol., 9: 300-306.
Direct Link  |  

Qiu, P., A.J. Gentles and S.K. Plevritis, 2011. Discovering biological progression underlying microarray samples. PLoS. Comput. Biol., 7: 1-11.
PubMed  |  Direct Link  |  

Qiu, P., E.F. Simonds, S.C. Bendall, J.K.D. Gibbs and R.V. Bruggner et al., 2011. Extracting a cellular hierarchy from high-dimensional cytometry data with SPADE. Nat. Biotechnol., 29: 886-891.
CrossRef  |  PubMed  |  Direct Link  |  

Schaeffer, E.S., 2007. Graph clustering. Comput. Sci. Rev., 1: 27-64.
Direct Link  |  

Sonumol, N.S., V.R. Uma, S. Ashok and M.V. Judy, 2015. Community detection in multidimensional genomic dataset. Intl. J. Artif. Intell., 13: 109-117.
Direct Link  |  

Speer, N., C. Spieth and A. Zell, 2004. A memetic co-clustering algorithm for gene expression profiles and biological annotation. Proceedings of the Congress on Evolutionary Computation Vol. 2, June 19-23, 2004, IEEE, Portland, Oregon, USA., ISBN:0-7803-8515-2, pp: 1631-1638.

Sreeja, A. and U. Krishnakumar, 2017. Gene ontology based functional analysis and graph theory for partitioning gene interaction networks. Intl. J. Pharma Bio Sci., 8: 183-192.
Direct Link  |  

Topaloglou, T., S.B. Davidson, H.V. Jagadish, V.M. Markowitz and E.W. Steeg et al., 2004. Biological data management: Research, practice and opportunities. Proceedings of the 13th International Conference on Very Large Data Bases Vol. 30, August 31-September 3, 2004, VLDB Endowment, Toronto, Canada, ISBN:0-12-088469-0, pp: 1233-1236.

Tzanis, G., C. Berberidis and I.P. Vlahavas, 2005. Biological Data Mining. In: Encyclopedia of Database Technologies and Applications, Laura, R.C. (Ed.). Idea Group, Hershey, London, Melbourne, pp: 35-41.

Wang, Z., D. Huang, H. Meng and C. Tang, 2013. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation. Biosyst., 114: 1-7.
PubMed  |  Direct Link  |  

Xu, Y., V. Olman and D. Xu, 2001. Minimum spanning trees for gene expression data clustering. Genome Inf., 12: 24-33.
Direct Link  |