A novel chemical property-based, alignment-free scalable feature extraction method for genomic data clustering

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Rajesh Dwivedi , Aruna Tiwari , Neha Bharill , Milind Ratnaparkhe , Saurabh Kumar Singh , Abhishek Tripathi
{"title":"A novel chemical property-based, alignment-free scalable feature extraction method for genomic data clustering","authors":"Rajesh Dwivedi ,&nbsp;Aruna Tiwari ,&nbsp;Neha Bharill ,&nbsp;Milind Ratnaparkhe ,&nbsp;Saurabh Kumar Singh ,&nbsp;Abhishek Tripathi","doi":"10.1016/j.compeleceng.2025.110175","DOIUrl":null,"url":null,"abstract":"<div><div>In numerous fields of biological research, the precise clustering of genome sequences is of paramount importance. However, the inherent complexity and high dimensionality of genomic data produce substantial obstacles in achieving robust and efficient clustering results via traditional analysis, i.e., alignment-based approaches. The use of alignment-free approaches is one of the significant steps to perform the clustering efficiently. However, the majority of existing alignment-free approaches lack scalability, making it difficult to efficiently process the vast amount of genomic sequences. Moreover, the majority of approaches only extract the k-mer-based features and ignore the other significant features based on the classification of nucleotides according to their chemical properties. So, in order to handle these challenges, we present a novel scalable feature extraction method that efficiently handles large-scale genome data using the Apache Spark framework by distributing the tasks on various nodes and extracting the significantly important features based on the classification of nucleotides using their chemical properties in terms of entropy and the length of the sequence. The clustering of genome sequences is performed by taking extracted features using K-means, Fuzzy c-means, and Hierarchical agglomerative clustering. Our findings show that the proposed method improves generalization across many realistic plant genome and benchmark datasets and allows for the accurate clustering of formerly ambiguous cases.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"123 ","pages":"Article 110175"},"PeriodicalIF":4.0000,"publicationDate":"2025-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Electrical Engineering","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045790625001181","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

In numerous fields of biological research, the precise clustering of genome sequences is of paramount importance. However, the inherent complexity and high dimensionality of genomic data produce substantial obstacles in achieving robust and efficient clustering results via traditional analysis, i.e., alignment-based approaches. The use of alignment-free approaches is one of the significant steps to perform the clustering efficiently. However, the majority of existing alignment-free approaches lack scalability, making it difficult to efficiently process the vast amount of genomic sequences. Moreover, the majority of approaches only extract the k-mer-based features and ignore the other significant features based on the classification of nucleotides according to their chemical properties. So, in order to handle these challenges, we present a novel scalable feature extraction method that efficiently handles large-scale genome data using the Apache Spark framework by distributing the tasks on various nodes and extracting the significantly important features based on the classification of nucleotides using their chemical properties in terms of entropy and the length of the sequence. The clustering of genome sequences is performed by taking extracted features using K-means, Fuzzy c-means, and Hierarchical agglomerative clustering. Our findings show that the proposed method improves generalization across many realistic plant genome and benchmark datasets and allows for the accurate clustering of formerly ambiguous cases.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Electrical Engineering
Computers & Electrical Engineering 工程技术-工程:电子与电气
CiteScore
9.20
自引率
7.00%
发文量
661
审稿时长
47 days
期刊介绍: The impact of computers has nowhere been more revolutionary than in electrical engineering. The design, analysis, and operation of electrical and electronic systems are now dominated by computers, a transformation that has been motivated by the natural ease of interface between computers and electrical systems, and the promise of spectacular improvements in speed and efficiency. Published since 1973, Computers & Electrical Engineering provides rapid publication of topical research into the integration of computer technology and computational techniques with electrical and electronic systems. The journal publishes papers featuring novel implementations of computers and computational techniques in areas like signal and image processing, high-performance computing, parallel processing, and communications. Special attention will be paid to papers describing innovative architectures, algorithms, and software tools.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信