Evidence map›Paper›PMID 29158398›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2017

Model-driven engineering of supramolecular buffering by multivalency.

Tim F E Paffen, Abraham J P Teunissen, Tom F A de Greef, E W Meijer

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Reciprocity in dynamics of supramolecular biosystems for the clustering of ligands and receptors.Proceedings of the National Academy of Sciences of the United States of America · 2025
    Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Tim F E PaffenInstitute for Complex Molecular Systems, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands.
Abraham J P TeunissenInstitute for Complex Molecular Systems, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands.
Tom F A de GreefInstitute for Complex Molecular Systems, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands; t.f.a.d.greef@tue.nl E.W.Meijer@tue.nl.
E W MeijerInstitute for Complex Molecular Systems, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands; t.f.a.d.greef@tue.nl E.W.Meijer@tue.nl.ORCID 0000-0003-4126-7492

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

A supramolecular system in which the concentration of a molecule is buffered over several orders of magnitude is presented. Molecular buffering is achieved as a result of competition in a ring-chain equilibrium of multivalent ureidopyrimidinone monomers and a monovalent naphthyridine molecule which acts as an end-capper. While we previously only considered divalent ureidopyrimidinone monomers we now present a model-driven engineering approach to improve molecular buffering using multivalent ring-chain systems. Our theoretical models reveal an odd-even effect where even-valent molecules show superior buffering capabilities. Furthermore, we predict that supramolecular buffering can be significantly improved using a tetravalent instead of a divalent molecule, since the tetravalent molecule can form two intramolecular rings with different "stabilities" due to statistical effects. Our model predictions are validated against experimental

Indexed as

molecular bufferingmultivalencyring–chain equilibriasupramolecular

Identifiers

PMID29158398
PMCPMC5724267

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.