A Study of New Algorithm for Detecting Optimal Composition of Protein Discontinuous Fragments Alignment

C. Tung, Tzu-Wei Yen
{"title":"A Study of New Algorithm for Detecting Optimal Composition of Protein Discontinuous Fragments Alignment","authors":"C. Tung, Tzu-Wei Yen","doi":"10.1109/IIAI-AAI.2017.104","DOIUrl":null,"url":null,"abstract":"This study proposed a new algorithm, which targets the local structure of the functional protein and transforms it into 3D coordinates. It then performs the calculation and assessment of the protein structural fragment to identify the similarities in the local structure of the proteins and to estimate if these two proteins have the same functionality. During the process of calculation, a structure alignment was first used to perform rotation, panning, and super positioning of the two protein fragment groups, and calculate each coordinate in order to complete the graph. A minimum-spanning-tree algorithm was then used to determine whether the coordinates are suitable, and the unsuitable coordinates are deleted. At the end, the pair with the most similar structures in the fragment group was exported. The results of this study showed that the average accuracy of our testing data can be as high as 94.3%, and can be presented using a fully automated process. Users can easily identify similar fragments in local structures. In the future, we hope to conduct further studies on applications including identifying new effects or side effects of existing drugs.","PeriodicalId":281712,"journal":{"name":"2017 6th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIAI-AAI.2017.104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This study proposed a new algorithm, which targets the local structure of the functional protein and transforms it into 3D coordinates. It then performs the calculation and assessment of the protein structural fragment to identify the similarities in the local structure of the proteins and to estimate if these two proteins have the same functionality. During the process of calculation, a structure alignment was first used to perform rotation, panning, and super positioning of the two protein fragment groups, and calculate each coordinate in order to complete the graph. A minimum-spanning-tree algorithm was then used to determine whether the coordinates are suitable, and the unsuitable coordinates are deleted. At the end, the pair with the most similar structures in the fragment group was exported. The results of this study showed that the average accuracy of our testing data can be as high as 94.3%, and can be presented using a fully automated process. Users can easily identify similar fragments in local structures. In the future, we hope to conduct further studies on applications including identifying new effects or side effects of existing drugs.
蛋白质不连续片段比对最优组成检测新算法研究
本研究提出了一种新的算法,以功能蛋白的局部结构为目标,将其转化为三维坐标。然后对蛋白质结构片段进行计算和评估,以确定蛋白质局部结构的相似性,并估计这两个蛋白质是否具有相同的功能。在计算过程中,首先使用结构对准对两个蛋白质片段组进行旋转、平移和超定位,并计算每个坐标以完成图形。然后采用最小生成树算法确定坐标是否合适,并删除不合适的坐标。最后,导出片段组中结构最相似的对。本研究结果表明,我们的测试数据的平均准确度可高达94.3%,并且可以使用全自动化过程呈现。用户可以很容易地识别出局部结构中相似的片段。在未来,我们希望在应用方面进行进一步的研究,包括识别现有药物的新作用或副作用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信