Loading…
Computational design of N-linked glycans for high throughput epitope profiling
Efficient identification of epitopes is crucial for drug discovery and design as it enables the selection of optimal epitopes, expansion of lead antibody diversity, and verification of binding interface. Although high resolution low throughput methods like X-ray crystallography can determine epitope...
Saved in:
Published in: | Protein science 2023-10, Vol.32 (10), p.e4726-e4726 |
---|---|
Main Authors: | , , , , , , , , , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Efficient identification of epitopes is crucial for drug discovery and design as it enables the selection of optimal epitopes, expansion of lead antibody diversity, and verification of binding interface. Although high resolution low throughput methods like X-ray crystallography can determine epitopes or protein-protein interactions accurately, they are time-consuming and can only be applied to a limited number of complexes. To overcome these limitations, we have developed a rapid computational method that incorporates N-linked glycans to mask epitopes or protein interaction surfaces, thereby providing a mapping of these regions. Using human coagulation factor IXa (fIXa) as a model system, we computationally screened 158 positions and expressed 98 variants to test experimentally for epitope mapping. We were able to delineate epitopes rapidly and reliably through the insertion of N-linked glycans that efficiently disrupted binding in a site-selective manner. To validate the efficacy of our method, we conducted ELISA experiments and high-throughput yeast surface display assays. Furthermore, X-ray crystallography was employed to verify the results, thereby recapitulating through the method of N-linked glycans a coarse-grained mapping of the epitope. This article is protected by copyright. All rights reserved. |
---|---|
ISSN: | 0961-8368 1469-896X |
DOI: | 10.1002/pro.4726 |