IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v57y2013i1p217-250.html
   My bibliography  Save this article

Protein structure optimization by side-chain positioning via beta-complex

Author

Listed:
  • Joonghyun Ryu
  • Deok-Soo Kim

Abstract

A molecular structure determines a molecular function(s) and a correct understanding of molecular structure is important for biotechnology. The computational prediction of molecular structure is a frequent requirement for important biomolecular applications such as a homology modeling, a docking simulation, a protein design, etc. where the optimization of molecular structure is fundamental. One of the core problems in the optimization of protein structure is the optimization of side-chains called the side-chain positioning problem. The side-chain positioning problem, assuming the rigidity of backbone and a rotamer library, attempts to optimally assign a rotamer to each residue so that the potential energy of protein is minimized in its entirety. The optimal solution approach using (mixed) integer linear programming, with the dead-end elimination technique, suffers even for moderate-sized proteins because the side-chain positioning problem is NP-hard. On the other hand, popular heuristic approaches focusing on speed produce solutions of low quality. This paper presents an efficient algorithm, called the BetaSCP, for the side-chain positioning problem based on the beta-complex which is a derivative geometric construct of the Voronoi diagram. Placing a higher priority on solution quality, the BetaSCP algorithm produces a solution very close to the optima within a reasonable computation time. The effectiveness and efficiency of the BetaSCP are experimentally shown via a benchmark test against well-known algorithms using twenty test models selected from Protein Data Bank. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • Joonghyun Ryu & Deok-Soo Kim, 2013. "Protein structure optimization by side-chain positioning via beta-complex," Journal of Global Optimization, Springer, vol. 57(1), pages 217-250, September.
    • Handle: RePEc:spr:jglopt:v:57:y:2013:i:1:p:217-250
    DOI: 10.1007/s10898-012-9886-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-012-9886-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-012-9886-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bernard Chazelle & Carl Kingsford & Mona Singh, 2004. "A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies," INFORMS Journal on Computing, INFORMS, vol. 16(4), pages 380-392, November.
    2. H. K. Fung & S. Rao & C. A. Floudas & O. Prokopyev & P. M. Pardalos & F. Rendl, 2005. "Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design," Journal of Combinatorial Optimization, Springer, vol. 10(1), pages 41-60, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Douglas S. Gonçalves & Antonio Mucherino & Carlile Lavor & Leo Liberti, 2017. "Recent advances on the interval distance geometry problem," Journal of Global Optimization, Springer, vol. 69(3), pages 525-545, November.
    2. Saeed Asaeedi & Farzad Didehvar & Ali Mohades, 2018. "NLP Formulation for Polygon Optimization Problems," Mathematics, MDPI, vol. 7(1), pages 1-25, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bin Fu & Zhixiang Chen, 2008. "Sublinear time width-bounded separators and their application to the protein side-chain packing problem," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 387-407, May.
    2. Piotr Łukasiak & Jacek Błażewicz & Maciej Miłostan, 2010. "Some operations research methods for analyzing protein sequences and structures," Annals of Operations Research, Springer, vol. 175(1), pages 9-35, March.
    3. Xinxin Li & Ting Kei Pong & Hao Sun & Henry Wolkowicz, 2021. "A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem," Computational Optimization and Applications, Springer, vol. 78(3), pages 853-891, April.
    4. Andrew C. Trapp & Oleg A. Prokopyev, 2010. "Solving the Order-Preserving Submatrix Problem via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 387-400, August.
    5. Hu Ding & Branislav Stojkovic & Zihe Chen & Andrew Hughes & Lei Xu & Andrew Fritz & Nitasha Sehgal & Ronald Berezney & Jinhui Xu, 2016. "Chromatic kernel and its applications," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1298-1315, April.
    6. Forbes Burkowski & Yuen-Lam Cheung & Henry Wolkowicz, 2014. "Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 748-766, November.
    7. Anna U Lowegard & Marcel S Frenkel & Graham T Holt & Jonathan D Jou & Adegoke A Ojewole & Bruce R Donald, 2020. "Novel, provable algorithms for efficient ensemble-based computational protein design and their application to the redesign of the c-Raf-RBD:KRas protein-protein interface," PLOS Computational Biology, Public Library of Science, vol. 16(6), pages 1-27, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:57:y:2013:i:1:p:217-250. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.