pith. sign in

arxiv: 2402.04547 · v1 · submitted 2024-02-07 · 🧬 q-bio.MN · cond-mat.stat-mech· q-bio.QM

Reliable ligand discrimination in stochastic multistep kinetic proofreading: First passage time vs. product counting strategies

Xiangting Li , Tom Chou This is my paper

Pith reviewed 2026-05-24 03:54 UTC · model grok-4.3

classification 🧬 q-bio.MN cond-mat.stat-mechq-bio.QM
keywords kinetic proofreadingfirst passage timeligand discriminationstochastic kineticscellular signalingT cell receptorDNA replicationerror correction
0
0 comments X

The pith

In the first-passage time strategy for kinetic proofreading, longer steps exponentially raise discrimination accuracy despite high noise, unlike product counting.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper reformulates multistep kinetic proofreading by collapsing intermediate states into one effective state defined by a single overall processing time. This lets the authors compare two ways cells might read out the result: waiting for the first successful product versus counting total products made. Under first-passage timing, adding more proofreading steps improves error discrimination exponentially while slowing the process; under product counting the same lengthening does not reliably help. The distinction matters for noisy cellular decisions such as TCR ligand recognition or DNA polymerase fidelity, where the cell must decide which readout method it actually uses.

Core claim

The paper claims that whether longer proofreading chains improve or degrade fidelity depends on the information-extraction rule. When the cell uses first-passage time to decide, the error rate falls exponentially with the number of steps; when it uses steady-state product concentration, longer chains need not improve performance. Thresholds on product levels can convert the concentration rule into a sequence of first-passage decisions and thereby recover the exponential gain.

What carries the argument

A single effective processing time obtained by convolving the chain of intermediate states, which reduces the multistep Markov chain to a two-state waiting-time description while preserving discrimination statistics.

If this is right

  • Under first-passage timing, KPR remains useful for discrimination even when intrinsic noise is large.
  • Product-concentration readout alone does not guarantee that extra steps help fidelity.
  • Adding activation thresholds to a product-concentration rule decomposes it into multiple first-passage decisions that each gain from extra steps.
  • The speed-accuracy trade-off is explicit: exponential accuracy gains require proportionally longer average waiting times.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Cells using TCR or DNA-replication pathways may have evolved molecular timers that effectively implement first-passage rather than concentration readouts.
  • If a downstream process can reset or ignore late-arriving products, the effective strategy shifts toward first-passage timing and regains the exponential benefit.
  • The same reformulation could be applied to other multistep biological timers to test whether their performance also hinges on readout timing versus accumulation.

Load-bearing premise

Collapsing the full multistep chain into one effective state with a single processing time still captures the essential statistics that govern discrimination between correct and incorrect ligands.

What would settle it

Measure the ligand discrimination ratio as a function of the number of proofreading steps while recording whether the cell responds at the moment the first product appears or after accumulating a fixed product count; an exponential rise with step number only under the first-passage protocol would confirm the claim.

Figures

Figures reproduced from arXiv: 2402.04547 by Tom Chou, Xiangting Li.

