Comparison Algorithm of Protein Sequences by Introducing a Lookup Table

Shin-ichi Nakayama, Masayuki Yoshida
{"title":"Comparison Algorithm of Protein Sequences by Introducing a Lookup Table","authors":"Shin-ichi Nakayama, Masayuki Yoshida","doi":"10.2477/JCHEMSOFT.3.97","DOIUrl":null,"url":null,"abstract":"The comparison algorithm of protein sequences by Murata was modified by considering only similarities between the same amino acid types and by introducing a lookup table. The modified algorithm calculates the similarity score between two protein sequences and aligns them. Computational times for calculating similarity scores against some proteins to all proteins in the Protein Sequence Database of the PIR by the system implementing our algorithm are about ten times shorter than those achieved by Murata. The alignments by our algorithm with a gap penalty of 18 are similar to those by Murata. The computational times by our system are two to three times slower, but the similarity scores are more sensitive than those by FASTA.","PeriodicalId":205210,"journal":{"name":"Journal of Chemical Software","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Chemical Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2477/JCHEMSOFT.3.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The comparison algorithm of protein sequences by Murata was modified by considering only similarities between the same amino acid types and by introducing a lookup table. The modified algorithm calculates the similarity score between two protein sequences and aligns them. Computational times for calculating similarity scores against some proteins to all proteins in the Protein Sequence Database of the PIR by the system implementing our algorithm are about ten times shorter than those achieved by Murata. The alignments by our algorithm with a gap penalty of 18 are similar to those by Murata. The computational times by our system are two to three times slower, but the similarity scores are more sensitive than those by FASTA.
引入查找表的蛋白质序列比较算法
对Murata的蛋白质序列比较算法进行了改进,只考虑相同氨基酸类型之间的相似性并引入查找表。改进后的算法计算两个蛋白质序列之间的相似性得分,并对它们进行比对。实现该算法的系统计算部分蛋白质与PIR蛋白质序列数据库中所有蛋白质的相似度分数的计算时间比Murata算法缩短了约10倍。我们的算法在间隙惩罚为18的情况下的对齐与Murata的相似。该算法的计算速度比FASTA算法慢2 ~ 3倍,但相似性评分比FASTA算法更敏感。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信