DNA模式匹配算法的性能评价

I. Aziz, S.Shoaib, K.S.Khurshid, T.Ahmad, M.Awais
{"title":"DNA模式匹配算法的性能评价","authors":"I. Aziz, S.Shoaib, K.S.Khurshid, T.Ahmad, M.Awais","doi":"10.57041/pjs.v74i3.785","DOIUrl":null,"url":null,"abstract":"Bioinformatics is a new area of research in which DNA, RNA and proteinssequences are dealt. To store, retrieve, analyze, match, align, search, and process these sequencesdifferent techniques are existed. Currently a lot of advancements in sequence analysis cause the drasticincrease in the DNA database sizes that require more efficient approaches encompass accuracy. Searchand analysis of DNA patterns can be performed by using various pattern matching algorithms in thecomputational biology. The aim of present study is to present taxonomy and performance evaluation ofthese pattern matching algorithms. The objective of this SLR is to set a research trend and to find amathematical model to estimate execution search time before scanning whole DNA sequence byfollowing a search strategy.","PeriodicalId":19787,"journal":{"name":"Pakistan journal of science","volume":"19 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PERFORMANCE EVALUATION OF DNA PATTERN MATCHING ALGORITHMS\",\"authors\":\"I. Aziz, S.Shoaib, K.S.Khurshid, T.Ahmad, M.Awais\",\"doi\":\"10.57041/pjs.v74i3.785\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bioinformatics is a new area of research in which DNA, RNA and proteinssequences are dealt. To store, retrieve, analyze, match, align, search, and process these sequencesdifferent techniques are existed. Currently a lot of advancements in sequence analysis cause the drasticincrease in the DNA database sizes that require more efficient approaches encompass accuracy. Searchand analysis of DNA patterns can be performed by using various pattern matching algorithms in thecomputational biology. The aim of present study is to present taxonomy and performance evaluation ofthese pattern matching algorithms. The objective of this SLR is to set a research trend and to find amathematical model to estimate execution search time before scanning whole DNA sequence byfollowing a search strategy.\",\"PeriodicalId\":19787,\"journal\":{\"name\":\"Pakistan journal of science\",\"volume\":\"19 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pakistan journal of science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.57041/pjs.v74i3.785\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pakistan journal of science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.57041/pjs.v74i3.785","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

生物信息学是研究DNA、RNA和蛋白质序列的一个新领域。为了存储、检索、分析、匹配、对齐、搜索和处理这些序列,存在不同的技术。目前,序列分析的许多进步导致DNA数据库规模的急剧增加,这需要更有效的方法包括准确性。DNA模式的搜索和分析可以通过使用计算生物学中的各种模式匹配算法来执行。本研究的目的是提出这些模式匹配算法的分类和性能评价。本研究的目标是建立一个研究趋势,并找到一个数学模型来估计执行搜索时间,然后按照搜索策略扫描整个DNA序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PERFORMANCE EVALUATION OF DNA PATTERN MATCHING ALGORITHMS
Bioinformatics is a new area of research in which DNA, RNA and proteinssequences are dealt. To store, retrieve, analyze, match, align, search, and process these sequencesdifferent techniques are existed. Currently a lot of advancements in sequence analysis cause the drasticincrease in the DNA database sizes that require more efficient approaches encompass accuracy. Searchand analysis of DNA patterns can be performed by using various pattern matching algorithms in thecomputational biology. The aim of present study is to present taxonomy and performance evaluation ofthese pattern matching algorithms. The objective of this SLR is to set a research trend and to find amathematical model to estimate execution search time before scanning whole DNA sequence byfollowing a search strategy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信