Figure 1
Figure 1. Figure 1: Schematic of the KPR process and different strategies of interpreting the output. (a) The complex of enzyme and substrate ES alone cannot produce the final product P. It has to undergo a number of proofreading steps, represented here by phosphorylation (Pi), before the activated state E∗S can produce the final product. (b) The FPT-based discrimination strategy, simply reaching the activated state E∗S is in… view at source ↗
Figure 2
Figure 2. Figure 2: Reaction schemes of different descriptions of the simple kinetic proofreading process. (a) The conventional description of KPR explicitly incorporating multiple proofreading steps. (b) A reduced representation of KPR in which multiple driven steps are lumped in a single proofreading step. For comparison, we show the classical Michaelis-Menten reaction scheme in (c). In (a) and (b), unbinding of E ∗S is not… view at source ↗
Figure 3
Figure 3. Figure 3: The simplified model of KPR in DNA replication with only one enzyme. Here, the enzyme (e.g., DNA polymerase) has three states, namely, free (E), bound to correct substrate (ES), and bound to incorrect substrate (ES′ ). These states interconvert with rates specified in the model. When the enzyme is bound to substrate, it produces the product (P or P′ ) after a waiting time τ . metric. DNA replication settin… view at source ↗
Figure 4
Figure 4. Figure 4: Statistics of the FPT-based strategy in the DNA replication and TCR recognition scenarios. (a) Replication error probability P(tp ≥ tp′) as a function of processing time τ , evaluated using Eq. (2). (b) Accuracy A as a function of processing time τ and contact duration T, evaluated using Eq. (10). (c) The maximal accuracy A∗ (squares) as a function of processing time τ , evaluated using Eq. (12). The asymp… view at source ↗
Figure 5
Figure 5. Figure 5: The channel capacity as a function of cell-cell contact time T for first-passage-time-based (FPT￾based) signaling and product-based signaling. The channel capacity is evaluated between the input ξ indicating correct (1) or incorrect (0) substrate and the output Xa or P(T). We assumed k1 = q1 = 0.1, k−1 = k ∗ −1 = 1, q−1 = q ∗ −1 = 2, τ = 3, and kp = 0.01 for a slow product formation rate. Xa = 1ta≤T (in th… view at source ↗
Figure 6
Figure 6. Figure 6: The channel capacities of product concentration (blue squares) and first activation times (red dots) as a function of processing time τ for various cell contact times T. We evaluate the channel capacity using stochastic simulations (Gillespie algorithm) of the model in Eq. (4) with parameters k1 = q1 = 0.1, k−1 = k ∗ −1 = 1, q−1 = q ∗ −1 = 2, and kp = 1. The production rate was set higher for easier simula… view at source ↗
Figure 7
Figure 7. Figure 7: The channel capacity between the input ξ and the output P(T) or Xth as a function of cell-cell contact time T. Here, k1 = q1 = 0.1, k−1 = k ∗ −1 = 1, q−1 = q ∗ −1 = 2, τ = 3, and kp = 1. 12/30 [PITH_FULL_IMAGE:figures/full_fig_p012_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: The channel capacity between the input ξ and the output Xa, P(T), or Xth as a function of processing time τ . We assumed k1 = q1 = 0.1, k−1 = k ∗ −1 = 1, q−1 = q ∗ −1 = 2, T = 1000, and kp = 1. 10,000 independent Gillespie simulations are conducted for each τ . Since Xth is derived from P(T), C(ξ; P(T)) serves as an upper bound of C(ξ; Xth) for various thresh￾olds Pth, as is illustrated in [PITH_FULL_IMAG… view at source ↗
Figure 9
Figure 9. Figure 9: Comparison between the simulated channel capacity C(ξ; P(T)) and the corresponding estimate using Eq. (19). (a) C(ξ; P(T)) as a function of cell-cell contact time T; (b) C(ξ; P(T)) as a function of processing time τ . Here, we took k1 = q1 = 0.1, k−1 = k ∗ −1 = 1, q−1 = q ∗ −1 = 2, and kp = 1. τ = 3 in (a) and T = 1000 in (b). The dynamical threshold and random cell-cell contact time In the previous sectio… view at source ↗
Figure 10
Figure 10. Figure 10: The dynamical threshold and random contact time. (a) Illustration of the dynamical threshold P ∗ th as a function of the time t since initial contact. The blue trajectories represent the number of products P with correct substrates. The red trajectories represent that of incorrect substrates. (b) A dynamical￾threshold-based discrimination strategy maintains a high channel capacity when the total contact t… view at source ↗
read the original abstract

Cellular signaling, crucial for biological processes like immune response and homeostasis, relies on specificity and fidelity in signal transduction to accurately respond to stimuli amidst biological noise. Kinetic proofreading (KPR) is a key mechanism enhancing signaling specificity through time-delayed steps, although its effectiveness is debated due to intrinsic noise potentially reducing signal fidelity. In this study, we reformulate the theory of kinetic proofreading (KPR) by convolving multiple intermediate states into a single state and then define an overall "processing" time required to traverse these states. This simplification allows us to succinctly describe kinetic proofreading in terms of a single waiting time parameter, facilitating a more direct evaluation and comparison of KPR performance across different biological contexts such as DNA replication and T cell receptor (TCR) signaling. We find that loss of fidelity for longer proofreading steps relies on the specific strategy of information extraction and show that in the first-passage time (FPT) discrimination strategy, longer proofreading steps can exponentially improve the accuracy of KPR at the cost of speed. Thus, KPR can still be an effective discrimination mechanism in the high noise regime. However, in a product concentration-based discrimination strategy, longer proofreading steps do not necessarily lead to an increase in performance. However, by introducing activation thresholds on product concentrations, can we decompose the product-based strategy into a series of FPT based strategies to better resolve the subtleties of KPR-mediated product discrimination. Our findings underscore the importance of understanding KPR in the context of how information is extracted and processed in the cell.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper reformulates kinetic proofreading (KPR) by collapsing multiple intermediate states into a single effective state with one overall processing time, allowing succinct description via a single waiting-time parameter. This enables direct comparison of discrimination strategies across contexts such as DNA replication and TCR signaling. The central claims are that, under a first-passage time (FPT) readout, longer proofreading chains yield an exponential gain in accuracy (at the cost of speed) and remain effective in high-noise regimes, whereas product-concentration readouts do not necessarily improve with more steps; however, activation thresholds on product levels can decompose the latter into a series of FPT-based strategies.

Significance. If the reformulation is shown to preserve the relevant discrimination statistics, the work would provide a useful conceptual distinction between readout mechanisms and demonstrate that KPR fidelity is not intrinsically limited by noise when information is extracted via passage times. The explicit mapping of thresholded product counting onto FPT strategies could help reconcile conflicting views on KPR performance in noisy biological settings.

major comments (2)
  1. [Abstract (reformulation paragraph)] Abstract (reformulation paragraph): The central claim of exponential accuracy gain under FPT readout rests on the assertion that convolving the multistep chain into a single effective state with one overall processing time preserves the essential discrimination statistics. Convolution of independent exponential waits produces a hypoexponential (or Erlang) distribution whose variance and tail differ from a matched single exponential; because FPT discrimination extracts information from whether passage time exceeds a threshold or from the full distribution, any alteration in higher moments directly affects error probabilities in the high-noise regime emphasized by the paper. No derivation or numerical verification is supplied showing that the reported exponential improvement is invariant under this collapse.
  2. [Abstract (final paragraph)] Abstract (final paragraph): The statement that activation thresholds on product concentrations 'decompose the product-based strategy into a series of FPT based strategies' is introduced without quantification of the resulting error rates or explicit mapping of threshold values onto the FPT discrimination curves derived earlier. This post-hoc construction is load-bearing for the claim that product counting can be made to recover FPT advantages.
minor comments (1)
  1. [Abstract] The sentence 'However, by introducing activation thresholds on product concentrations, can we decompose...' is grammatically incomplete and should be rephrased.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive comments, which have helped us identify areas for clarification in our manuscript. We provide point-by-point responses below and plan to incorporate revisions to address the concerns raised.

read point-by-point responses

  1. Referee: [Abstract (reformulation paragraph)] The central claim of exponential accuracy gain under FPT readout rests on the assertion that convolving the multistep chain into a single effective state with one overall processing time preserves the essential discrimination statistics. Convolution of independent exponential waits produces a hypoexponential (or Erlang) distribution whose variance and tail differ from a matched single exponential; because FPT discrimination extracts information from whether passage time exceeds a threshold or from the full distribution, any alteration in higher moments directly affects error probabilities in the high-noise regime emphasized by the paper. No derivation or numerical verification is supplied showing that the reported exponential improvement is invariant under this collapse.

    Authors: We appreciate the referee pointing out the need for explicit justification of the reformulation. In our model, the effective single state is defined such that the processing time is the sum of the individual step times, and the FPT discrimination is performed on the distribution of this total time. The exponential gain with additional steps comes from the multiplicative effect on the rate ratio for correct versus incorrect substrates in the hypoexponential distribution. While the abstract does not detail this, the main text derives the error probability using the Laplace transform or moment generating function of the sum. To fully address this, we will add a dedicated paragraph in the methods or results section, along with numerical simulations comparing the collapsed and full models to verify invariance of the key results. revision: yes

  2. Referee: [Abstract (final paragraph)] The statement that activation thresholds on product concentrations 'decompose the product-based strategy into a series of FPT based strategies' is introduced without quantification of the resulting error rates or explicit mapping of threshold values onto the FPT discrimination curves derived earlier. This post-hoc construction is load-bearing for the claim that product counting can be made to recover FPT advantages.

    Authors: We acknowledge that the abstract presents this idea without supporting quantification. The full manuscript discusses how thresholds can effectively turn concentration-based readout into multiple FPT-like decisions. In the revision, we will expand this section with explicit calculations of error rates for thresholded cases and provide a mapping or figure showing equivalence to FPT strategies for various threshold values. This will strengthen the reconciliation with conflicting views on KPR performance. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper derives its claims on FPT-based exponential accuracy gains directly from the stochastic model after introducing a convolution-based reformulation of multistep chains into an effective single-state waiting time. This is an explicit modeling simplification whose validity is stated as an assumption rather than a tautological redefinition; the resulting discrimination statistics and comparisons between FPT and product-counting strategies follow from the waiting-time distributions without reducing to fitted parameters or self-citations. No load-bearing self-citation chains, uniqueness theorems, or ansatzes imported from prior author work are present. The derivation remains self-contained relative to the defined stochastic framework.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract provides no explicit list of fitted parameters or new entities; the central reformulation implicitly assumes standard Markovian waiting-time statistics and ligand-binding kinetics drawn from prior KPR literature.

axioms (1)
  • domain assumption Multistep kinetic proofreading can be exactly represented by convolution into a single effective waiting-time distribution without loss of discrimination statistics.
    Invoked in the reformulation step described in the abstract.

pith-pipeline@v0.9.0 · 5819 in / 1220 out tokens · 19645 ms · 2026-05-24T03:54:42.760698+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

  • IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear
    ?
    unclear

    Relation between the paper passage and the cited Recognition theorem.

    we reformulate the theory of kinetic proofreading (KPR) by convolving multiple intermediate states into a single state and then define an overall 'processing' time required to traverse these states. This simplification allows us to succinctly describe kinetic proofreading in terms of a single waiting time parameter

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

  1. [1]

    J. J. Hopfield. Kinetic proofreading: A new mechanism for reducing errors in biosynthetic processes requiring high specificity. Proceedings of the National Academy of Sciences , 71(10):4135–4139, 1974

    work page 1974

  2. [2]

    On some principles governin g molecular evolution

    Motoo Kimura and Tomoko Ohta. On some principles governin g molecular evolution. Proceedings of the National Academy of Sciences , 71(7):2848–2852, July 1974

    work page 1974

  3. [3]

    Petruska, M

    J. Petruska, M. F. Goodman, M. S. Boosalis, L. C. Sowers, C. Cheong, and I. Tinoco. Comparison between DNA melting thermodynamics and DNA polymerase fide lity. Proceedings of the National Academy of Sciences , 85(17):6252–6256, September 1988

    work page 1988

  4. [4]

    Neoantige n-reactive T cells: The driving force behind successful melanoma immunotherapy

    Lindy Davis, Ashley Tarduno, and Yong-Chen Lu. Neoantige n-reactive T cells: The driving force behind successful melanoma immunotherapy. Cancers, 13(23):6061, December 2021

    work page 2021

  5. [5]

    Kinetic amplification of enzyme discrimi nation

    Jacques Ninio. Kinetic amplification of enzyme discrimi nation. Biochimie, 57(5):587–595, 1975

    work page 1975

  6. [6]

    T. W. McKeithan. Kinetic proofreading in T-cell receptor signal transduction. Proceedings of the National Academy of Sciences , 92(11):5042–5046, 1995. 19/30

    work page 1995

  7. [7]

    Huse, and Stanislas Leibler

    Arvind Murugan, David A. Huse, and Stanislas Leibler. Spe ed, dissipation, and error in kinetic proofreading. Proceedings of the National Academy of Sciences , 109(30):12034–12039, 2012

    work page 2012

  8. [8]

    Faeder, and William S

    Tomasz Lipniacki, Beata Hat, James R. Faeder, and William S. Hlavacek. Stochastic effects and bistability in T cell receptor signaling. Journal of Theoretical Biology , 254(1):110–122, 2008

    work page 2008

  9. [9]

    The simplicit y of completion time distributions for common complex biochemical processes

    Golan Bel, Brian Munsky, and Ilya Nemenman. The simplicit y of completion time distributions for common complex biochemical processes. Physical Biology, 7(1):016003, 2009

    work page 2009

  10. [10]

    Jonathan Morgan and Alan E. Lindsay. Modulation of antig en discrimination by duration of immune contacts in a kinetic proofreading model of T cell act ivation with extreme statistics. PLOS Computational Biology , 19(8):e1011216, 2023

    work page 2023

  11. [11]

    Proofreading does not res ult in more reliable ligand discrimina- tion in receptor signaling due to its inherent stochasticit y

    Duncan Kirby and Anton Zilman. Proofreading does not res ult in more reliable ligand discrimina- tion in receptor signaling due to its inherent stochasticit y. Proceedings of the National Academy of Sciences , 120(21):e2212795120, 2023

    work page 2023

  12. [12]

    Modeling T cell antigen discrimination based on feedback control of digital ERK responses

    Gr´ egoire Altan-Bonnet and Ronald N Germain. Modeling T cell antigen discrimination based on feedback control of digital ERK responses. PLoS Biology, 3(11):e356, 2005

    work page 2005

  13. [13]

    Principles ofadaptive sorting revealed by in silico evolu- tion

    Jean-Beno ˆ ıt Lalanne and Paul Fran¸ cois. Principles ofadaptive sorting revealed by in silico evolu- tion. Physical Review Letters , 110(21):218102, 2013

    work page 2013

  14. [14]

    Tischer and Orion David Weiner

    Doug K. Tischer and Orion David Weiner. Light-based tuni ng of ligand half-life supports kinetic proofreading model of T cell signaling. eLife, 8:e42498, 2019

    work page 2019

  15. [15]

    K utuzov, Daniel B

    Johannes Pettmann, Anna Huhn, Enas Abu Shah, Mikhail A. K utuzov, Daniel B. Wilson, Michael L. Dustin, Simon J. Davis, P. Anton van der Merwe, and Omer Dushek. The discrimina- tory power of the T cell receptor. eLife, 10:e67092, 2021

    work page 2021

  16. [16]

    Kinetic proofreading thr ough the multi-step activation of the ZAP70 kinase underlies early t cell ligand discrimination

    Guillaume Voisinne, Marie Locard-Paulet, Carine Frome nt, Emilie Maturin, Marisa Goncalves Menoita, Laura Girard, Valentin Mellado, Odile Burlet-Sch iltz, Bernard Malissen, Anne Gonzalez de Peredo, and Romain Roncagalli. Kinetic proofreading thr ough the multi-step activation of the ZAP70 kinase underlies early t cell ligand discrimination. Nature Immunol...

    work page 2022

  17. [17]

    Genetic code translation displays a linear trade-off between efficiency and accuracy of tRNA selectio n

    Magnus Johansson, Jingji Zhang, and M rans Ehrenberg. Genetic code translation displays a linear trade-off between efficiency and accuracy of tRNA selectio n. Proceedings of the National Academy of Sciences , 109(1):131–136, 2011

    work page 2011

  18. [18]

    The ribosome as an optimal decoder: A lesson in molecular recognition

    Yonatan Savir and Tsvi Tlusty. The ribosome as an optimal decoder: A lesson in molecular recognition. Cell, 153(2):471–479, 2013

    work page 2013

  19. [19]

    Kolomeisky, and Oleg A

    Kinshuk Banerjee, Anatoly B. Kolomeisky, and Oleg A. Igo shin. Elucidating interplay of speed and accuracy in biological error correction. Proceedings of the National Academy of Sciences , 114(20):5183–5188, May 2017

    work page 2017

  20. [20]

    Information transduction capacity of noisy biochemical si gnaling networks

    Raymond Cheong, Alex Rhee, Chiaochun Joanne Wang, Ilya N emenman, and Andre Levchenko. Information transduction capacity of noisy biochemical si gnaling networks. Science, 334(6054):354– 358, October 2011

    work page 2011

  21. [21]

    Accurate information transm ission through dynamic biochemical signaling networks

    Jangir Selimkhanov, Brooks Taylor, Jason Yao, Anna Pilk o, John Albeck, Alexander Hoffmann, Lev Tsimring, and Roy Wollman. Accurate information transm ission through dynamic biochemical signaling networks. Science, 346(6215):1370–1373, 2014. 20/30

    work page 2014

  22. [22]

    Ye, Eric Deeds, Roy Wollman, and Alexander Hoff- mann

    Ying Tang, Adewunmi Adelaja, Felix X.-F. Ye, Eric Deeds, Roy Wollman, and Alexander Hoff- mann. Quantifying information accumulation encoded in the dynamics of biochemical signaling. Nature Communications, 12(1):1272, February 2021

    work page 2021

  23. [23]

    Elements of information theory

    Thomas M Cover. Elements of information theory . John Wiley & Sons, 2nd edition, 1999

    work page 1999

  24. [24]

    Gillespie

    Daniel T. Gillespie. Exact stochastic simulation of cou pled chemical reactions. The Journal of Physical Chemistry, 81(25):2340–2361, dec 1977

    work page 1977

  25. [25]

    Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Vira l B. Shah. Julia: A fresh approach to numerical computing. SIAM Review , 59(1):65–98, 2017

    work page 2017

  26. [26]

    Miller, Arsalan S

    Mark J. Miller, Arsalan S. Hejazi, Sindy H. Wei, Michael D . Cahalan, and Ian Parker. T cell repertoire scanning is promoted by dynamic dendritic cell b ehavior and random T cell motility in the lymph node. Proceedings of the National Academy of Sciences , 101(4):998–1003, January 2004

    work page 2004

  27. [27]

    Dynamics of CD8+ T cell p riming by dendritic cells in intact lymph nodes

    Philippe Bousso and Ellen Robey. Dynamics of CD8+ T cell p riming by dendritic cells in intact lymph nodes. Nature Immunology, 4(6):579–585, May 2003

    work page 2003

  28. [28]

    Henrickson, Thorsten R

    Sarah E. Henrickson, Thorsten R. Mempel, Irina B. Mazo, B ai Liu, Maxim N. Artyomov, Huan Zheng, Antonio Peixoto, Michael P. Flynn, Balimkiz Senman, Tobias Junt, Hing C. Wong, Arup K. Chakraborty, and Ulrich H. von Andrian. T cell sensing of ant igen dose governs interactive behavior with dendritic cells and sets a threshold for T cell activati on. Nature...

    work page 2008

  29. [29]

    Bacterial r eplication initiation as precision control by protein counting

    Haochen Fu, Fangzhou Xiao, and Suckjoon Jun. Bacterial r eplication initiation as precision control by protein counting. PRX Life , 1(1):013011, 2023

    work page 2023

  30. [30]

    Evavold, and Cheng Zhu

    Baoyu Liu, Wei Chen, Brian D. Evavold, and Cheng Zhu. Accu mulation of dynamic catch bonds between TCR and agonist peptide-MHC triggers t cell signali ng. Cell, 157(2):357–368, 2014

    work page 2014

  31. [31]

    Sibener, Ricardo A

    Leah V. Sibener, Ricardo A. Fernandes, Elizabeth M. Kola wole, Catherine B. Carbone, Fan Liu, Darren McAffee, Michael E. Birnbaum, Xinbo Yang, Laura F. Su , Wong Yu, Shen Dong, Marvin H. Gee, Kevin M. Jude, Mark M. Davis, Jay T. Groves, William A. Go ddard, James R. Heath, Brian D. Evavold, Ronald D. Vale, and K. Christopher Garcia. Isolation of a structu...

    work page 2018

  32. [32]

    Proofreading through spatial gradients

    Vahe Galstyan, Kabir Husain, Fangzhou Xiao, Arvind Muru gan, and Rob Phillips. Proofreading through spatial gradients. eLife, 9:e60415, 2020

    work page 2020

  33. [33]

    Andrew Rex and Harvey S. Leff. Maxwell’s demon 2: entropy, classical and quantum informat ion, computing. Taylor & Francis, 2003

    work page 2003

  34. [34]

    Pekola, and ´Edgar Rold´ an

    Gonzalo Manzano, Diego Subero, Olivier Maillet, Rosari o Fazio, Jukka P. Pekola, and ´Edgar Rold´ an. Thermodynamics of gambling demons. Physical Review Letters , 126(8):080603, 2021

    work page 2021

  35. [35]

    F. J. Cao and M. Feito. Thermodynamics of feedback contro lled systems. Physical Review E , 79(4), 2009

    work page 2009

  36. [36]

    Kolomeisky, and Oleg A

    Qiwei Yu, Anatoly B. Kolomeisky, and Oleg A. Igoshin. The energy cost and optimal design of networks for biological discrimination. Journal of The Royal Society Interface , 19(188), March 2022. 21/30 S1 Supporting Information A1 Master equation for the stochastic KPR model Here, we consider the master equation associated with the mu lti-round proofreading...

    work page 2022