生物信息学:提出的局部比对升级Smith-Waterman算法的实现

2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology Pub Date : 2009-03-30 DOI:10.1109/CIBCB.2009.4925712

Md. Shihabuddin Sadi, Abu Z. Mohammad Sami, I. Ahmed, A. B. M. Ruhunnabi, Nirmalendu Das

{"title":"生物信息学:提出的局部比对升级Smith-Waterman算法的实现","authors":"Md. Shihabuddin Sadi, Abu Z. Mohammad Sami, I. Ahmed, A. B. M. Ruhunnabi, Nirmalendu Das","doi":"10.1109/CIBCB.2009.4925712","DOIUrl":null,"url":null,"abstract":"This paper presents a new algorithm for local alignment search which has less computational complexity than the Smith-Waterman algorithm. Increasing the accuracy of sequence matching and reducing computational complexity is a grand challenge to bioinformatics computing. The proposed Algorithm is a more competent local alignment searching Algorithm since it reduces running time well enough to search a database in order to find.","PeriodicalId":162052,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Bioinformatics: Implementation of a proposed upgraded Smith-Waterman algorithm for local alignment\",\"authors\":\"Md. Shihabuddin Sadi, Abu Z. Mohammad Sami, I. Ahmed, A. B. M. Ruhunnabi, Nirmalendu Das\",\"doi\":\"10.1109/CIBCB.2009.4925712\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new algorithm for local alignment search which has less computational complexity than the Smith-Waterman algorithm. Increasing the accuracy of sequence matching and reducing computational complexity is a grand challenge to bioinformatics computing. The proposed Algorithm is a more competent local alignment searching Algorithm since it reduces running time well enough to search a database in order to find.\",\"PeriodicalId\":162052,\"journal\":{\"name\":\"2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIBCB.2009.4925712\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIBCB.2009.4925712","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文提出了一种比Smith-Waterman算法计算复杂度更低的局部对齐搜索算法。提高序列匹配的准确性和降低计算复杂度是生物信息学计算面临的重大挑战。本文提出的算法是一种更有效的局部对齐搜索算法，因为它可以很好地减少运行时间，以便在数据库中查找。

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

查看原文本刊更多论文

Bioinformatics: Implementation of a proposed upgraded Smith-Waterman algorithm for local alignment

This paper presents a new algorithm for local alignment search which has less computational complexity than the Smith-Waterman algorithm. Increasing the accuracy of sequence matching and reducing computational complexity is a grand challenge to bioinformatics computing. The proposed Algorithm is a more competent local alignment searching Algorithm since it reduces running time well enough to search a database in order to find.

求助全文

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

来源期刊

2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology

自引率

0.00%

发文量