The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
A graph‐theory algorithm for rapid protein side‐chain prediction
Open accessAbstract
Fast and accurate side‐chain conformation prediction is important for homology modeling, ab initio protein structure prediction, and protein design applications. Many methods have been presented, although only a few computer programs are publicly available. The SCWRL program is one such method and is widely used because of its speed, accuracy, and ease of use. A new algorithm for SCWRL is presented that uses results from graph theory to solve the combinatorial problem encountered in the side‐chain prediction problem. In this method, side chains are represented as vertices in an undirected graph. Any two residues that have rotamers with nonzero interaction energies are considered to have an edge in the graph. The resulting graph can be partitioned into connected subgraphs with no edges between them. These subgraphs can in turn be broken into biconnected components, which are graphs that cannot be disconnected by removal of a single vertex. The combinatorial problem is reduced to finding the minimum energy of these small biconnected components and combining the results to identify the global minimum energy conformation. This algorithm is able to complete predictions on a set of 180 proteins with 34,342 side chains in <7 min of computer time. The total χ 1 and χ 1 + 2 dihedral angle accuracies are 82.6% and 73.7% using a simple energy function based on the backbone‐dependent rotamer library and a linear repulsive steric energy. The new algorithm will allow for use of SCWRL in more demanding applications such as sequence design and ab initio structure prediction, as well addition of a more complex energy function and conformational flexibility, leading to increased accuracy.
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
Cites
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
PISCES: a protein sequence culling server
Wang, G., & Dunbrack, R. L. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg224 · Cited by 1,662
Self-citationTertiary templates for proteins
Ponder, J. W., & Richards, F. M. (1987) · Journal of Molecular Biology · doi:10.1016/0022-2836(87)90358-5 · Cited by 1,478
Enhanced genome annotation using structural profiles in the program 3D-PSSM 1 1Edited by J. Thornton
Kelley, L. A., MacCallum, R. M., & Sternberg, M. J. E. (2000) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.3741 · Cited by 1,468
Word, J. M., Lovell, S. C., Richardson, J. S., & Richardson, D. C. (1999) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.2401 · Cited by 1,423
The penultimate rotamer library
Lovell, S. C., Word, J. M., Richardson, J. S., & Richardson, D. C. (2000) · Proteins: Structure, Function, and Genetics · doi:10.1002/1097-0134(20000815)40:3<389::aid-prot50>3.0.co;2-2 · Cited by 1,036
Backbone-dependent Rotamer Library for Proteins Application to Side-chain Prediction
Dunbrack, R. L., & Karplus, M. (1993) · Journal of Molecular Biology · doi:10.1006/jmbi.1993.1170 · Cited by 923
Self-citationBayesian statistical analysis of protein side‐chain rotamer preferences
Dunbrack, R. L., & Cohen, F. E. (1997) · Protein Science · doi:10.1002/pro.5560060807 · Cited by 774
Self-citationThe dead-end elimination theorem and its use in protein side-chain positioning
Desmet, J., Maeyer, M. D., Hazes, B., & Lasters, I. (1992) · Nature · doi:10.1038/356539a0 · Cited by 697
Rotamer Libraries in the 21st Century
Dunbrack, R. L. (2002) · Current Opinion in Structural Biology · doi:10.1016/s0959-440x(02)00344-5 · Cited by 644
Self-citationBower, M. J., Cohen, F. E., & Dunbrack, R. L. (1997) · Journal of Molecular Biology · doi:10.1006/jmbi.1997.0926 · Cited by 551
Self-citationWord, J. M., Lovell, S. C., LaBean, T. H., Taylor, H. C., Zalis, M. E., Presley, B. K., Richardson, J. S., & Richardson, D. C. (1999) · Journal of Molecular Biology · doi:10.1006/jmbi.1998.2400 · Cited by 529
McGregor, M. J., Islam, S. A., & Sternberg, M. J. E. (1987) · Journal of Molecular Biology · doi:10.1016/0022-2836(87)90314-7 · Cited by 420
Extending the accuracy limits of prediction for side-chain conformations
Xiang, Z., & Honig, B. (2001) · Journal of Molecular Biology · doi:10.1006/jmbi.2001.4865 · Cited by 412
A New Approach to the Rapid Determination of Protein Side Chain Conformations
Tuffery, P., Etchebest, C., Hazout, S., & Lavery, R. (1991) · Journal of Biomolecular Structure and Dynamics · doi:10.1080/07391102.1991.10507882 · Cited by 350
Conformational analysis of the backbone-dependent rotamer preferences of protein sidechains
Dunbrack, R. L., & Karplus, M. (1994) · Nature Structural & Molecular Biology · doi:10.1038/nsb0594-334 · Cited by 345
Self-citationDatabase algorithm for generating protein backbone and side-chain co-ordinates from a Cα trace
Holm, L., & Sander, C. (1991) · Journal of Molecular Biology · doi:10.1016/0022-2836(91)90883-8 · Cited by 320
De novo design of the hydrophobic cores of proteins
Desjarlais, J. R., & Handel, T. M. (1995) · Protein Science · doi:10.1002/pro.5560041006 · Cited by 306
Dahiyat, B. I., & Mayo, S. L. (1996) · Protein Science · doi:10.1002/pro.5560050511 · Cited by 298
Efficient rotamer elimination applied to protein side-chains and related spin glasses
Goldstein, R. F. (1994) · Biophysical Journal · doi:10.1016/s0006-3495(94)80923-3 · Cited by 283
Prediction of protein side-chain conformation by packing optimization
Lee, C., & Subbiah, S. (1991) · Journal of Molecular Biology · doi:10.1016/0022-2836(91)90550-p · Cited by 227
Looger, L. L., & Hellinga, H. W. (2001) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.4424 · Cited by 206
Voigt, C. A., Gordon, D. B., & Mayo, S. L. (2000) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.3758 · Cited by 192
Conformational splitting: A more powerful criterion for dead-end elimination
Pierce, N. A., Spriet, J. A., Desmet, J., & Mayo, S. L. (2000) · Journal of Computational Chemistry · doi:10.1002/1096-987x(200008)21:11<999::aid-jcc9>3.0.co;2-a · Cited by 170
Maeyer, M. D., Desmet, J., & Lasters, I. (1997) · Folding and Design · doi:10.1016/s1359-0278(97)00006-0 · Cited by 142
Side‐chain modeling with an optimized scoring function
Liang, S., & Grishin, N. V. (2002) · Protein Science · doi:10.1110/ps.24902 · Cited by 135
Desmet, J., SPRIET, J. A., & Lasters, I. (2002) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.10131 · Cited by 121
Branch-and-Terminate: a combinatorial optimization algorithm for protein design
Gordon, D. B., & Mayo, S. L. (1999) · Structure · doi:10.1016/s0969-2126(99)80176-2 · Cited by 116
Koehl, P., & Delarue, M. H. (1995) · Nature Structural & Molecular Biology · doi:10.1038/nsb0295-163 · Cited by 96
Modeling Side-chain Conformation for Homologous Proteins Using an Energy-based Rotamer Search
Wilson, C. B., Gregoret, L. M., & Agard, D. A. (1993) · Journal of Molecular Biology · doi:10.1006/jmbi.1993.1100 · Cited by 94
Construction of side-chains in homology modelling
Summers, N. L., & Karplus, M. (1989) · Journal of Molecular Biology · doi:10.1016/0022-2836(89)90109-5 · Cited by 93
Comparative modeling of CASP3 targets using PSI-BLAST and SCWRL
Dunbrack, R. L. (1999) · Proteins Structure Function and Bioinformatics · doi:10.1002/(sici)1097-0134(1999)37:3+<81::aid-prot12>3.0.co;2-r · Cited by 74
Self-citationMaeyer, M. D., Desmet, J., & Lasters, I. (2003) · Humana Press eBooks · doi:10.1385/1-59259-368-2:265 · Cited by 47
Mendes, J., Soares, C. M., & Carrondo, M. A. (1999) · Biopolymers · doi:10.1002/(sici)1097-0282(199908)50:2<111::aid-bip1>3.0.co;2-n · Cited by 45
Mendes, J., Baptista, A. M., Carrondo, M. A., & Soares, C. M. (2001) · Journal of Computer-Aided Molecular Design · doi:10.1023/a:1012279810260 · Cited by 19
Cited by
I-TASSER server for protein 3D structure prediction
Zhang, Y. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-40 · Cited by 5,124
Comparative Protein Structure Modeling Using Modeller
Eswar, N., Webb, B., Marti‐Renom, M. A., Madhusudhan, M. S., Eramian, D., Shen, M., Pieper, U., & Sali, A. (2006) · Current Protocols in Bioinformatics · doi:10.1002/0471250953.bi0506s15 · Cited by 4,478
Comparative Protein Structure Modeling Using MODELLER
Eswar, N., Webb, B., Marti‐Renom, M. A., Madhusudhan, M. S., Eramian, D., Shen, M., Pieper, U., & Sali, A. (2007) · Current Protocols in Protein Science · doi:10.1002/0471140864.ps0209s50 · Cited by 2,846
Software for molecular docking: a review
Pagadala, N. S., Syed, K., & Tuszynski, J. (2017) · Biophysical Reviews · doi:10.1007/s12551-016-0247-1 · Cited by 1,522
Krieger, E., Joo, K., Lee, J., Lee, J., Raman, S., Thompson, J., Tyka, M., Baker, D., & Karplus, K. (2009) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22570 · Cited by 1,409
Metadata
- Authors
- Canutescu, A. A., Shelenkov, A. A., & Dunbrack, R. L.
- Venue
- Protein Science
- Publisher
- Wiley
- Published
- 2003-09
- Volume
- 12
- Issue
- 9
- Pages
- 2001-2014
- ISSN
- 0961-8368 (ISSN-L)
- 1469-896X
- OpenAlex
- W2015403140
- Cited by
- 997
- References
- 36
- FWCI
- 18.12
- Type
- journal article
- Language
- en
- Open access
- bronze
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.