基于确定性退火的多蛋白结构比对

Luonan Chen
{"title":"基于确定性退火的多蛋白结构比对","authors":"Luonan Chen","doi":"10.1109/CSB.2003.1227421","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel method for solving multiple structure alignment problem, based on mean field annealing technique. We define the structure alignment as a mixed integer-programming (MIP) problem with the inter-atomic distances between two or more structures as an objective function[1]. The integer variables represent the marchings among structures whereas the continuous variables are translation vectors and rotation matrices with each protein structure as a rigid body. By exploiting the special structure of continuous partial problem, we transform the MIP into a nonlinear optimization problem (NOP) with a nonlinear objective function and linear constraints, based on mean field equations. To optimize the NOP, a mean field annealing procedure is adopted with a modified Potts spin model[2]. Since all linear constraints are embedded in the mean field equations, we do not need to add any penalty terms of the constraints to the error function. In other words, there is no \"soft constraint\" in our mean field model and all constraints are automatically satisfied during the annealing process, thereby not only making the optimization more efficiently but also eliminating unnecessary parameters of penalty that usually require careful tuning dependent on the problems.","PeriodicalId":147883,"journal":{"name":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","volume":"PP 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"Multiple protein structure alignment by deterministic annealing\",\"authors\":\"Luonan Chen\",\"doi\":\"10.1109/CSB.2003.1227421\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a novel method for solving multiple structure alignment problem, based on mean field annealing technique. We define the structure alignment as a mixed integer-programming (MIP) problem with the inter-atomic distances between two or more structures as an objective function[1]. The integer variables represent the marchings among structures whereas the continuous variables are translation vectors and rotation matrices with each protein structure as a rigid body. By exploiting the special structure of continuous partial problem, we transform the MIP into a nonlinear optimization problem (NOP) with a nonlinear objective function and linear constraints, based on mean field equations. To optimize the NOP, a mean field annealing procedure is adopted with a modified Potts spin model[2]. Since all linear constraints are embedded in the mean field equations, we do not need to add any penalty terms of the constraints to the error function. In other words, there is no \\\"soft constraint\\\" in our mean field model and all constraints are automatically satisfied during the annealing process, thereby not only making the optimization more efficiently but also eliminating unnecessary parameters of penalty that usually require careful tuning dependent on the problems.\",\"PeriodicalId\":147883,\"journal\":{\"name\":\"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003\",\"volume\":\"PP 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSB.2003.1227421\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSB.2003.1227421","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

摘要

本文提出了一种基于平均场退火技术求解多结构对准问题的新方法。我们将结构对齐定义为一个以两个或多个结构之间的原子间距离为目标函数[1]的混合整数规划(MIP)问题。整数变量表示结构间的移动,连续变量表示以每个蛋白质结构为刚体的平移向量和旋转矩阵。利用连续偏问题的特殊结构,将其转化为具有非线性目标函数和线性约束的非线性优化问题(NOP)。为了优化NOP,采用了修正波茨自旋模型[2]的平均场退火过程。由于所有的线性约束都嵌入在平均场方程中,我们不需要在误差函数中添加约束的任何惩罚项。换句话说,我们的平均场模型中没有“软约束”,在退火过程中自动满足所有约束,不仅使优化更有效,而且消除了通常需要根据问题仔细调整的不必要的惩罚参数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multiple protein structure alignment by deterministic annealing
In this paper, we propose a novel method for solving multiple structure alignment problem, based on mean field annealing technique. We define the structure alignment as a mixed integer-programming (MIP) problem with the inter-atomic distances between two or more structures as an objective function[1]. The integer variables represent the marchings among structures whereas the continuous variables are translation vectors and rotation matrices with each protein structure as a rigid body. By exploiting the special structure of continuous partial problem, we transform the MIP into a nonlinear optimization problem (NOP) with a nonlinear objective function and linear constraints, based on mean field equations. To optimize the NOP, a mean field annealing procedure is adopted with a modified Potts spin model[2]. Since all linear constraints are embedded in the mean field equations, we do not need to add any penalty terms of the constraints to the error function. In other words, there is no "soft constraint" in our mean field model and all constraints are automatically satisfied during the annealing process, thereby not only making the optimization more efficiently but also eliminating unnecessary parameters of penalty that usually require careful tuning dependent on the problems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信