A general computational approach for repeat protein design

Parmeggiani, F ORCID: https://orcid.org/0000-0001-8548-1090, Huang, P., Vorobiev, S., Xiao, R., Park, K., Caprari, S., Su, M., Seetharaman, J., Mao, L., Janjua, H., Montelione, G., Hunt, J. and Baker, D. 2014. A general computational approach for repeat protein design. Journal of Molecular Biology 427 (2) , pp. 563-575. 10.1016/j.jmb.2014.11.005

Full text not available from this repository.

Abstract

Repeat proteins have considerable potential for use as modular binding reagents or biomaterials in biomedical and nanotechnology applications. Here we describe a general computational method for building idealized repeats that integrates available family sequences and structural information with Rosetta de novo protein design calculations. Idealized designs from six different repeat families were generated and experimentally characterized; 80% of the proteins were expressed and soluble and more than 40% were folded and monomeric with high thermal stability. Crystal structures determined for members of three families are within 1 Å root-mean-square deviation to the design models. The method provides a general approach for fast and reliable generation of stable modular repeat protein scaffolds.

Item Type:	Article
Date Type:	Published Online
Status:	Published
Schools:	Pharmacy
Publisher:	Elsevier
ISSN:	0022-2836
Date of Acceptance:	7 November 2014
Last Modified:	21 Oct 2024 15:58
URI:	https://orca.cardiff.ac.uk/id/eprint/172220

Actions (repository staff only)

Edit Item