IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v83y2022i1d10.1007_s10898-021-01004-3.html
   My bibliography  Save this article

NMR assignment through linear programming

Author

Listed:
  • José F. S. Bravo-Ferreira

    (PACM, Princeton University)

  • David Cowburn

    (Albert Einstein College of Medicine
    Albert Einstein College of Medicine)

  • Yuehaw Khoo

    (University of Chicago)

  • Amit Singer

    (Princeton University)

Abstract

Nuclear Magnetic Resonance (NMR) Spectroscopy is the second most used technique (after X-ray crystallography) for structural determination of proteins. A computational challenge in this technique involves solving a discrete optimization problem that assigns the resonance frequency to each atom in the protein. This paper introduces LIAN (LInear programming Assignment for NMR), a novel linear programming formulation of the problem which yields state-of-the-art results in simulated and experimental datasets.

Suggested Citation

  • José F. S. Bravo-Ferreira & David Cowburn & Yuehaw Khoo & Amit Singer, 2022. "NMR assignment through linear programming," Journal of Global Optimization, Springer, vol. 83(1), pages 3-28, May.
    • Handle: RePEc:spr:jglopt:v:83:y:2022:i:1:d:10.1007_s10898-021-01004-3
    DOI: 10.1007/s10898-021-01004-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01004-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-021-01004-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. José F. S. Bravo Ferreira & Yuehaw Khoo & Amit Singer, 2018. "Semidefinite programming approach for the quadratic assignment problem with a sparse graph," Computational Optimization and Applications, Springer, vol. 69(3), pages 677-712, April.
    2. Arash Bahrami & Amir H Assadi & John L Markley & Hamid R Eghbalnia, 2009. "Probabilistic Interaction Network of Evidence Algorithm and its Application to Complete Labeling of Peak Lists from Protein NMR Spectroscopy," PLOS Computational Biology, Public Library of Science, vol. 5(3), pages 1-15, March.
    Full references (including those not matched with items on IDEAS)

    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. Naomi Graham & Hao Hu & Jiyoung Im & Xinxin Li & Henry Wolkowicz, 2022. "A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2125-2143, July.

    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:83:y:2022:i:1:d:10.1007_s10898-021-01004-3. 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.