The DOI matches its Crossref record.
Solving and analyzing side-chain positioning problems using linear and integer programming
Abstract
Motivation: Side-chain positioning is a central component of homology modeling and protein design. In a common formulation of the problem, the backbone is fixed, side-chain conformations come from a rotamer library, and a pairwise energy function is optimized. It is NP-complete to find even a reasonable approximate solution to this problem. We seek to put this hardness result into practical context. Results: We present an integer linear programming (ILP) formulation of side-chain positioning that allows us to tackle large problem sizes. We relax the integrality constraint to give a polynomial-time linear programming (LP) heuristic. We apply LP to position side chains on native and homologous backbones and to choose side chains for protein design. Surprisingly, when positioning side chains on native and homologous backbones, optimal solutions using a simple, biologically relevant energy function can usually be found using LP. On the other hand, the design problem often cannot be solved using LP directly; however, optimal solutions for large instances can still be found using the computationally more expensive ILP procedure. While different energy functions also affect the difficulty of the problem, the LP/ILP approach is able to find optimal solutions. Our analysis is the first large-scale demonstration that LP-based approaches are highly effective in finding optimal (and successive near-optimal) solutions for the side-chain positioning problem. Availability: The source code for generating the ILP given a file of pairwise energies between rotamers is available online at http://compbio.cs.princeton.edu/scplp Contact: msingh@cs.princeton.edu
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Improved prediction of protein side‐chain conformations with SCWRL4
Krivov, G. G., Shapovalov, M. V., & Dunbrack, R. L. (2009) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22488 · Cited by 1,301
Coarse-Grained Protein Models and Their Applications
Kmiecik, S., Gront, D., Kolinski, M., Wieteska, L., Dawid, A. E., & Kolinski, A. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00163 · Cited by 1,071
FireDock: a web server for fast interaction refinement in molecular docking
Mashiach, E., Schneidman-Duhovny, D., Andrusier, N., Nussinov, R., & Wolfson, H. J. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn186 · Cited by 741
FireDock: Fast interaction refinement in molecular docking
Andrusier, N., Nussinov, R., & Wolfson, H. J. (2007) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21495 · Cited by 679
Advances in Homology Protein Structure Modeling
Xiang, Z. (2006) · Current Protein & Peptide Science · doi:10.2174/138920306777452312 · Cited by 479
Design of protein-interaction specificity gives selective bZIP-binding peptides
Grigoryan, G., Reinke, A. W., & Keating, A. E. (2009) · Nature · doi:10.1038/nature07885 · Cited by 343
A Linear Programming Approach to Max-Sum Problem: A Review
Werner, T. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1036 · Cited by 342
Machine Learning in Genomic Medicine: A Review of Computational Problems and Data Sets
Leung, M. K. K., Delong, A., Alipanahi, B., & Frey, B. J. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2494198 · Cited by 275
Metabolite discovery through global annotation of untargeted metabolomics data
Chen, L., Lu, W., Wang, L., Xing, X., Chen, Z., Teng, X., Zeng, X., Muscarella, A. D., Shen, Y., Cowan, A., et al. (2021) · Nature Methods · doi:10.1038/s41592-021-01303-3 · Cited by 256
Self-citationMemdock: an α-helical membrane protein docking algorithm
Hurwitz, N., Schneidman-Duhovny, D., & Wolfson, H. J. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw184 · Cited by 40
Dauzhenka, T., Kundrotas, P. J., & Vakser, I. A. (2018) · Journal of Computational Chemistry · doi:10.1002/jcc.25381 · Cited by 17
Metadata
- Authors
- Kingsford, C. L., Chazelle, B., & Singh, M.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2004-11-16
- Volume
- 21
- Issue
- 7
- Pages
- 1028-1039
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2101712920
- Cited by
- 233
- References
- 0
- FWCI
- 2.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.