Generalized dead-end elimination algorithms make large-scale protein side-chain structure prediction tractable: implications for protein design and structural genomics
- 1 March 2001
- journal article
- Published by Elsevier in Journal of Molecular Biology
- Vol. 307 (1) , 429-445
- https://doi.org/10.1006/jmbi.2000.4424
Abstract
No abstract availableKeywords
This publication has 46 references indexed in Scilit:
- Crystal structures of the key anaerobic enzyme pyruvate:ferredoxin oxidoreductase, free and in complex with pyruvate.Nature Structural & Molecular Biology, 1999
- Extending the limits of molecular replacement through combined simulated annealing and maximum-likelihood refinementActa Crystallographica Section D-Biological Crystallography, 1999
- Computer search algorithms in protein modification and designCurrent Opinion in Structural Biology, 1998
- De Novo Protein Design: Fully Automated Sequence SelectionScience, 1997
- Automated design of the surface positions of protein helicesProtein Science, 1997
- All in one: a highly detailed rotamer library improves both accuracy and speed in the modelling of sidechains by dead-end eliminationFolding and Design, 1997
- Protein design automationProtein Science, 1996
- De novo design of the hydrophobic cores of proteinsProtein Science, 1995
- Refined 1.8 Å crystal structure of the λ repressor-operator complexJournal of Molecular Biology, 1992
- The dead-end elimination theorem and its use in protein side-chain positioningNature, 1992