Simple Intrinsic Simulation of Cellular Automata in Oritatami Molecular Folding Model

Autor: Yuki Ubukata, Daria Pchelina, Shinnosuke Seki, Nicolas Schabanel

Publikováno v: 14th LATIN 2020: São Paulo, Brazil
14th LATIN 2020: São Paulo, Brazil, Jan 2021, Sao Paulo, Brazil. pp.425-436, ⟨10.1007/978-3-030-61792-9_34⟩
LATIN 2020: Theoretical Informatics ISBN: 9783030617912
LATIN

International audience; The Oritatami model was introduced by Geary et al (2016) to study the computational potential of RNA cotranscriptional folding as first shown in wet-lab experiments by Geary et al (Science 2014). In Oritatami model, a molecule

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb84ab9a9cbc77b11bb17847c4555150
https://hal.science/hal-02410874/document

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Oritatami Systems Assemble Shapes No Less Complex Than Tile Assembly Model (ATAM)

Autor: Pchelina, Daria, Schabanel, Nicolas, Seki, Shinnosuke, Theyssier, Guillaume

Publikováno v: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Berenbrink, Petra and Monmege, Benjamin. 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), 219, 2022, Leibniz International Proceedings in Informatics (LIPIcs), 978-3-95977-222-8. ⟨10.4230/LIPIcs.STACS.2022.51⟩

Different models have been proposed to understand natural phenomena at the molecular scale from a computational point of view. Oritatami systems are a model of molecular co-transcriptional folding: the transcript (the "molecule") folds as it is synth

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4d722edf67e46bd51cc91db1b1bf2277

Simulation of inventory systems with unknown input models: a data-driven approach.

Autor: Akcay, Alp¹ (AUTHOR), Corlu, Canan G.² (AUTHOR) canan@bu.edu

Publikováno v: International Journal of Production Research. Oct2017, Vol. 55 Issue 19, p5826-5840. 15p.

On the cost of simulating a parallel Boolean automata network with a block-sequential one

Autor: Bridoux, Florian, Guillon, Pierre, Perrot, Kévin, Sené, Sylvain, Theyssier, Guillaume

Publikováno v: Proceedings of TAMC'17
Proceedings of TAMC'17, Apr 2017, Bern, Switzerland. pp.112--128

arXiv:1702.03101; International audience; In this article we study the minimum number $\kappa$ of additional automata that a Boolean automata network (BAN) associated with a given block-sequential update schedule needs in order to simulate a given BA

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::79294cc5f2fd3c29e7cfe2cbac69bc03
https://hal.science/hal-01479439/file/TAMC_2017_paper_39.pdf