Cited by 5Advanced Thermodynamics and Statistical MechanicsComplex Systems and DynamicsPhilosophy and History of Science

Decomposing information into copying versus transformation

Open access
Kolchinsky, Artemy, Corominas-Murtra, Bernat·2020·Journal of The Royal Society Interface

Published version of a preprint

Abstract

In many real-world systems, information can be transmitted in two qualitatively different ways: by copying or by transformation . Copying occurs when messages are transmitted without modification, e.g. when an offspring receives an unaltered copy of a gene from its parent. Transformation occurs when messages are modified systematically during transmission, e.g. when mutational biases occur during genetic replication. Standard information-theoretic measures do not distinguish these two modes of information transfer, although they may reflect different mechanisms and have different functional consequences. Starting from a few simple axioms, we derive a decomposition of mutual information into the information transmitted by copying versus the information transmitted by transformation. We begin with a decomposition that applies when the source and destination of the channel have the same set of messages and a notion of message identity exists. We then generalize our decomposition to other kinds of channels, which can involve different source and destination sets and broader notions of similarity. In addition, we show that copy information can be interpreted as the minimal work needed by a physical copying process, which is relevant for understanding the physics of replication. We use the proposed decomposition to explore a model of amino acid substitution rates. Our results apply to any system in which the fidelity of copying, rather than simple predictability, is of critical relevance.

Integrity signals

Registry

Crossref · 10.1098/rsif.2019.0623

Cites

65 of 65 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Landauer's bound gives the minimal energy required to perform an abstract computation and many string writing operations, including copies and transformations.

    “Landauer’s bound [132] gives us the minimal energy required to perform an abstract computation and many string writing operations, including copies and transformations of it [133].”

    From Fundamental constraints to the logic of living systems (2024) · cites this paper as [133]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Kolchinsky, A., & Corominas-Murtra, B.
Affiliations
  • Santa Fe Institute (US)
  • Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg, Austria
Venue
Journal of The Royal Society Interface
Published
2020-01
Volume
17
Issue
162
Pages
20190623
ISSN
  • 1742-5662 (ISSN-L)
  • 1742-5689
OpenAlex
W2950348941
Cited by
5
References
65
Citations by year
2026: 1 · 2024: 1 · 2021: 1 · 2020: 2
FWCI
0.32
Type
journal article
Language
en
Open access
Locations
  • Journal of The Royal Society Interface (publishedVersion)
  • Europe PMC (PubMed Central) (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Advanced Thermodynamics and Statistical Mechanics
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Systems and Dynamics
  • Social Sciences › Arts and Humanities › History and Philosophy of Science › Philosophy and History of Science
Keywords
information transmission, DNA replication, mutational bias, amino acid substitution rates, information theory
MeSH terms
Copying Processes

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