Search Results

Documents authored by Becker, Florent

Artifact
Software
DOI: 10.4230/artifacts.26763
OnTAS simulator

Authors: Florent Becker and Marie de Sainte Marie

Abstract
Cite as

Florent Becker, Marie de Sainte Marie. OnTAS simulator (Software, Source Code). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@misc{dagstuhl-artifact-26763,
   title = {{OnTAS simulator}}, 
   author = {Becker, Florent and de Sainte Marie, Marie},
   note = {Software, swhId: \href{https://archive.softwareheritage.org/swh:1:dir:59706d65ba40d55deb385105a853b5e36198946f;origin=https://gitlab.aliens-lyon.fr/atam-omninuclear-plr-2025-2026/ontas-simulator.git;visit=swh:1:snp:e7e8fc5d7354e2f0872e44fc49c1d24fac20cfa3;anchor=swh:1:rev:9c1b5f8a077aaab53c3078e246052ba5fb7aa230}{\texttt{swh:1:dir:59706d65ba40d55deb385105a853b5e36198946f}} (visited on 2026-07-01)},
   url = {https://gitlab.aliens-lyon.fr/atam-omninuclear-plr-2025-2026/ontas-simulator},
   doi = {10.4230/artifacts.26763},
}
Document
Track B: Automata, Logic, Semantics, and Theory of Programming
DOI: 10.4230/LIPIcs.ICALP.2026.164
Everybody Wants to Be a Seed: Arbitrary Single-Tile Seeds in the Abstract Tile Assembly Model

Authors: Florent Becker and Marie de Sainte Marie

Published in: LIPIcs, Volume 374, 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)

Abstract
Winfree’s abstract Tile Assembly Model (aTAM) is one of the most popular abstract models for DNA nano-computing. This papers presents a seedless version of the aTAM. Instead of a designated seed assembly, any single isolated tile can initiate the assembly. This paper shows that such system can simulate any aTAM system at constant scale and it presents a tile set to do so. All systems can be simulated at scale at most 10 and most of them can be simulated at scale 5, provided that their seeds are large enough. Removing the need for seed in self-assembly is a new way of solving the nucleation problem, that is, the problem of controlling the initialisation of any self-assembly process. It also allows for a convergence of the aTAM towards other classical tiling models, such as Wang’s. The systems presented are based on independent modules made of tiles. The modules are carefully designed so they act kind of like stem cells. When a module self-assembles from an isolated tile, it grows a pseudo-seed which represents the seed of the simulated system with a Hamiltonian cycle along the borders of the corresponding macrotiles. The other modules, which appear later on during the simulation as components of the "regular" macrotiles, depend on each other to self-assemble. In such cases, the assembly is synchronised in a way so that the growth of any pseudo-seed is blocked. This ensures that a macrotile self-assembles only when interacting either with the pseudo-seed or with previously completed macrotiles.
Cite as

Florent Becker and Marie de Sainte Marie. Everybody Wants to Be a Seed: Arbitrary Single-Tile Seeds in the Abstract Tile Assembly Model. In 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 374, pp. 164:1-164:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{becker_et_al:LIPIcs.ICALP.2026.164,
  author =	{Becker, Florent and de Sainte Marie, Marie},
  title =	{{Everybody Wants to Be a Seed: Arbitrary Single-Tile Seeds in the Abstract Tile Assembly Model}},
  booktitle =	{53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)},
  pages =	{164:1--164:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-428-4},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{374},
  editor =	{Bhattacharya, Sayan and Nanongkai, Danupon and Benedikt, Michael and Puppis, Gabriele},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2026.164},
  URN =		{urn:nbn:de:0030-drops-265520},
  doi =		{10.4230/LIPIcs.ICALP.2026.164},
  annote =	{Keywords: DNA origami, self-assembly, kinetic modeling, computational modeling, cellular automata}
}
Document
DOI: 10.4230/LIPIcs.DNA.31.9
Synchronous Versus Asynchronous Tile-Based Self-Assembly

Authors: Florent Becker, Phillip Drake, Matthew J. Patitz, and Trent A. Rogers

Published in: LIPIcs, Volume 347, 31st International Conference on DNA Computing and Molecular Programming (DNA 31) (2025)

