메뉴 건너뛰기




Volumn 307, Issue 1, 2001, Pages 429-445

Generalized dead-end elimination algorithms make large-scale protein side-chain structure prediction tractable: Implications for protein design and structural genomics

Author keywords

Dead end elimination; Homology modeling; Protein design; Structural genomics

Indexed keywords

FIBRONECTIN; IMMUNOGLOBULIN F(AB) FRAGMENT; PROTEIN; REPRESSOR PROTEIN;

EID: 0035896029     PISSN: 00222836     EISSN: None     Source Type: Journal    
DOI: 10.1006/jmbi.2000.4424     Document Type: Article
Times cited : (164)

References (48)
  • 14
    • 0028212927 scopus 로고
    • Efficient rotamer elimination applied to protein side-chains and related spin glasses
    • (1994) Biophys. J. , vol.66 , pp. 1335-1340
    • Goldstein, R.F.1
  • 15
    • 0001686478 scopus 로고    scopus 로고
    • Radical performance enhancements for combinatorial optimization algorithms based on the dead-end elimination theorem
    • (1998) J. Comp. Chem. , vol.19 , pp. 1505-1514
    • Gordon, D.B.1    Mayo, S.L.2
  • 22
    • 0028220365 scopus 로고
    • De novo protein design using pair-wise potentials and a genetic algorithm
    • (1994) Protein Sci. , vol.3 , pp. 567-574
    • Jones, D.T.1
  • 23
    • 0028343413 scopus 로고
    • Application of a self-consistent mean field theory to predict protein side-chains conformation and estimate their conformational entropy
    • (1994) J. Mol. Biol. , vol.239 , pp. 249-275
    • Koehl, P.1    Delarue, M.2
  • 37
    • 0023155210 scopus 로고
    • Tertiary templates for proteins. Use of packing criteria in the enumeration of allowed sequences for different structural classes
    • (1987) J. Mol. Biol. , vol.193 , pp. 775-791
    • Ponder, J.W.1    Richards, F.M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.