A Novel Fast Approach for Protein Classification and Evolutionary Analysis

IF 2.9 2区 化学 Q2 CHEMISTRY, MULTIDISCIPLINARY Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2023-04-01 DOI:10.46793/match.90-2.381a
Liang Ai, Jie Feng, Yu-Hua Yao
{"title":"A Novel Fast Approach for Protein Classification and Evolutionary Analysis","authors":"Liang Ai, Jie Feng, Yu-Hua Yao","doi":"10.46793/match.90-2.381a","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a new fast alignment-free method for protein sequence similarity and evolutionary analysis. First 20 natural amino acids are clustered into 6 groups based on their physicochemical properties, then a 12-dimensional vector is constructed based on the frequency and the average position of occurrence of amino acids in each reduced amino acid sequences. Finally, the Euclidean distance is used to measure the similarity and evolutionary distance between protein sequences. The test on three datasets shows that our method can cluster each protein sequence accurately, which illustrates the effective of our method.","PeriodicalId":51115,"journal":{"name":"Match-Communications in Mathematical and in Computer Chemistry","volume":null,"pages":null},"PeriodicalIF":2.9000,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Match-Communications in Mathematical and in Computer Chemistry","FirstCategoryId":"92","ListUrlMain":"https://doi.org/10.46793/match.90-2.381a","RegionNum":2,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we propose a new fast alignment-free method for protein sequence similarity and evolutionary analysis. First 20 natural amino acids are clustered into 6 groups based on their physicochemical properties, then a 12-dimensional vector is constructed based on the frequency and the average position of occurrence of amino acids in each reduced amino acid sequences. Finally, the Euclidean distance is used to measure the similarity and evolutionary distance between protein sequences. The test on three datasets shows that our method can cluster each protein sequence accurately, which illustrates the effective of our method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种新的快速蛋白质分类和进化分析方法
本文提出了一种新的蛋白质序列相似性和进化分析的快速无比对方法。首先根据20种天然氨基酸的理化性质将其聚为6类,然后根据氨基酸在每个还原氨基酸序列中出现的频率和平均位置构建一个12维向量。最后,利用欧几里得距离来度量蛋白质序列之间的相似性和进化距离。在三个数据集上的测试表明,我们的方法可以准确地聚类每个蛋白质序列,说明了我们的方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.40
自引率
26.90%
发文量
71
审稿时长
2 months
期刊介绍: MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.
期刊最新文献
ChemCNet: An Explainable Integrated Model for Intelligent Analyzing Chemistry Synthesis Reactions Asymptotic Distribution of Degree-Based Topological Indices Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs Sombor Index of Hypergraphs The ABC Index Conundrum's Complete Solution
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1