CoChat

Maximizing binary interactome mapping with a minimal number of assays

Open access
Choi, Soon Gang, Olivet, Julien, Cassonnet, Patricia, Vidalain, Pierre-Olivier, Luck, Katja, Lambourne, Luke, Spirohn, Kerstin, Lemmens, Irma, Dos Santos, Mélanie, Demeret, Caroline, Jones, Louis, Rangarajan, Sudharshan, Bian, Wenting, Coutant, Eloi P., Janin, Yves L., van der Werf, Sylvie, Trepte, Philipp, Wanker, Erich E., De Las Rivas, Javier, Tavernier, Jan, Twizere, Jean-Claude, Hao, Tong, Hill, David E., Vidal, Marc, Calderwood, Michael A., Jacob, Yves · 2019 · Nature Communications
Cited by 78

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

Abstract

Complementary assays are required to comprehensively map complex biological entities such as genomes, proteomes and interactome networks. However, how various assays can be optimally combined to approach completeness while maintaining high precision often remains unclear. Here, we propose a framework for binary protein-protein interaction (PPI) mapping based on optimally combining assays and/or assay versions to maximize detection of true positive interactions, while avoiding detection of random protein pairs. We have engineered a novel NanoLuc two-hybrid (N2H) system that integrates 12 different versions, differing by protein expression systems and tagging configurations. The resulting union of N2H versions recovers as many PPIs as 10 distinct assays combined. Thus, to further improve PPI mapping, developing alternative versions of existing assays might be as productive as designing completely new assays. Our findings should be applicable to systematic mapping of other biological landscapes.

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.1038/s41467-019-11809-2

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

See all 78

Metadata

Authors
Choi, S. G., Olivet, J., Cassonnet, P., Vidalain, P.-O., Luck, K., Lambourne, L., Spirohn, K., Lemmens, I., Dos Santos, M., Demeret, C., Jones, L., Rangarajan, S., Bian, W., Coutant, E. P., Janin, Y. L., van der Werf, S., Trepte, P., Wanker, E. E., De Las Rivas, J., Tavernier, J., Twizere, J.-C., Hao, T., Hill, D. E., Vidal, M., Calderwood, M. A., & Jacob, Y.
Venue
Nature Communications
Published
2019-08-29
Volume
10
Issue
1
Pages
3907-3907
ISSN
2041-1723 (ISSN-L)
OpenAlex
W2970095718
Cited by
78
References
6
FWCI
2.43
Type
journal article
Language
en
Open access
gold

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Maximizing binary interactome mapping with a minimal number of assays. https://app.cochat.ai/papers/10.1038/s41467-019-11809-2
The paper
Choi, S. G., Olivet, J., Cassonnet, P., Vidalain, P.-O., Luck, K., Lambourne, L., Spirohn, K., Lemmens, I., Dos Santos, M., Demeret, C., Jones, L., Rangarajan, S., Bian, W., Coutant, E. P., Janin, Y. L., van der Werf, S., Trepte, P., Wanker, E. E., De Las Rivas, J., . . . Jacob, Y. (2019). Maximizing binary interactome mapping with a minimal number of assays. Nature Communications. https://doi.org/10.1038/s41467-019-11809-2

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.