Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Thachuk, Chris"'
Autor:
Gopinath, Ashwin, Thachuk, Chris, Mitskovets, Anya, Atwater, Harry A., Kirkpatrick, David, Rothemund, Paul W. K.
DNA origami is a modular platform for the combination of molecular and colloidal components to create optical, electronic, and biological devices. Integration of such nanoscale devices with microfabricated connectors and circuits is challenging: larg
Externí odkaz:
http://arxiv.org/abs/1808.04544
The promise of chemical computation lies in controlling systems incompatible with traditional electronic micro-controllers, with applications in synthetic biology and nano-scale manufacturing. Computation is typically embedded in kinetics---the speci
Externí odkaz:
http://arxiv.org/abs/1709.08731
Strand displacement and tile assembly systems are designed to follow prescribed kinetic rules (i.e., exhibit a specific time-evolution). However, the expected behavior in the limit of infinite time--known as thermodynamic equilibrium--is often incomp
Externí odkaz:
http://arxiv.org/abs/1709.07922
Publikováno v:
Theoretical Computer Science, Volume 765, 18 April 2019, Pages 67-96
Here we focus on the challenge of verifying the correctness of molecular implementations of abstract chemical reaction networks, where operation in a well-mixed "soup" of molecules is stochastic, asynchronous, concurrent, and often involves multiple
Externí odkaz:
http://arxiv.org/abs/1411.0782
We study the power of uncontrolled random molecular movement in the nubot model of self-assembly. The nubot model is an asynchronous nondeterministic cellular automaton augmented with rigid-body movement rules (push/pull, deterministically and progra
Externí odkaz:
http://arxiv.org/abs/1409.4828
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America, 2018 Dec . 115(52), E12182-E12191.
Externí odkaz:
https://www.jstor.org/stable/26573955
Given a string $w$ over a finite alphabet $\Sigma$ and an integer $K$, can $w$ be partitioned into strings of length at most $K$, such that there are no \emph{collisions}? We refer to this question as the \emph{string partition} problem and show it i
Externí odkaz:
http://arxiv.org/abs/1204.2201
Autor:
Thachuk, Chris
We study the problem of indexing text with wildcard positions, motivated by the challenge of aligning sequencing data to large genomes that contain millions of single nucleotide polymorphisms (SNPs)---positions known to differ between individuals. SN
Externí odkaz:
http://arxiv.org/abs/1101.5376
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.