A Peaceman-Rachford Splitting Method for the Protein Side-Chain Positioning Problem

References

• Akutsu T (1997) NP-hardness results for protein side-chain packing. Genome Informatics 8:180–186.Google Scholar
• Althaus E, Kohlbacher O, Lenhof HP, Mauller P (2002) A combinatorial approach to protein docking with flexible side chains. J. Comput. Biology 9(4):597–612.Crossref, Google Scholar
• Bahadur D, Akutsu T, Tomita E, Seki T (2004) Protein side-chain packing problem: A maximum edge-weight clique algorithmic approach. J. Bioinform. Comput. Biol. 3(1):103–126.Crossref, Google Scholar
• Bower M, Cohen F, Dunbrack R (1997) Prediction of protein side-chain rotamers from a backbone-dependent rotamer library: A new homology modeling tool. J. Molecular Biology 267(5):1268–1282.Crossref, Google Scholar
• Burkowski F (2015) Computational and Visualization Techniques for Structural Bioinformatics Using Chimera, Chapman & Hall/CRC Mathematical and Computational Biology Series (Chapman and Hall/CRC, London).Google Scholar
• Burkowski F, Cheung YL, Wolkowicz H (2014) Efficient use of semidefinite programming for selection of rotamers in protein conformations. INFORMS J. Comput. 26(4):748–766.Link, Google Scholar
• Burkowski F, Im H, Wolkowicz H (2024) Repository to “A restricted Peaceman-Rachford splitting method for protein side-chain positioning problem”. http://dx.doi.org/10.1287/ijoc.2023.0094.cd, https://github.com/INFORMSJoC/2023.0094.Google Scholar
• Canutescu A, Shelenkov A, Dunbrack R (2003) A graph-theory algorithm for rapid protein side-chain prediction. Protein Sci. 12(9):2001–2014.Crossref, Google Scholar
• Chazelle B, Kingsford C, Singh M (2004) A semidefinite programming approach to side chain positioning with new rounding strategies. INFORMS J. Comput. 16(4):380–392.Link, Google Scholar
• Desmet J, Maeyer MD, Hazes B, Lasters I (1992) The dead-end elimination theorem and its use in protein side-chain positioning. Nature (London) 356(6369):539–542.Crossref, Google Scholar
• Drusvyatskiy D, Wolkowicz H (2017) The many faces of degeneracy in conic optimization. Foundations Trends Optim. 3(2):77–170.Crossref, Google Scholar
• Dunbrack R Jr, Karplus M (1993) Backbone-dependent rotamer library for proteins application to side-chain prediction. J. Molecular Biology 230(2):543–574.Crossref, Google Scholar
• Eckstein J (2020) Deriving solution value bounds from the ADMM. Optim. Lett. 14:1289–1303.Crossref, Google Scholar
• Eriksson O, Zhou Y, Elofsson A (2001) Side chain-positioning as an integer programming problem. Algorithms Bioinformatics, Lecture Notes in Computational Science, vol. 2149 (Springer, Berlin), 128–141.Crossref, Google Scholar
• Goldstein R (1994) Efficient rotamer elimination applied to protein side-chains and related spin glasses. Biophys. J. 66(5):1335–1340.Crossref, Google Scholar
• Graham N, Hu H, Im H, Li X, Wolkowicz H (2020) A restricted dual Peaceman-Rachford splitting method for QAP. Technical report, University of Waterloo, Waterloo, ON.Google Scholar
• Holm L, Sander C (1991) Database algorithm for generating protein backbone and side-chain co-ordinates from a Cα trace: Application to model building and detection of co-ordinate errors. J. Molecular Biology 218(1):183–194.Crossref, Google Scholar
• Kingsford C, Chazelle B, Singh M (2005) Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics (Oxford, England) 21(7):1028–1039.Google Scholar
• Laudet V, Gronemeyer H (2002) 3-ligand binding. Laudet V, Gronemeyer H, eds. The Nuclear Receptor FactsBook (Academic Press, London), 37–41.Crossref, Google Scholar
• Lee C (1994) Predicting protein mutant energetics by self-consistent ensemble optimization. J. Molecular Biology 236(3):918–939.Crossref, Google Scholar
• Li X, Pong T, Sun H, Wolkowicz H (2019) A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem. Technical report, University of Waterloo, Waterloo, ON.Google Scholar
• Looger L, Dwyer M, Smith J, Hellinga H (2003) Computational design of receptor and sensor proteins with novel functions. Nature (London) 423(6936):185–190.Crossref, Google Scholar
• Marze N, Roy-Burman S, Sheffler W, Gray J (2018) Efficient flexible backbone protein-protein docking for challenging targets. Computer Appl. Biosci. 34(20):3461–3469.Google Scholar
• Oliveira D, Wolkowicz H, Xu Y (2018) ADMM for the SDP relaxation of the QAP. Math. Program. Comput. 10(4):631–658.Crossref, Google Scholar
• Samudrala R, Moult J (1998) Determinants of side chain conformational preferences in protein structures. Protein Engrg. 11(11):991–997.Crossref, Google Scholar
• Shenkin P, Farid H, Fetrow J (1996) Prediction and evaluation of side-chain conformations for protein backbone structures. Proteins: Structure, Function, Bioinform. 26(3):323–352.Crossref, Google Scholar
• Toh K, Todd M, Tütüncü R (1999) SDPT3—A MATLAB software package for semidefinite programming, version 1.3. Optim. Methods Software 11/12(1–4):545–581.Crossref, Google Scholar
• Wang C, Bradley P, Baker D (2007) Protein-protein docking with backbone flexibility. J. Molecular Biology 373(2):503–519.Crossref, Google Scholar
• Wolkowicz H, Saigal R, Vandenberghe L, eds. (2000) Handbook of Semidefinite Programming, International Series in Operations Research & Management Science, vol. 27 (Kluwer Academic Publishers, Boston).Crossref, Google Scholar
• Xu J, Berger B (2006) Fast and accurate algorithms for protein side-chain packing. J. ACM 53(4):533–557.Crossref, Google Scholar