Publication

Discrete breathers in protein structures

Francesco Piazza
2008
Article
Résumé

Recently, using a numerical surface cooling approach, we have shown that highly energetic discrete breathers (DBs) can form in the stiffest parts of nonlinear network models of large protein structures. In the present study, using an analytical approach, we extend our previous results to low-energy discrete breathers as well as to smaller proteins. We confirm and further scrutinize the striking site selectiveness of energy localization in the presence of spatial disorder. In particular, we find that, as a sheer consequence of disorder, a non-zero energy gap for exciting a DB at a given site either exists or not. Remarkably, in the former case, the gaps arise as a result of the impossibility of exciting small-amplitude modes in the first place. In contrast, in the latter case, a small subset of linear edge modes acts as accumulation points, whereby DBs can be continued to arbitrary small energies, while unavoidably approaching one of such normal modes. In particular, the case of the edge mode seems peculiar, its dispersion relation being simple and little system dependent. Concerning the structure-dynamics relationship, we find that the regions of protein structures where DBs form easily (zero or small gaps) are unfailingly the most highly connected ones, also characterized by weak local clustering. Remarkably, a systematic analysis on a large database of enzyme structures reveals that amino-acid residues involved in catalysis tend to be located in such regions. This finding reinforces the idea that localized modes of nonlinear origin may play an important biological role, e. g., by providing a ready channel for energy storage and/or contributing to lower energy barriers of chemical reactions.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.