Scholarlink

<p>Feature extraction is crucial in bioinformatics, as it converts genomic sequences into numerical feature vectors essential for machine learning algorithms, particularly in clustering, to identify the families of newly sequenced genomes. Traditional methods have relied on alignment-based techniques for clustering the genomic sequences. However, these methods are computationally intensive. In contrast, alignment-free methods are now more commonly used due to their reduced computational demands. Despite this, many alignment-free approaches may generate identical feature vectors for dissimilar sequences, as they focus solely on single nucleotide counts (1-gram) and their arrangement during feature extraction, often neglecting dinucleotide counts and their arrangement, which can degrade clustering performance. Furthermore, certain approaches include trinucleotide or higher-order compositions; they introduce high-dimensionality issues, resulting in inaccurate results. Additionally, some existing methods are not scalable and take substantial time to extract features from large genomic sequences. To address these issues, we proposed a novel 33-dimensional Scalable Alignment-Free Feature Vector (33d-SAFFV) approach to extract the significantly important features such as length of sequence, count of dinucleotides, and positional sum of dinucleotides, which produces a 33-dimensional feature vector. This approach leverages Apache Spark for scalability and efficient in-memory computations, making it suitable for large datasets. We evaluated the performance of our proposed method by applying the extracted 33-dimensional feature vectors to K-Means and Fuzzy C-Means (FCM) clustering algorithms. Performance is measured using the Silhouette Index (SI) and Calinski-Harabasz (CH) index. Experimental results on the gene sequences of four varieties of rice datasets and two varieties of soybean datasets show the effectiveness of the proposed 33d-SAFFV approach. In K-Means clustering with three clusters, the proposed method achieves an average increase of at least 8.66% in the SI value and 7.54% in the CH index. Similarly, in FCM clustering with three clusters, the proposed approach shows an average increase of at least 10.14% in the SI value and 9.88% in the CH index. These results clearly indicate that the proposed 33d-SAFFV approach outperforms other state-of-the-art methods.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Scalable alignment-free feature extraction approach for genome data and their cluster analysis

  • 期刊论文

  • 发表日期：

    2025年4月26日

查看全文
  • Abhishek Tripathi,
  • Aruna Tiwari,
  • Narendra S. Chaudhari,
  • Milind Ratnaparkhe,
  • Neha Bharill,
  • Preeti Jha,
  • Rajesh Dwivedi

摘要

Feature extraction is crucial in bioinformatics, as it converts genomic sequences into numerical feature vectors essential for machine learning algorithms, particularly in clustering, to identify the families of newly sequenced genomes. Traditional methods have relied on alignment-based techniques for clustering the genomic sequences. However, these methods are computationally intensive. In contrast, alignment-free methods are now more commonly used due to their reduced computational demands. Despite this, many alignment-free approaches may generate identical feature vectors for dissimilar sequences, as they focus solely on single nucleotide counts (1-gram) and their arrangement during feature extraction, often neglecting dinucleotide counts and their arrangement, which can degrade clustering performance. Furthermore, certain approaches include trinucleotide or higher-order compositions; they introduce high-dimensionality issues, resulting in inaccurate results. Additionally, some existing methods are not scalable and take substantial time to extract features from large genomic sequences. To address these issues, we proposed a novel 33-dimensional Scalable Alignment-Free Feature Vector (33d-SAFFV) approach to extract the significantly important features such as length of sequence, count of dinucleotides, and positional sum of dinucleotides, which produces a 33-dimensional feature vector. This approach leverages Apache Spark for scalability and efficient in-memory computations, making it suitable for large datasets. We evaluated the performance of our proposed method by applying the extracted 33-dimensional feature vectors to K-Means and Fuzzy C-Means (FCM) clustering algorithms. Performance is measured using the Silhouette Index (SI) and Calinski-Harabasz (CH) index. Experimental results on the gene sequences of four varieties of rice datasets and two varieties of soybean datasets show the effectiveness of the proposed 33d-SAFFV approach. In K-Means clustering with three clusters, the proposed method achieves an average increase of at least 8.66% in the SI value and 7.54% in the CH index. Similarly, in FCM clustering with three clusters, the proposed approach shows an average increase of at least 10.14% in the SI value and 9.88% in the CH index. These results clearly indicate that the proposed 33d-SAFFV approach outperforms other state-of-the-art methods.