Cargando…

On discovering functions in actin filament automata

We simulate an actin filament as an automaton network. Every atom takes two or three states and updates its state, in discrete time, depending on a ratio of its neighbours in some selected state. All atoms/automata simultaneously update their states by the same rule. Two state transition rules are c...

Descripción completa

Detalles Bibliográficos
Autor principal: Adamatzky, Andrew
Formato: Online Artículo Texto
Lenguaje:English
Publicado: The Royal Society 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6366232/
https://www.ncbi.nlm.nih.gov/pubmed/30800370
http://dx.doi.org/10.1098/rsos.181198
_version_ 1783393584707272704
author Adamatzky, Andrew
author_facet Adamatzky, Andrew
author_sort Adamatzky, Andrew
collection PubMed
description We simulate an actin filament as an automaton network. Every atom takes two or three states and updates its state, in discrete time, depending on a ratio of its neighbours in some selected state. All atoms/automata simultaneously update their states by the same rule. Two state transition rules are considered. In semi-totalistic Game of Life like actin filament automaton atoms take binary states ‘0’ and ‘1’ and update their states depending on a ratio of neighbours in the state ‘1’. In excitable actin filament automaton atoms take three states: resting, excited and refractory. A resting atom excites if a ratio of its excited neighbours belong to some specified interval; transitions from excited state to refractory state and from refractory state to resting state are unconditional. In computational experiments, we implement mappings of an 8-bit input string to an 8-bit output string via dynamics of perturbation/excitation on actin filament automata. We assign eight domains in an actin filament as I/O ports. To write True to a port, we perturb/excite a certain percentage of the nodes in the domain corresponding to the port. We read outputs at the ports after some time interval. A port is considered to be in a state True if a number of excited nodes in the port's domain exceed a certain threshold. A range of eight-argument Boolean functions is uncovered in a series of computational trials when all possible configurations of eight-elements binary strings were mapped onto excitation outputs of the I/O domains.
format Online
Article
Text
id pubmed-6366232
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher The Royal Society
record_format MEDLINE/PubMed
spelling pubmed-63662322019-02-22 On discovering functions in actin filament automata Adamatzky, Andrew R Soc Open Sci Computer Science We simulate an actin filament as an automaton network. Every atom takes two or three states and updates its state, in discrete time, depending on a ratio of its neighbours in some selected state. All atoms/automata simultaneously update their states by the same rule. Two state transition rules are considered. In semi-totalistic Game of Life like actin filament automaton atoms take binary states ‘0’ and ‘1’ and update their states depending on a ratio of neighbours in the state ‘1’. In excitable actin filament automaton atoms take three states: resting, excited and refractory. A resting atom excites if a ratio of its excited neighbours belong to some specified interval; transitions from excited state to refractory state and from refractory state to resting state are unconditional. In computational experiments, we implement mappings of an 8-bit input string to an 8-bit output string via dynamics of perturbation/excitation on actin filament automata. We assign eight domains in an actin filament as I/O ports. To write True to a port, we perturb/excite a certain percentage of the nodes in the domain corresponding to the port. We read outputs at the ports after some time interval. A port is considered to be in a state True if a number of excited nodes in the port's domain exceed a certain threshold. A range of eight-argument Boolean functions is uncovered in a series of computational trials when all possible configurations of eight-elements binary strings were mapped onto excitation outputs of the I/O domains. The Royal Society 2019-01-23 /pmc/articles/PMC6366232/ /pubmed/30800370 http://dx.doi.org/10.1098/rsos.181198 Text en © 2019 The Authors. http://creativecommons.org/licenses/by/4.0/ Published by the Royal Society under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/, which permits unrestricted use, provided the original author and source are credited.
spellingShingle Computer Science
Adamatzky, Andrew
On discovering functions in actin filament automata
title On discovering functions in actin filament automata
title_full On discovering functions in actin filament automata
title_fullStr On discovering functions in actin filament automata
title_full_unstemmed On discovering functions in actin filament automata
title_short On discovering functions in actin filament automata
title_sort on discovering functions in actin filament automata
topic Computer Science
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6366232/
https://www.ncbi.nlm.nih.gov/pubmed/30800370
http://dx.doi.org/10.1098/rsos.181198
work_keys_str_mv AT adamatzkyandrew ondiscoveringfunctionsinactinfilamentautomata