MétaCan
Menu
Back to cohort
Record W2555455530 · doi:10.1109/allerton.2009.5394927

Controlling errors in the process of molecular self-assembly

2009· article· en· W2555455530 on OpenAlexaff
Ya Meng, Navin Kashyap

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicDNA and Biological Computing
Canadian institutionsQueen's University
Fundersnot available
KeywordsTileProofreadingProcess (computing)Computer scienceSet (abstract data type)ComputationAlgorithmProgramming languagePhysicsMaterials science

Abstract

fetched live from OpenAlex

The problem of controlling errors in the process of molecular self-assembly is of central importance in biomolecular computation. The stochastic nature of the self-assembly process leads to assembly errors, i.e., deviations from ideal growth of the assembly. Many different constructions of proofreading tile sets have been proposed in the literature to reduce the effect of such assembly errors. Another major error mechanism affecting the self-assembly process in practice is that of imperfections within the tiles themselves. This source of error has, surprisingly, received little prior attention. In this work, we consider a scenario in which some small proportion of the tiles in a tile set are ¿malformed¿. We study, through simulations, the effect of such malformed tiles on the self-assembly process within the kinetic Tile Assembly Model (kTAM). The simulation results show that some tile set constructions show greater error-resilience in the presence of malformed tiles than others. But, most notably, the snaked proofreading tile set of Chen and Goel fails to form even moderately-sized tile assemblies when malformed tiles are present. We present modifications of the snaked proofreading construction that indicate that it is possible to design tile sets that are not just robust with respect to errors intrinsic to the self-assembly process, but also with respect to malformed tiles.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.013
Threshold uncertainty score0.164

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.007
GPT teacher head0.260
Teacher spread0.253 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicDNA and Biological ComputingFrench-language works237,207