{"title":"A novel approach of finding planted motif in biological sequences","authors":"Rumana Nazmul, A. Chowdhury, S. M. Tareeq","doi":"10.1109/ICCITECHN.2007.4579353","DOIUrl":null,"url":null,"abstract":"Motif finding is one of the most important and challenging tasks in computational biology. In this paper, a new algorithm for finding motif is presented. The strategy used in this paper speeds up the operations of finding the motif. Performance comparisons among the existing algorithms and proposed algorithm are also presented which shows that the proposed algorithm performs better in terms of accuracy and time complexity.","PeriodicalId":338170,"journal":{"name":"2007 10th international conference on computer and information technology","volume":"198 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 10th international conference on computer and information technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2007.4579353","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Motif finding is one of the most important and challenging tasks in computational biology. In this paper, a new algorithm for finding motif is presented. The strategy used in this paper speeds up the operations of finding the motif. Performance comparisons among the existing algorithms and proposed algorithm are also presented which shows that the proposed algorithm performs better in terms of accuracy and time complexity.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
