BMC Bioinformatics | |
Structure-based Markov random field model for representing evolutionary constraints on functional sites | |
Methodology Article | |
Dongsup Kim1  Chan-Seok Jeong1  | |
[1] Department of Bio and Brain Engineering, Korea Advanced Institute of Science and Technology (KAIST), 291 Daehak-ro, Yuseong-gu, 34141, Daejeon, Republic of Korea; | |
关键词: Markov random field; Coevolution analysis; Protein structure; Functional site; Catalytic site; Allosteric site; | |
DOI : 10.1186/s12859-016-0948-2 | |
received in 2015-10-31, accepted in 2016-02-15, 发布年份 2016 | |
来源: Springer | |
【 摘 要 】
BackgroundElucidating the cooperative mechanism of interconnected residues is an important component toward understanding the biological function of a protein. Coevolution analysis has been developed to model the coevolutionary information reflecting structural and functional constraints. Recently, several methods have been developed based on a probabilistic graphical model called the Markov random field (MRF), which have led to significant improvements for coevolution analysis; however, thus far, the performance of these models has mainly been assessed by focusing on the aspect of protein structure.ResultsIn this study, we built an MRF model whose graphical topology is determined by the residue proximity in the protein structure, and derived a novel positional coevolution estimate utilizing the node weight of the MRF model. This structure-based MRF method was evaluated for three data sets, each of which annotates catalytic site, allosteric site, and comprehensively determined functional site information. We demonstrate that the structure-based MRF architecture can encode the evolutionary information associated with biological function. Furthermore, we show that the node weight can more accurately represent positional coevolution information compared to the edge weight. Lastly, we demonstrate that the structure-based MRF model can be reliably built with only a few aligned sequences in linear time.ConclusionsThe results show that adoption of a structure-based architecture could be an acceptable approximation for coevolution modeling with efficient computation complexity.
【 授权许可】
CC BY
© Jeong and Kim. 2016
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO202311104889083ZK.pdf | 2258KB | download | |
MediaObjects/12888_2023_5202_MOESM1_ESM.docx | 29KB | Other | download |
12951_2015_155_Article_IEq78.gif | 1KB | Image | download |
40538_2023_473_Article_IEq1.gif | 1KB | Image | download |
Fig. 8 | 474KB | Image | download |
MediaObjects/12951_2023_2117_MOESM1_ESM.docx | 4908KB | Other | download |
Fig. 1 | 258KB | Image | download |
12951_2016_246_Article_IEq7.gif | 1KB | Image | download |
Fig. 8 | 2685KB | Image | download |
【 图 表 】
Fig. 8
12951_2016_246_Article_IEq7.gif
Fig. 1
Fig. 8
40538_2023_473_Article_IEq1.gif
12951_2015_155_Article_IEq78.gif
【 参考文献 】
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [24]
- [25]
- [26]
- [27]
- [28]
- [29]
- [30]
- [31]
- [32]
- [33]
- [34]
- [35]
- [36]
- [37]
- [38]
- [39]