Evidence map›Paper›PMID 35042812›Full record

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

The time complexity of self-assembly.

Florian M Gartner, Isabella R Graf, Erwin Frey

Abstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
15citing 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

15 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Delay-facilitated self-assembly in compartmentalized systems.Proceedings of the National Academy of Sciences of the United States of America · 2025
    Article
  6. Coarse-Graining Self-Assembly by the Stochastic Landscape Method.Journal of chemical theory and computation · 2025
    Article
  7. Nonequilibrium Self-Assembly Control by the Stochastic Landscape Method.Journal of chemical information and modeling · 2025
    Article
  8. Article
  9. Article
  10. Article
  11. Discovering optimal kinetic pathways for self-assembly using automatic differentiation.Proceedings of the National Academy of Sciences of the United States of America · 2024
    Article
  12. Article
  13. Article
  14. Article
  15. 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

3 authors.

Florian M GartnerDepartment of Physics, Arnold-Sommerfeld-Center for Theoretical Physics, Ludwig-Maximilians-Universität München, D-80333 München, Germany.
Isabella R GrafDepartment of Physics, Arnold-Sommerfeld-Center for Theoretical Physics, Ludwig-Maximilians-Universität München, D-80333 München, Germany.ORCID 0000-0001-9169-9109
Erwin FreyDepartment of Physics, Arnold-Sommerfeld-Center for Theoretical Physics, Ludwig-Maximilians-Universität München, D-80333 München, Germany; frey@lmu.de.ORCID 0000-0001-8792-3358

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Time efficiency of self-assembly is crucial for many biological processes. Moreover, with the advances of nanotechnology, time efficiency in artificial self-assembly becomes ever more important. While structural determinants and the final assembly yield are increasingly well understood, kinetic aspects concerning the time efficiency, however, remain much more elusive. In computer science, the concept of time complexity is used to characterize the efficiency of an algorithm and describes how the algorithm's runtime depends on the size of the input data. Here we characterize the time complexity of nonequilibrium self-assembly processes by exploring how the time required to realize a certain, substantial yield of a given target structure scales with its size. We identify distinct classes of assembly scenarios, i.e., "algorithms" to accomplish this task, and show that they exhibit drastically different degrees of complexity. Our analysis enables us to identify optimal control strategies for nonequilibrium self-assembly processes. Furthermore, we suggest an efficient irreversible scheme for the artificial self-assembly of nanostructures, which complements the state-of-the-art approach using reversible binding reactions and requires no fine-tuning of binding energies.

Indexed as

AlgorithmsComputer SimulationKineticsModels, TheoreticalNanostructuresNanotechnologyPolymersSystems AnalysisTime FactorsPolymersnonequilibrium self-assemblyself-assembly scenariosupply controltime complexitytime efficiency

Identifiers

PMID35042812
PMCPMC8795547

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.