CoChat

SORTCERY—A High–Throughput Method to Affinity Rank Peptide Ligands

Open access
Reich, Lothar “Luther”, Dutta, Sanjib, Keating, Amy E. · 2015 · Journal of Molecular Biology
Cited by 56

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

Abstract

Uncovering the relationships between peptide and protein sequences and binding properties is critical for successfully predicting, re-designing and inhibiting protein-protein interactions. Systematically collected data that link protein sequence to binding are valuable for elucidating determinants of protein interaction, but are rare in the literature because such data are experimentally difficult to generate. Here we describe SORTCERY, a high-throughput method that we have used to rank hundreds of yeast displayed peptides according to their affinities for a target interaction partner. The procedure involves fluorescence-activated cell sorting (FACS) of a library, deep sequencing of sorted pools, and downstream computational analysis. We have developed theoretical models and statistical tools that assist in planning these stages. We demonstrate SORTCERY’s utility by ranking 1026 BH3 peptides with respect to their affinities for the anti-apoptotic protein Bcl-xL. Our results are in striking agreement with measured affinities for 19 individual peptides with dissociation constants ranging from 0.1 to 60 nM. High-resolution ranking can be used to improve our understanding of sequence-function relationships, and to support the development of computational models for predicting and designing novel interactions.

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.jmb.2014.09.025

Cites

6 of 6 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

Show all 6 references

Cited by

Metadata

Authors
Reich, L. “., Dutta, S., & Keating, A. E.
Venue
Journal of Molecular Biology
Publisher
Elsevier BV
Published
2015-06
Volume
427
Issue
11
Pages
2135-2150
ISSN
0022-2836 (ISSN-L)
OpenAlex
W2061005802
Cited by
56
References
6
FWCI
1.58
Type
journal article
Language
en
Open access
green

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.