PLOS Computational Biology · 18 Nov 2026
Storing long-lived memories via molecular error correction: A minimal mathematical model of Crick’s memory switch
John J. Vastolah-index 5, Tejas Ramdas, Samuel J. Gershmanh-index 42
Citations by database
Each database indexes a different set of journals, preprints and books, so they are shown side by side rather than blended.
- OpenAlex1
- OpenCitations0
- Crossref0
- Europe PMC0
Citations per year
The current year is still counting.
- 2026 so far0
Abstract
Cells store information in part by attaching molecular marks to proteins and DNA. But because marks can be randomly removed (e.g., due to ambient phosphatase activity) and added (e.g., due to ambient kinase activity), information encoding may be poor, and in the worst case marks may only store information on the time scale of molecular turnover. We identify a high-level strategy cells use to maintain encoding fidelity beyond the time scale of turnover—which we call molecular error correction—and find that it closely resembles an underexplored theoretical proposal by Francis Crick. To assess the effectiveness of molecular error correction, we construct and analyze several minimal mathematical models of molecular memory switches. We find that Crick-like error correction provides an efficient way to improve the lifetime of stored memories, especially compared to redundantly encoding information using a large number of molecules, but that it can yield false positives (and hence low information fidelity) when there is ambient marking activity; given these two competing concerns, the optimal level of error correction is moderate rather than arbitrarily high. We also find that combining error correction with redundant encoding can efficiently and robustly produce memories that last between ten and one hundred times longer than the turnover time scale. Our work provides insight regarding how to model and interrogate noisy molecular memory systems, suggests that error correction is a design principle of molecular memory, and quantitatively connects error correction to observable memory time scales.
What the data shows
- OpenAlex counts 1 citations, the most of the databases. The others count 0.
- Samuel J. Gershman has the highest h-index among the authors (42).
Graph
This paper in the middle, its authors and their most-cited papers below, the papers it cites to the left and the papers citing it to the right. The timeline lays every paper out by year.
Select a node for its details. Drag to pan, scroll to zoom, drag a node to move it.
Start with
Cited by 0 papers
Who cites this paper, from open citation data, with Crossref's record of each; the 100 newest when there are more.
References (86)
What it cites, from open citation data, with Crossref's record of each.
Sign in to see 66 more references
A free account opens the rest of the citing papers and references on every paper’s page.