A Fast Quad-Tree Based Two Dimensional Hierarchical Clustering

• Main Authors: Priscilla Rajadurai, Swamynathan Sankaranarayanan
• Format: Article
• Language: English
• Published: SAGE Publishing 2012-01-01
• Series: Bioinformatics and Biology Insights
• Online Access: https://doi.org/10.4137/BBI.S10383

Recently, microarray technologies have become a robust technique in the area of genomics. An important step in the analysis of gene expression data is the identification of groups of genes disclosing analogous expression patterns. Cluster analysis partitions a given dataset into groups based on specified features. Euclidean distance is a widely used similarity measure for gene expression data that considers the amount of changes in gene expression. However, the huge number of genes and the intricacy of biological networks have highly increased the challenges of comprehending and interpreting the resulting group of data, increasing processing time. The proposed technique focuses on a QT based fast 2-dimensional hierarchical clustering algorithm to perform clustering. The construction of the closest pair data structure is an each level is an important time factor, which determines the processing time of clustering. The proposed model reduces the processing time and improves analysis of gene expression data.