A novel part-wise template matching technique for DNA sequence similarity identification

M. Uddin, Mohammad Khairul Islam, Md. Rakib Hassan, Aysha Siddika Ratna, Farah Jahan
{"title":"A novel part-wise template matching technique for DNA sequence similarity identification","authors":"M. Uddin, Mohammad Khairul Islam, Md. Rakib Hassan, Aysha Siddika Ratna, Farah Jahan","doi":"10.1109/ICCIT57492.2022.10055778","DOIUrl":null,"url":null,"abstract":"The amount of DNA data is growing exponentially because of enormous applications including gene therapy, new variety development, and evolutionary history tracking. Recently, chaos, kmer count, histogram, and deep learning-based alignment-free (AF) algorithms are widely used for DNA sequence analysis. However, these methods have either high time complexity, memory consumption, or low precision rate. Hence, an optimal solution is needed. Therefore, in this research, a part-wise template matching-based novel similarity feature vector is extracted. Based on this vector, a phylogenetic tree is generated. The method is tested on two benchmark and four standard datasets and compared with recent existing studies. The method achieves 100% accuracy, consumes 10 to 70 times less memory than existing studies, and achieves top-rank benchmark results. Moreover, the required time of this method is very close to the existing best methods. Therefore, in real-time scenarios, industries can use this method with a great level of reliability.","PeriodicalId":255498,"journal":{"name":"2022 25th International Conference on Computer and Information Technology (ICCIT)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 25th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT57492.2022.10055778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The amount of DNA data is growing exponentially because of enormous applications including gene therapy, new variety development, and evolutionary history tracking. Recently, chaos, kmer count, histogram, and deep learning-based alignment-free (AF) algorithms are widely used for DNA sequence analysis. However, these methods have either high time complexity, memory consumption, or low precision rate. Hence, an optimal solution is needed. Therefore, in this research, a part-wise template matching-based novel similarity feature vector is extracted. Based on this vector, a phylogenetic tree is generated. The method is tested on two benchmark and four standard datasets and compared with recent existing studies. The method achieves 100% accuracy, consumes 10 to 70 times less memory than existing studies, and achieves top-rank benchmark results. Moreover, the required time of this method is very close to the existing best methods. Therefore, in real-time scenarios, industries can use this method with a great level of reliability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的部分模板匹配技术用于DNA序列相似性鉴定
由于基因治疗、新品种开发和进化历史追踪等巨大的应用,DNA数据的数量呈指数级增长。近年来,混沌、kmer计数、直方图和基于深度学习的无对齐(AF)算法被广泛用于DNA序列分析。然而,这些方法要么时间复杂度高,要么内存消耗大,要么精度低。因此,需要一个最优解。因此,本研究提取了一种基于部分模板匹配的新型相似度特征向量。基于此向量,生成系统发育树。在两个基准数据集和四个标准数据集上对该方法进行了测试,并与现有研究进行了比较。该方法达到了100%的准确率,比现有研究节省了10到70倍的内存,并获得了一流的基准测试结果。而且,该方法所需的时间与现有的最佳方法非常接近。因此,在实时场景中,行业可以使用这种方法,并具有很高的可靠性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SlotFinder: A Spatio-temporal based Car Parking System Land Cover and Land Use Detection using Semi-Supervised Learning Comparative Analysis of Process Scheduling Algorithm using AI models Throughput Optimization of IEEE 802.15.4e TSCH-Based Scheduling: A Deep Neural Network (DNN) Scheme Towards Developing a Voice-Over-Guided System for Visually Impaired People to Learn Writing the Alphabets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1