一种寻找生物序列中植入基序的新方法

2007 10th international conference on computer and information technology Pub Date : 2007-12-01 DOI:10.1109/ICCITECHN.2007.4579353

Rumana Nazmul, A. Chowdhury, S. M. Tareeq

{"title":"一种寻找生物序列中植入基序的新方法","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":"{\"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}","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

摘要

Motif发现是计算生物学中最重要和最具挑战性的任务之一。本文提出了一种寻找基序的新算法。本文所采用的策略加快了寻找母题的操作。通过对现有算法和本文算法的性能比较，表明本文算法在精度和时间复杂度方面具有更好的性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A novel approach of finding planted motif in biological sequences

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 10th international conference on computer and information technology

自引率

0.00%

发文量