BetaMDGP: Protein Structure Determination Algorithm Based on the Beta-complex

Abstract : The molecular distance geometry problem (MDGP) is a fundamental problem in determining molecular structures from the NMR data. We present a heuristic algorithm, the BetaMDGP, which outperforms existing algorithms for solving the MDGP. The BetaMDGP algorithm is based on the beta-complex, which is a geometric construct extracted from the quasi-triangulation derived from the Voronoi diagram of atoms. Starting with an initial tetrahedron defined by the centers of four closely located atoms, the BetaMDGP determines a molecular structure by adding one shell of atoms around the currently determined substructure using the beta-complex. The proposed algorithm has been entirely implemented and tested with atomic arrangements stored in an NMR format created from PDB files. Experimental results are also provided to show the powerful capability of the proposed algorithm.
Type de document :
Chapitre d'ouvrage
M.L. Gavrilova; C.J.K. Tan. Transactions on Computational Science XXII, Lecture Notes in Computer Science (8360), Springer, pp.130-155, 2014, 〈http://link.springer.com/chapter/10.1007%2F978-3-642-54212-1_7〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01093066
Contributeur : Antonio Mucherino <>
Soumis le : mercredi 10 décembre 2014 - 10:03:10
Dernière modification le : mardi 16 janvier 2018 - 15:54:20

Identifiants

  • HAL Id : hal-01093066, version 1

Citation

Jeongyeon Seo, Jae-Kwan Kim, Joonghyun Ryu, Carlile Lavor, Antonio Mucherino, et al.. BetaMDGP: Protein Structure Determination Algorithm Based on the Beta-complex. M.L. Gavrilova; C.J.K. Tan. Transactions on Computational Science XXII, Lecture Notes in Computer Science (8360), Springer, pp.130-155, 2014, 〈http://link.springer.com/chapter/10.1007%2F978-3-642-54212-1_7〉. 〈hal-01093066〉

Partager

Métriques

Consultations de la notice

475