CoChat

Computationally Designed Bispecific Antibodies using Negative State Repertoires

Open access
Leaver-Fay, Andrew, Froning, Karen J., Atwell, Shane, Aldaz, Hector, Pustilnik, Anna, Lu, Frances, Huang, Flora, Yuan, Richard, Hassanali, Saleema, Chamberlain, Aaron K., Fitchett, Jonathan R., Demarest, Stephen J., Kuhlman, Brian · 2016 · Structure
Cited by 62

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

A challenge in the structure-based design of specificity is modeling the negative states, i.e. the complexes that you do not want to form. This is a difficult problem because mutations predicted to destabilize the negative state might be accommodated by small conformational rearrangements. To overcome this challenge, we employ an iterative strategy that cycles between sequence design and protein docking in order to build up an ensemble of alternative negative state conformations for use in specificity prediction. We have applied our technique to the design of heterodimeric CH3 interfaces in the Fc region of antibodies. Combining computationally- and rationally-designed mutations produced unique designs with heterodimer purities greater than 90%. Asymmetric Fc crystallization was able to resolve the interface mutations; the heterodimer structures confirmed that the interfaces formed as designed. With these CH3 mutations, and those made at the heavy-/light-chain interface, we demonstrate one-step synthesis of four fully IgG bispecific antibodies.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.str.2016.02.013

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 62

Metadata

Authors
Leaver-Fay, A., Froning, K. J., Atwell, S., Aldaz, H., Pustilnik, A., Lu, F., Huang, F., Yuan, R., Hassanali, S., Chamberlain, A. K., Fitchett, J. R., Demarest, S. J., & Kuhlman, B.
Venue
Structure
Publisher
Elsevier BV
Published
2016-04
Volume
24
Issue
4
Pages
641-651
ISSN
0969-2126 (ISSN-L)
OpenAlex
W2311619343
Cited by
62
References
5
FWCI
6.57
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.