Abstract
In this paper we study the relationship between mathematical models of tile-based self-assembly which differ in terms of the synchronicity of tile additions. In the standard abstract Tile Assembly Model (aTAM), each step of assembly consists of a single tile being added to an assembly. At any given time, each location on the perimeter of an assembly to which a tile can legally bind is called a frontier location, and for each step of assembly one frontier location is randomly selected and a tile is added. In the Synchronous Tile Assembly Model (syncTAM), at each step of assembly every frontier location simultaneously receives a tile. Our results show that while directed, non-cooperative syncTAM systems are capable of universal computation (while directed, non-cooperative aTAM systems are known not to be), and they are capable of building shapes that can't be built within the aTAM, the non-cooperative aTAM is also capable of building shapes that can't be built within the syncTAM even cooperatively. We show a variety of results that demonstrate the similarities and differences between these two models.
Cite as

Florent Becker, Phillip Drake, Matthew J. Patitz, and Trent A. Rogers. Synchronous Versus Asynchronous Tile-Based Self-Assembly. In 31st International Conference on DNA Computing and Molecular Programming (DNA 31). Leibniz International Proceedings in Informatics (LIPIcs), Volume 347, pp. 9:1-9:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{becker_et_al:LIPIcs.DNA.31.9,
  author =	{Becker, Florent and Drake, Phillip and Patitz, Matthew J. and Rogers, Trent A.},
  title =	{{Synchronous Versus Asynchronous Tile-Based Self-Assembly}},
  booktitle =	{31st International Conference on DNA Computing and Molecular Programming (DNA 31)},
  pages =	{9:1--9:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-399-7},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{347},
  editor =	{Schaeffer, Josie and Zhang, Fei},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.31.9},
  URN =		{urn:nbn:de:0030-drops-238580},
  doi =		{10.4230/LIPIcs.DNA.31.9},
  annote =	{Keywords: self-assembly, noncooperative self-assembly, models of computation, tile assembly systems}
}
Document
DOI: 10.4230/LIPIcs.DNA.29.2
DNA Tile Self-Assembly for 3D-Surfaces: Towards Genus Identification

Authors: Florent Becker and Shahrzad Heydarshahi

Published in: LIPIcs, Volume 276, 29th International Conference on DNA Computing and Molecular Programming (DNA 29) (2023)

Abstract
We introduce a new DNA tile self-assembly model: the Surface Flexible Tile Assembly Model (SFTAM), where 2D tiles are placed on host 3D surfaces made of axis-parallel unit cubes glued together by their faces, called polycubes. The bonds are flexible, so that the assembly can bind on the edges of the polycube. We are interested in the study of SFTAM self-assemblies on 3D surfaces which are not always embeddable in the Euclidean plane, in order to compare their different behaviors and to compute the topological properties of the host surfaces. We focus on a family of polycubes called order-1 cuboids. Order-0 cuboids are polycubes that have six rectangular faces, and order-1 cuboids are made from two order-0 cuboids by substracting one from the other. Thus, order-1 cuboids can be of genus 0 or of genus 1 (then they contain a tunnel). We are interested in the genus of these structures, and we present a SFTAM tile assembly system that determines the genus of a given order-1 cuboid. The SFTAM tile assembly system which we design, contains a specific set Y of tile types with the following properties. If the assembly is made on a host order-1 cuboid C of genus 0, no tile of Y appears in any producible assembly, but if C has genus 1, every terminal assembly contains at least one tile of Y. Thus, for order-1 cuboids our system is able to distinguish the host surfaces according to their genus, by the tiles used in the assembly. This system is specific to order-1 cuboids but we can expect the techniques we use to be generalizable to other families of shapes.
Cite as

Florent Becker and Shahrzad Heydarshahi. DNA Tile Self-Assembly for 3D-Surfaces: Towards Genus Identification. In 29th International Conference on DNA Computing and Molecular Programming (DNA 29). Leibniz International Proceedings in Informatics (LIPIcs), Volume 276, pp. 2:1-2:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{becker_et_al:LIPIcs.DNA.29.2,
  author =	{Becker, Florent and Heydarshahi, Shahrzad},
  title =	{{DNA Tile Self-Assembly for 3D-Surfaces: Towards Genus Identification}},
  booktitle =	{29th International Conference on DNA Computing and Molecular Programming (DNA 29)},
  pages =	{2:1--2:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-297-6},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{276},
  editor =	{Chen, Ho-Lin and Evans, Constantine G.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DNA.29.2},
  URN =		{urn:nbn:de:0030-drops-187851},
  doi =		{10.4230/LIPIcs.DNA.29.2},
  annote =	{Keywords: Tile self-assembly, DNA computing, Geometric surfaces}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact