Predicting immunoglobulin-like hypervariable loops

George Vasmatzis, R. Brower, C. Delisi

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

A two-stage method is developed to search the conformational space of small protein segments for low energy structures. Central features of the method are efficient procedures for generating small, eight-backbone atom, local moves in Cartesian coordinates and for introducing geometric constraints in adaptable Monte Carlo procedures. This allows natural implementation of an adaptive simulated annealing algorithm, which achieves an effective trade-off between speed and acceptance ratio. The method is applied to the calculation of various immunoglobulin loops. We also develop data base derived rules for identifying constraint conditions, and show that the incorporation of an identified side-chain constraint allows a 1.2 Å all- backbone atom rms deviation prediction of a 9 residue long L1 loop.

Original languageEnglish (US)
Pages (from-to)1669-1680
Number of pages12
JournalBiopolymers
Volume34
Issue number12
DOIs
StatePublished - 1994
Externally publishedYes

Fingerprint

Immunoglobulins
Atoms
Simulated annealing
Proteins
Databases

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Biochemistry
  • Biophysics

Cite this

Predicting immunoglobulin-like hypervariable loops. / Vasmatzis, George; Brower, R.; Delisi, C.

In: Biopolymers, Vol. 34, No. 12, 1994, p. 1669-1680.

Research output: Contribution to journalArticle

Vasmatzis, George ; Brower, R. ; Delisi, C. / Predicting immunoglobulin-like hypervariable loops. In: Biopolymers. 1994 ; Vol. 34, No. 12. pp. 1669-1680.
@article{6b779a99261749ea9eeca59dcf5f1613,
title = "Predicting immunoglobulin-like hypervariable loops",
abstract = "A two-stage method is developed to search the conformational space of small protein segments for low energy structures. Central features of the method are efficient procedures for generating small, eight-backbone atom, local moves in Cartesian coordinates and for introducing geometric constraints in adaptable Monte Carlo procedures. This allows natural implementation of an adaptive simulated annealing algorithm, which achieves an effective trade-off between speed and acceptance ratio. The method is applied to the calculation of various immunoglobulin loops. We also develop data base derived rules for identifying constraint conditions, and show that the incorporation of an identified side-chain constraint allows a 1.2 {\AA} all- backbone atom rms deviation prediction of a 9 residue long L1 loop.",
author = "George Vasmatzis and R. Brower and C. Delisi",
year = "1994",
doi = "10.1002/bip.360341211",
language = "English (US)",
volume = "34",
pages = "1669--1680",
journal = "Biopolymers",
issn = "0006-3525",
publisher = "John Wiley and Sons Inc.",
number = "12",

}

TY - JOUR

T1 - Predicting immunoglobulin-like hypervariable loops

AU - Vasmatzis, George

AU - Brower, R.

AU - Delisi, C.

PY - 1994

Y1 - 1994

N2 - A two-stage method is developed to search the conformational space of small protein segments for low energy structures. Central features of the method are efficient procedures for generating small, eight-backbone atom, local moves in Cartesian coordinates and for introducing geometric constraints in adaptable Monte Carlo procedures. This allows natural implementation of an adaptive simulated annealing algorithm, which achieves an effective trade-off between speed and acceptance ratio. The method is applied to the calculation of various immunoglobulin loops. We also develop data base derived rules for identifying constraint conditions, and show that the incorporation of an identified side-chain constraint allows a 1.2 Å all- backbone atom rms deviation prediction of a 9 residue long L1 loop.

AB - A two-stage method is developed to search the conformational space of small protein segments for low energy structures. Central features of the method are efficient procedures for generating small, eight-backbone atom, local moves in Cartesian coordinates and for introducing geometric constraints in adaptable Monte Carlo procedures. This allows natural implementation of an adaptive simulated annealing algorithm, which achieves an effective trade-off between speed and acceptance ratio. The method is applied to the calculation of various immunoglobulin loops. We also develop data base derived rules for identifying constraint conditions, and show that the incorporation of an identified side-chain constraint allows a 1.2 Å all- backbone atom rms deviation prediction of a 9 residue long L1 loop.

UR - http://www.scopus.com/inward/record.url?scp=0028172482&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028172482&partnerID=8YFLogxK

U2 - 10.1002/bip.360341211

DO - 10.1002/bip.360341211

M3 - Article

C2 - 7849228

AN - SCOPUS:0028172482

VL - 34

SP - 1669

EP - 1680

JO - Biopolymers

JF - Biopolymers

SN - 0006-3525

IS - 12

ER -