arrow
Return

Contextual computation by competitive protein dimerization networks

delete2025-02-01
delete0
delete
OA
AI
J
Jacob Parres-Gold
M
Matthew E. Levine
B
Benjamin Emert
A
Andrew M. Stuart
M
Michael B. Elowitz *
DOI:10.1016/j.cell.2025.01.036delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Many biological signaling pathways employ proteins that competitively dimerize in diverse combinations. These dimerization networks can perform biochemical computations in which the concentrations of monomer inputs determine the concentrations of dimer outputs. Despite their prevalence, little is known about the range of input-output computations that dimerization networks can perform and how it depends on network size and connectivity. Using a systematic computational approach, we demonstrate that even small dimerization networks of 3-6 monomers are expressive, performing diverse multi-input computations. Further, dimerization networks are versatile, performing different computations when their protein components are expressed at different levels, such as in different cell types. Remarkably, individual networks with random interaction affinities, when large enough, can perform nearly all potential one-input network computations merely by tuning their monomer expression levels. Thus, even the simple process of competitive dimerization provides a powerful architecture for multi-input, cell-type-specific signal processing.
Keywords:
AMINO-ACID-METABOLISM
LOOP-HELIX PROTEINS
TRANSCRIPTION FACTOR
ESTROGEN-RECEPTORS
GENE-EXPRESSION
BILLION YEARS
BCL-2 FAMILY
ANDROGEN
BETA
HETERODIMERS
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Cell cover
Cell
IF:
42.5
Papers:
1.1K
Citations:
31.1W

Organization

C
CALTECH
Scholars:
1.5K
Papers: 716
Citations: 506
B
Broad Inst MIT and Harvard
Scholars:
299
Papers: 130
Citations: 104