Abstract

The elastic network interpolation (ENI) (Kim et al., Biophys J 2002;83:1620-1630) is a computationally efficient and physically realistic method to generate conformational transition intermediates between two forms of a given protein. However it can be asked whether these calculated conformations provide good representatives for these intermediates. In this study, we use ENI to generate conformational transition intermediates between the open form and the closed form of adenylate kinase (AK). Based on C(alpha)-only intermediates, we construct atomic intermediates by grafting all the atoms of known AK structures onto the C(alpha) atoms and then perform CHARMM energy minimization to remove steric conflicts and optimize these intermediate structures. We compare the energy profiles for all intermediates from both the CHARMM force-field and from knowledge-based energy functions. We find that the CHARMM energies can successfully capture the two energy minima representing the open AK and closed AK forms, while the energies computed from the knowledge-based energy functions can detect the local energy minimum representing the closed AK form and show some general features of the transition pathway with a somewhat similar energy profile as the CHARMM energies. The combinatorial extension structural alignment (Shindyalov et al., 1998;11:739-747) and the k-means clustering algorithm are then used to show that known PDB structures closely resemble computed intermediates along the transition pathway.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.