{"title":"A natural number based linear time filtering approach to finding all occurrences of a DNA pattern","authors":"V. Le","doi":"10.1109/ICISIP.2006.4286078","DOIUrl":null,"url":null,"abstract":"String matching and searching techniques have been extensively studied in different research works. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task in linear time. In this paper, I propose a new searching approach based on the delivery of distinct natural numbers over a transition matrix of four nucleotides to find all occurrences of a DNA pattern in a given string. My algorithm has only Theta(n - 1) time complexity for the worst case with n to be the length of a given string s for a DNA pattern p of length m to be searched on.","PeriodicalId":187104,"journal":{"name":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fourth International Conference on Intelligent Sensing and Information Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISIP.2006.4286078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
String matching and searching techniques have been extensively studied in different research works. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task in linear time. In this paper, I propose a new searching approach based on the delivery of distinct natural numbers over a transition matrix of four nucleotides to find all occurrences of a DNA pattern in a given string. My algorithm has only Theta(n - 1) time complexity for the worst case with n to be the length of a given string s for a DNA pattern p of length m to be searched on.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
