BetaMDGP: Protein structure determination algorithm based on the beta-complex

  • Seo, Jeongyeon
  • Kim, Jae Kwan
  • Ryu, Joonghyun
  • Lavor, Carlile
  • Mucherino, Antonio
  • 외 1명
Citations

SCOPUS

1

초록

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.

키워드

Beta-complexMolecular Distance Geometry ProblemProtein structure determinationQuasi-triangulationVoronoi DiagramAtomsComputational geometryGraphic methodsHeuristic algorithmsMolecular structureProteinsTriangulationBeta complexesMolecular distance geometry problemProtein structuresQuasi triangulationsVoronoi diagramsBioinformatics
제목
BetaMDGP: Protein structure determination algorithm based on the beta-complex
저자
Seo, JeongyeonKim, Jae KwanRyu, JoonghyunLavor, CarlileMucherino, AntonioKim, Deok Soo
DOI
10.1007/978-3-642-54212-1_7
발행일
2014-09
유형
Article
저널명
Lecture Notes in Computer Science
8360
페이지
130 ~ 155