Storing long-lived memories via molecular error correction: a minimal mathematical model of Crick’s memory switch Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.1101/2025.11.13.688304
Molecular memory storage mechanisms face two serious obstacles: they must be robust to the intrinsic noise characteristic of molecular-scale processes, and they must rely on components (like proteins) whose effective lifetimes are limited for biophysical reasons. For example, if one stores a memory by attaching a post-translational ‘mark’ to a protein, naively the lifetime of that memory is limited by protein turnover and ambient demarking activity. In this work, we investigate the principles of persistent and noise-robust molecular memory by studying simple mathematical models of protein-marking-state-based memory switches. We pay special attention to two possible strategies for improving memory storage: effectively averaging over noise by using a large number of proteins, and an enzyme-based ‘error correction’ mechanism first proposed by Francis Crick. Through an exhaustive mathematical analysis of these models, which includes solving most of them exactly, we find that error correction provides an effective mechanism for storing long-lived memories, and that using large populations of proteins only slightly improves the lifetime of stored memories. But we also find that error correction is not always useful, since too much of it can make the probability of false positives excessively high. Our findings lend credence to Crick’s proposal, and suggest motifs that may be exploited by potential intracellular memory storage mechanisms. Finally, in addressing these issues, we also provide general insight about how to define memory performance in the molecular setting, as well as associated notions like lifetime and capacity.
Related Topics
- Type
- article
- Landing Page
- https://doi.org/10.1101/2025.11.13.688304
- OA Status
- green
- References
- 66
- OpenAlex ID
- https://openalex.org/W4416347344
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4416347344Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1101/2025.11.13.688304Digital Object Identifier
- Title
-
Storing long-lived memories via molecular error correction: a minimal mathematical model of Crick’s memory switchWork title
- Type
-
articleOpenAlex work type
- Publication year
-
2025Year of publication
- Publication date
-
2025-11-13Full publication date if available
- Authors
-
Tejas Ramdas, Samuel J. GershmanList of authors in order
- Landing page
-
https://doi.org/10.1101/2025.11.13.688304Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.1101/2025.11.13.688304Direct OA link when available
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
66Number of works referenced by this work
Full payload
| id | https://openalex.org/W4416347344 |
|---|---|
| doi | https://doi.org/10.1101/2025.11.13.688304 |
| ids.doi | https://doi.org/10.1101/2025.11.13.688304 |
| ids.openalex | https://openalex.org/W4416347344 |
| fwci | |
| type | article |
| title | Storing long-lived memories via molecular error correction: a minimal mathematical model of Crick’s memory switch |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| language | |
| locations[0].id | doi:10.1101/2025.11.13.688304 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306402567 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | bioRxiv (Cold Spring Harbor Laboratory) |
| locations[0].source.host_organization | https://openalex.org/I2750212522 |
| locations[0].source.host_organization_name | Cold Spring Harbor Laboratory |
| locations[0].source.host_organization_lineage | https://openalex.org/I2750212522 |
| locations[0].license | cc-by |
| locations[0].pdf_url | |
| locations[0].version | acceptedVersion |
| locations[0].raw_type | posted-content |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://doi.org/10.1101/2025.11.13.688304 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5120410681 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-3862-9309 |
| authorships[0].author.display_name | Tejas Ramdas |
| authorships[0].countries | US |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I2801851002 |
| authorships[0].affiliations[0].raw_affiliation_string | Harvard University |
| authorships[0].institutions[0].id | https://openalex.org/I2801851002 |
| authorships[0].institutions[0].ror | https://ror.org/006v7bf86 |
| authorships[0].institutions[0].type | other |
| authorships[0].institutions[0].lineage | https://openalex.org/I136199984, https://openalex.org/I2801851002 |
| authorships[0].institutions[0].country_code | US |
| authorships[0].institutions[0].display_name | Harvard University Press |
| authorships[0].author_position | last |
| authorships[0].raw_author_name | Tejas Ramdas |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Harvard University |
| authorships[1].author.id | https://openalex.org/A5031715686 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-6546-3298 |
| authorships[1].author.display_name | Samuel J. Gershman |
| authorships[1].countries | US |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I2801851002 |
| authorships[1].affiliations[0].raw_affiliation_string | Harvard University |
| authorships[1].institutions[0].id | https://openalex.org/I2801851002 |
| authorships[1].institutions[0].ror | https://ror.org/006v7bf86 |
| authorships[1].institutions[0].type | other |
| authorships[1].institutions[0].lineage | https://openalex.org/I136199984, https://openalex.org/I2801851002 |
| authorships[1].institutions[0].country_code | US |
| authorships[1].institutions[0].display_name | Harvard University Press |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Samuel J. Gershman |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Harvard University |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.1101/2025.11.13.688304 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-11-14T00:00:00 |
| display_name | Storing long-lived memories via molecular error correction: a minimal mathematical model of Crick’s memory switch |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-28T11:49:44.466810 |
| primary_topic | |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1101/2025.11.13.688304 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402567 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | bioRxiv (Cold Spring Harbor Laboratory) |
| best_oa_location.source.host_organization | https://openalex.org/I2750212522 |
| best_oa_location.source.host_organization_name | Cold Spring Harbor Laboratory |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I2750212522 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | |
| best_oa_location.version | acceptedVersion |
| best_oa_location.raw_type | posted-content |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://doi.org/10.1101/2025.11.13.688304 |
| primary_location.id | doi:10.1101/2025.11.13.688304 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306402567 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | bioRxiv (Cold Spring Harbor Laboratory) |
| primary_location.source.host_organization | https://openalex.org/I2750212522 |
| primary_location.source.host_organization_name | Cold Spring Harbor Laboratory |
| primary_location.source.host_organization_lineage | https://openalex.org/I2750212522 |
| primary_location.license | cc-by |
| primary_location.pdf_url | |
| primary_location.version | acceptedVersion |
| primary_location.raw_type | posted-content |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://doi.org/10.1101/2025.11.13.688304 |
| publication_date | 2025-11-13 |
| publication_year | 2025 |
| referenced_works | https://openalex.org/W1998313484, https://openalex.org/W2410837675, https://openalex.org/W4313563783, https://openalex.org/W2087576389, https://openalex.org/W2733072349, https://openalex.org/W3118309020, https://openalex.org/W2132376233, https://openalex.org/W2169171221, https://openalex.org/W4310069178, https://openalex.org/W2011612267, https://openalex.org/W2801844880, https://openalex.org/W3190819343, https://openalex.org/W1978730538, https://openalex.org/W2087445908, https://openalex.org/W2107003257, https://openalex.org/W2038990611, https://openalex.org/W2018419725, https://openalex.org/W4390022432, https://openalex.org/W2121295901, https://openalex.org/W830547093, https://openalex.org/W2018435536, https://openalex.org/W2096705138, https://openalex.org/W2080252570, https://openalex.org/W1976714996, https://openalex.org/W4311676301, https://openalex.org/W4404528005, https://openalex.org/W4403122967, https://openalex.org/W4239833133, https://openalex.org/W3216013705, https://openalex.org/W4408659624, https://openalex.org/W4226147323, https://openalex.org/W2131215403, https://openalex.org/W2012910855, https://openalex.org/W1481052392, https://openalex.org/W1985534367, https://openalex.org/W2236749972, https://openalex.org/W1995875735, https://openalex.org/W2478708596, https://openalex.org/W1508769776, https://openalex.org/W2751360340, https://openalex.org/W4383999083, https://openalex.org/W2113501460, https://openalex.org/W2167154952, https://openalex.org/W2124924107, https://openalex.org/W2046451925, https://openalex.org/W2066594542, https://openalex.org/W2508210889, https://openalex.org/W2141545875, https://openalex.org/W2048438929, https://openalex.org/W2128084896, https://openalex.org/W2112246162, https://openalex.org/W2108899751, https://openalex.org/W2021235911, https://openalex.org/W4294237868, https://openalex.org/W2060941075, https://openalex.org/W2096551329, https://openalex.org/W2951196187, https://openalex.org/W3014345701, https://openalex.org/W4403244018, https://openalex.org/W2010920096, https://openalex.org/W2028360365, https://openalex.org/W2080792322, https://openalex.org/W2043014754, https://openalex.org/W2129386380, https://openalex.org/W2529605558, https://openalex.org/W2155418451 |
| referenced_works_count | 66 |
| abstract_inverted_index.a | 42, 46, 50, 107 |
| abstract_inverted_index.In | 67 |
| abstract_inverted_index.We | 89 |
| abstract_inverted_index.an | 113, 124, 144 |
| abstract_inverted_index.as | 231, 233 |
| abstract_inverted_index.be | 11, 203 |
| abstract_inverted_index.by | 44, 60, 80, 105, 120, 205 |
| abstract_inverted_index.if | 39 |
| abstract_inverted_index.in | 212, 227 |
| abstract_inverted_index.is | 58, 173 |
| abstract_inverted_index.it | 181 |
| abstract_inverted_index.of | 18, 55, 74, 85, 110, 128, 135, 156, 163, 180, 186 |
| abstract_inverted_index.on | 25 |
| abstract_inverted_index.to | 13, 49, 93, 195, 223 |
| abstract_inverted_index.we | 70, 138, 167, 216 |
| abstract_inverted_index.But | 166 |
| abstract_inverted_index.For | 37 |
| abstract_inverted_index.Our | 191 |
| abstract_inverted_index.and | 21, 63, 76, 112, 151, 198, 238 |
| abstract_inverted_index.are | 32 |
| abstract_inverted_index.can | 182 |
| abstract_inverted_index.for | 34, 97, 147 |
| abstract_inverted_index.how | 222 |
| abstract_inverted_index.may | 202 |
| abstract_inverted_index.not | 174 |
| abstract_inverted_index.one | 40 |
| abstract_inverted_index.pay | 90 |
| abstract_inverted_index.the | 14, 53, 72, 161, 184, 228 |
| abstract_inverted_index.too | 178 |
| abstract_inverted_index.two | 6, 94 |
| abstract_inverted_index.also | 168, 217 |
| abstract_inverted_index.face | 5 |
| abstract_inverted_index.find | 139, 169 |
| abstract_inverted_index.lend | 193 |
| abstract_inverted_index.like | 236 |
| abstract_inverted_index.make | 183 |
| abstract_inverted_index.most | 134 |
| abstract_inverted_index.much | 179 |
| abstract_inverted_index.must | 10, 23 |
| abstract_inverted_index.only | 158 |
| abstract_inverted_index.over | 103 |
| abstract_inverted_index.rely | 24 |
| abstract_inverted_index.that | 56, 140, 152, 170, 201 |
| abstract_inverted_index.them | 136 |
| abstract_inverted_index.they | 9, 22 |
| abstract_inverted_index.this | 68 |
| abstract_inverted_index.well | 232 |
| abstract_inverted_index.(like | 27 |
| abstract_inverted_index.about | 221 |
| abstract_inverted_index.error | 141, 171 |
| abstract_inverted_index.false | 187 |
| abstract_inverted_index.first | 118 |
| abstract_inverted_index.high. | 190 |
| abstract_inverted_index.large | 108, 154 |
| abstract_inverted_index.noise | 16, 104 |
| abstract_inverted_index.since | 177 |
| abstract_inverted_index.these | 129, 214 |
| abstract_inverted_index.using | 106, 153 |
| abstract_inverted_index.which | 131 |
| abstract_inverted_index.whose | 29 |
| abstract_inverted_index.work, | 69 |
| abstract_inverted_index.Crick. | 122 |
| abstract_inverted_index.always | 175 |
| abstract_inverted_index.define | 224 |
| abstract_inverted_index.memory | 2, 43, 57, 79, 87, 99, 208, 225 |
| abstract_inverted_index.models | 84 |
| abstract_inverted_index.motifs | 200 |
| abstract_inverted_index.number | 109 |
| abstract_inverted_index.robust | 12 |
| abstract_inverted_index.simple | 82 |
| abstract_inverted_index.stored | 164 |
| abstract_inverted_index.stores | 41 |
| abstract_inverted_index.Francis | 121 |
| abstract_inverted_index.Through | 123 |
| abstract_inverted_index.ambient | 64 |
| abstract_inverted_index.general | 219 |
| abstract_inverted_index.insight | 220 |
| abstract_inverted_index.issues, | 215 |
| abstract_inverted_index.limited | 33, 59 |
| abstract_inverted_index.models, | 130 |
| abstract_inverted_index.naively | 52 |
| abstract_inverted_index.notions | 235 |
| abstract_inverted_index.protein | 61 |
| abstract_inverted_index.provide | 218 |
| abstract_inverted_index.serious | 7 |
| abstract_inverted_index.solving | 133 |
| abstract_inverted_index.special | 91 |
| abstract_inverted_index.storage | 3, 209 |
| abstract_inverted_index.storing | 148 |
| abstract_inverted_index.suggest | 199 |
| abstract_inverted_index.useful, | 176 |
| abstract_inverted_index.Abstract | 0 |
| abstract_inverted_index.Finally, | 211 |
| abstract_inverted_index.analysis | 127 |
| abstract_inverted_index.credence | 194 |
| abstract_inverted_index.exactly, | 137 |
| abstract_inverted_index.example, | 38 |
| abstract_inverted_index.findings | 192 |
| abstract_inverted_index.improves | 160 |
| abstract_inverted_index.includes | 132 |
| abstract_inverted_index.lifetime | 54, 162, 237 |
| abstract_inverted_index.possible | 95 |
| abstract_inverted_index.proposed | 119 |
| abstract_inverted_index.protein, | 51 |
| abstract_inverted_index.proteins | 157 |
| abstract_inverted_index.provides | 143 |
| abstract_inverted_index.reasons. | 36 |
| abstract_inverted_index.setting, | 230 |
| abstract_inverted_index.slightly | 159 |
| abstract_inverted_index.storage: | 100 |
| abstract_inverted_index.studying | 81 |
| abstract_inverted_index.turnover | 62 |
| abstract_inverted_index.‘error | 115 |
| abstract_inverted_index.Crick’s | 196 |
| abstract_inverted_index.Molecular | 1 |
| abstract_inverted_index.activity. | 66 |
| abstract_inverted_index.attaching | 45 |
| abstract_inverted_index.attention | 92 |
| abstract_inverted_index.averaging | 102 |
| abstract_inverted_index.capacity. | 239 |
| abstract_inverted_index.demarking | 65 |
| abstract_inverted_index.effective | 30, 145 |
| abstract_inverted_index.exploited | 204 |
| abstract_inverted_index.improving | 98 |
| abstract_inverted_index.intrinsic | 15 |
| abstract_inverted_index.lifetimes | 31 |
| abstract_inverted_index.mechanism | 117, 146 |
| abstract_inverted_index.memories, | 150 |
| abstract_inverted_index.memories. | 165 |
| abstract_inverted_index.molecular | 78, 229 |
| abstract_inverted_index.positives | 188 |
| abstract_inverted_index.potential | 206 |
| abstract_inverted_index.proposal, | 197 |
| abstract_inverted_index.proteins) | 28 |
| abstract_inverted_index.proteins, | 111 |
| abstract_inverted_index.switches. | 88 |
| abstract_inverted_index.addressing | 213 |
| abstract_inverted_index.associated | 234 |
| abstract_inverted_index.components | 26 |
| abstract_inverted_index.correction | 142, 172 |
| abstract_inverted_index.exhaustive | 125 |
| abstract_inverted_index.long-lived | 149 |
| abstract_inverted_index.mechanisms | 4 |
| abstract_inverted_index.obstacles: | 8 |
| abstract_inverted_index.persistent | 75 |
| abstract_inverted_index.principles | 73 |
| abstract_inverted_index.processes, | 20 |
| abstract_inverted_index.strategies | 96 |
| abstract_inverted_index.‘mark’ | 48 |
| abstract_inverted_index.biophysical | 35 |
| abstract_inverted_index.effectively | 101 |
| abstract_inverted_index.excessively | 189 |
| abstract_inverted_index.investigate | 71 |
| abstract_inverted_index.mechanisms. | 210 |
| abstract_inverted_index.performance | 226 |
| abstract_inverted_index.populations | 155 |
| abstract_inverted_index.probability | 185 |
| abstract_inverted_index.enzyme-based | 114 |
| abstract_inverted_index.mathematical | 83, 126 |
| abstract_inverted_index.noise-robust | 77 |
| abstract_inverted_index.correction’ | 116 |
| abstract_inverted_index.intracellular | 207 |
| abstract_inverted_index.characteristic | 17 |
| abstract_inverted_index.molecular-scale | 19 |
| abstract_inverted_index.post-translational | 47 |
| abstract_inverted_index.protein-marking-state-based | 86 |
| cited_by_percentile_year | |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| citation_normalized_percentile |