Geometric constraints within tripeptides and the existence of tripeptide reconstructions.
J Comput Chem
; 44(13): 1236-1249, 2023 05 15.
Article
em En
| MEDLINE
| ID: mdl-36999748
Designing movesets providing high quality protein conformations remains a hard problem, especially when it comes to deform a long protein backbone segment, and a key building block to do so is the so-called tripeptide loop closure (TLC). Consider a tripeptide whose first and last bonds ( N 1 C α ; 1 and C α ; 3 C 3 ) are fixed, and so are all internal coordinates except the six Ï ψ i = 1,2,3 dihedral angles associated to the three C α carbons. Under these conditions, the TLC algorithm provides all possible values for these six dihedral angles-there exists at most 16 solutions. TLC moves atoms up to â¼ 5 Å in one step and retains low energy conformations, whence its pivotal role to design move sets sampling protein loop conformations. In this work, we relax the previous constraints, allowing the last bond ( C α ; 3 C 3 ) to freely move in 3D space-or equivalently in a 5D configuration space. We exhibit necessary geometric constraints in this 5D space for TLC to admit solutions. Our analysis provides key insights on the geometry of solutions for TLC. Most importantly, when using TLC to sample loop conformations based on m consecutive tripeptides along a protein backbone, we obtain an exponential gain in the volume of the 5 m -dimensional configuration space to be explored.
Palavras-chave
Texto completo:
1
Coleções:
01-internacional
Base de dados:
MEDLINE
Assunto principal:
Algoritmos
Idioma:
En
Revista:
J Comput Chem
Ano de publicação:
2023
Tipo de documento:
Article