MAPPING ELECTRON-TUNNELING PATHWAYS - AN ALGORITHM THAT FINDS THE MINIMUM LENGTH MAXIMUM COUPLING PATHWAY BETWEEN ELECTRON-DONORS AND ACCEPTORS IN PROTEINS
被引:121
作者:
BETTS, JN
论文数: 0引用数: 0
h-index: 0
机构:UNIV PITTSBURGH, DEPT CHEM, PITTSBURGH, PA 15260 USA
BETTS, JN
BERATAN, DN
论文数: 0引用数: 0
h-index: 0
机构:UNIV PITTSBURGH, DEPT CHEM, PITTSBURGH, PA 15260 USA
BERATAN, DN
ONUCHIC, JN
论文数: 0引用数: 0
h-index: 0
机构:UNIV PITTSBURGH, DEPT CHEM, PITTSBURGH, PA 15260 USA
ONUCHIC, JN
机构:
[1] UNIV PITTSBURGH, DEPT CHEM, PITTSBURGH, PA 15260 USA
[2] CALTECH, BECKMAN INST, PASADENA, CA 91125 USA
[3] UNIV CALIF SAN DIEGO, DEPT PHYS, LA JOLLA, CA 92093 USA
The covalent, hydrogen bonded, and van der Waals connectivity of proteins can be represented with geometrical objects called graphs. In these graphs, vertices represent bonds and the connections between them, edges, represent bond-bond interactions. We describe a model in which edge lengths are associated with the wave function decay between interacting pairs of bonds, and a minimum distance graph-search algorithm is used to find the pathways that dominate electron donor-acceptor interactions in these molecules. Predictions of relative electron transfer rates can be made from these pathway lengths. The results are consistent with many experimentally measured electron-transfer rates, although some anomalies exist. Presentation of the pathway coupling between the donor (or acceptor) and every other atom in a given protein as a color-coded map provides a design tool for tailored electron-transfer proteins.