Eric Goles
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Eric Goles has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Pedro Montealegre
Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez, Santiago, Chile
10 shared publications - Gonzalo A. Ruz
Facultad de Ingeniería y Ciencias, Universidad Adolfo Ibáñez, Santiago, Chile
7 shared publications - Marco Montalva-Medel
Universidad Adolfo Ibáñez
6 shared publications - Kévin Perrot
Aix Marseille Univ CNRS LIS Marseille France
3 shared publications - Alonso Espinoza
Univesidad Adolfo Ibañez
2 shared publications Gonzalo Ruz
2 shared publications
Latest Publications
- Open Access
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
- Vol. 32, 373-398
Robustness of Boolean networks to update modes: An application to hereditary angioedema
Many familial diseases are caused by genetic accidents, which affect both the genome and its epigenetic environment, expressed as an interaction graph between the genes, such as that involved in the familial disease we shall study, the hereditary angioedema. The update of the gene states at the vertices of this graph (1 if a gene is activated, 0 if it is inhibited) can be done in multiple ways, and has been well studied over the last two decades: parallel, sequential, block-sequential, block-parallel, random, etc. We will study a particular graph related to the familial disease proposed as an example, which has subgraphs which activate in an intricate manner (i.e., in an alternating block-parallel mode, with one core constantly updated and two complementary subsets of genes alternating their updating), of which we will study the structural aspects, robust or unstable, in relation to some classical periodic update modes.
- 1 January 2027
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems - S
- Vol. 32, 373-398
Open AccessRobustness of Boolean networks to update modes: An application to hereditary angioedema
Many familial diseases are caused by genetic accidents, which affect both the genome and its epigenetic environment, expressed as an interaction graph between the genes, such as that involved in the familial disease we shall study, the hereditary angioedema. The update of the gene states at the vertices of this graph (1 if a gene is activated, 0 if it is inhibited) can be done in multiple ways, and has been well studied over the last two decades: parallel, sequential, block-sequential, block-parallel, random, etc. We will study a particular graph related to the familial disease proposed as an example, which has subgraphs which activate in an intricate manner (i.e., in an alternating block-parallel mode, with one core constantly updated and two complementary subsets of genes alternating their updating), of which we will study the structural aspects, robust or unstable, in relation to some classical periodic update modes.
- Open Access
- 15 September 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (9) , e0357764
Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Boolean networks are powerful frameworks for capturing the logic of gene-regulatory circuits, yet their combinatorial explosion hampers exhaustive analyses. Here, we present a systematic reduction of a published 31-node Boolean model that describes cisplatin- and pemetrexed-resistance in non-small-cell lung cancer to a compact 9-node core that exactly reproduces the original attractor landscape. Through a sequence of biologically guided reductions ( 31 → 29 → 14 → 9 nodes), the streamlined network shrinks the state space by four orders of magnitude, enabling rapid exploration of critical control points, rules fitting, and candidate therapeutic targets. Extensive synchronous and asynchronous simulations, combined with a Boolean rule-fitting algorithm that removes spurious limit cycles, confirm that the three clinically relevant steady states and their basins of attraction are conserved and reflect resistance frequencies close to those reported in clinical studies. The reduced model provides an accessible scaffold for future mechanistic and drug-discovery studies.
- 15 September 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (9) , e0357764
Open AccessBoolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Boolean networks are powerful frameworks for capturing the logic of gene-regulatory circuits, yet their combinatorial explosion hampers exhaustive analyses. Here, we present a systematic reduction of a published 31-node Boolean model that describes cisplatin- and pemetrexed-resistance in non-small-cell lung cancer to a compact 9-node core that exactly reproduces the original attractor landscape. Through a sequence of biologically guided reductions ( 31 → 29 → 14 → 9 nodes), the streamlined network shrinks the state space by four orders of magnitude, enabling rapid exploration of critical control points, rules fitting, and candidate therapeutic targets. Extensive synchronous and asynchronous simulations, combined with a Boolean rule-fitting algorithm that removes spurious limit cycles, confirm that the three clinically relevant steady states and their basins of attraction are conserved and reflect resistance frequencies close to those reported in clinical studies. The reduced model provides an accessible scaffold for future mechanistic and drug-discovery studies.
- Open Access
Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states {-1, +1}, where the local interactions are based on an L-shaped neighborhood structure. In these automata, once a cell reaches state +1, it remains fixed in that state forever, while cells in state -1 update to the most represented state among their neighborhoods. We consider L-shaped neighborhoods, which mean that the vicinity of a given cell c consists in a subset of cells in the north and east of c.We focus on the prediction problem, a decision problem that involves determining the state of a given cell after a given number of time-steps. We prove that when restricted to the simplest L-shaped neighborhood, consisting of the central cell and its nearest north and east neighbors, the prediction problem belongs to NC, meaning it can be solved efficiently in parallel. We generalize this result for any L-shaped neighborhood of size two. On the other hand, for other L-shaped neighborhoods, the problem becomes P-complete, indicating that the problem might be inherently sequential.
Open AccessComplexity of the Freezing Majority Rule with L-shaped Neighborhoods
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states {-1, +1}, where the local interactions are based on an L-shaped neighborhood structure. In these automata, once a cell reaches state +1, it remains fixed in that state forever, while cells in state -1 update to the most represented state among their neighborhoods. We consider L-shaped neighborhoods, which mean that the vicinity of a given cell c consists in a subset of cells in the north and east of c.We focus on the prediction problem, a decision problem that involves determining the state of a given cell after a given number of time-steps. We prove that when restricted to the simplest L-shaped neighborhood, consisting of the central cell and its nearest north and east neighbors, the prediction problem belongs to NC, meaning it can be solved efficiently in parallel. We generalize this result for any L-shaped neighborhood of size two. On the other hand, for other L-shaped neighborhoods, the problem becomes P-complete, indicating that the problem might be inherently sequential.
- Open Access
Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states $\{-1,+1\}$, where the local interactions are based on an L-shaped neighborhood structure. In these automata, once a cell reaches state $+1$, it remains fixed in that state forever, while cells in state $-1$ update to the most represented state among their neighborhoods. We consider L-shaped neighborhoods, which mean that the vicinity of a given cell $c$ consists in a subset of cells in the north and east of $c$. We focus on the prediction problem, a decision problem that involves determining the state of a given cell after a given number of time-steps. We prove that when restricted to the simplest L-shaped neighborhood, consisting of the central cell and its nearest north and east neighbors, the prediction problem belongs to $\mathsf{NC}$, meaning it can be solved efficiently in parallel. We generalize this result for any L-shaped neighborhood of size two. On the other hand, for other L-shaped neighborhoods, the problem becomes $\mathsf{P}$-complete, indicating that the problem might be inherently sequential.Open AccessComplexity of the Freezing Majority Rule with L-shaped Neighborhoods
In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states $\{-1,+1\}$, where the local interactions are based on an L-shaped neighborhood structure. In these automata, once a cell reaches state $+1$, it remains fixed in that state forever, while cells in state $-1$ update to the most represented state among their neighborhoods. We consider L-shaped neighborhoods, which mean that the vicinity of a given cell $c$ consists in a subset of cells in the north and east of $c$. We focus on the prediction problem, a decision problem that involves determining the state of a given cell after a given number of time-steps. We prove that when restricted to the simplest L-shaped neighborhood, consisting of the central cell and its nearest north and east neighbors, the prediction problem belongs to $\mathsf{NC}$, meaning it can be solved efficiently in parallel. We generalize this result for any L-shaped neighborhood of size two. On the other hand, for other L-shaped neighborhoods, the problem becomes $\mathsf{P}$-complete, indicating that the problem might be inherently sequential. - Open Access
Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Boolean networks are powerful frameworks for capturing the logic of gene-regulatory circuits, yet their combinatorial explosion hampers exhaustive analyses. Here, we present a systematic reduction of a 31-node Boolean model that describes cisplatin- and pemetrexed-resistance in non-small-cell lung cancer to a compact 9-node core that exactly reproduces the original attractor landscape. The streamlined network shrinks the state space by four orders of magnitude, enabling rapid exploration of critical control points, rules fitting and candidate therapeutic targets. Extensive synchronous and asynchronous simulations confirm that the three clinically relevant steady states and their basins of attraction are conserved and reflect resistance frequencies close to those reported in clinical studies. The reduced model provides an accessible scaffold for future mechanistic and drug-discovery studies.
Open AccessBoolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
Boolean networks are powerful frameworks for capturing the logic of gene-regulatory circuits, yet their combinatorial explosion hampers exhaustive analyses. Here, we present a systematic reduction of a 31-node Boolean model that describes cisplatin- and pemetrexed-resistance in non-small-cell lung cancer to a compact 9-node core that exactly reproduces the original attractor landscape. The streamlined network shrinks the state space by four orders of magnitude, enabling rapid exploration of critical control points, rules fitting and candidate therapeutic targets. Extensive synchronous and asynchronous simulations confirm that the three clinically relevant steady states and their basins of attraction are conserved and reflect resistance frequencies close to those reported in clinical studies. The reduced model provides an accessible scaffold for future mechanistic and drug-discovery studies.
- 17 December 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 36 (07)
A cellular automata-based model of rhizosphere colonization by mutualistic bacteria accounts for the role of quorum sensing on successful concentration near plant roots
This study employs a cellular automata (CA) model to investigate the colonization process of Paraburkholderia phytofirmans (PsJN) in the rhizosphere, a complex ecological environment critical to plant–microbe interactions. The proposed CA model simulates bacterial population dynamics, comparing the behavior of the wild-type strain (PsJN WT) with a mutant strain (PsJN-BpI.1) that exhibits impaired quorum sensing (QS), affecting its motility and communication. The model uses a grid where each cell can either be empty or occupied by bacteria. The spread of bacterial colonies is influenced by the state of neighboring cells, with a circular neighborhood used to simulate colony formation. The transition function incorporates both bacterial motility and population control, two critical factors in rhizospheric colonization. Simulation results show that the wild-type strain demonstrates a higher concentration of colonies near the roots, while the mutant strain exhibits reduced growth in these regions. Comparing the simulations with real rhizosphere colonization images confirms the model’s accuracy and highlights the importance of carefully selecting parameters for reliable outcomes. This CA model successfully captures the colonization behavior of PsJN strains in the rhizosphere, providing valuable insights into bacterial ecology and plant–microbe interactions.
- 17 December 2024
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 36 (07)
A cellular automata-based model of rhizosphere colonization by mutualistic bacteria accounts for the role of quorum sensing on successful concentration near plant roots
This study employs a cellular automata (CA) model to investigate the colonization process of Paraburkholderia phytofirmans (PsJN) in the rhizosphere, a complex ecological environment critical to plant–microbe interactions. The proposed CA model simulates bacterial population dynamics, comparing the behavior of the wild-type strain (PsJN WT) with a mutant strain (PsJN-BpI.1) that exhibits impaired quorum sensing (QS), affecting its motility and communication. The model uses a grid where each cell can either be empty or occupied by bacteria. The spread of bacterial colonies is influenced by the state of neighboring cells, with a circular neighborhood used to simulate colony formation. The transition function incorporates both bacterial motility and population control, two critical factors in rhizospheric colonization. Simulation results show that the wild-type strain demonstrates a higher concentration of colonies near the roots, while the mutant strain exhibits reduced growth in these regions. Comparing the simulations with real rhizosphere colonization images confirms the model’s accuracy and highlights the importance of carefully selecting parameters for reliable outcomes. This CA model successfully captures the colonization behavior of PsJN strains in the rhizosphere, providing valuable insights into bacterial ecology and plant–microbe interactions.
- 11 November 2024
- Published by Springer Nature in Natural Computing
- Vol. 24 (1) , 29-66
Sandpiles prediction and crossover on $\mathbb {Z}^2$ within Moore neighborhood- 11 November 2024
- Published by Springer Nature in Natural Computing
- Vol. 24 (1) , 29-66
Sandpiles prediction and crossover on $\mathbb {Z}^2$ within Moore neighborhood- Open Access
- 16 October 2024
- Published by The Royal Society in Royal Society Open Science
- Vol. 11 (10) , 240768
Fungi as Turing automata with oracles
In the article, we aim to understand the responses of living organisms, exemplified by mycelium, to external stimuli through the lens of a Turing machine with an oracle (oTM). To facilitate our exploration, we show that a variant of an oTM is a cellular automaton with an oracle, which aptly captures the intricate behaviours observed in organisms such as fungi, shedding light on their dynamic interactions with their environment. This interaction reveals forms of reflection that can be interpreted as a minimum volume of consciousness. Thus, in our study, we interpret consciousness as a mathematical phenomenon when an arithmetic function is arbitrarily modified. We call these modifications the hybridization of behaviour. oTMs are the mathematical language of this hybridization.
- 16 October 2024
- Published by The Royal Society in Royal Society Open Science
- Vol. 11 (10) , 240768
Open AccessFungi as Turing automata with oracles
In the article, we aim to understand the responses of living organisms, exemplified by mycelium, to external stimuli through the lens of a Turing machine with an oracle (oTM). To facilitate our exploration, we show that a variant of an oTM is a cellular automaton with an oracle, which aptly captures the intricate behaviours observed in organisms such as fungi, shedding light on their dynamic interactions with their environment. This interaction reveals forms of reflection that can be interpreted as a minimum volume of consciousness. Thus, in our study, we interpret consciousness as a mathematical phenomenon when an arithmetic function is arbitrarily modified. We call these modifications the hybridization of behaviour. oTMs are the mathematical language of this hybridization.
- 18 April 2023
- Published by Elsevier in BioSystems
- Vol. 227-228, 104902
Gene regulatory networks with binary weights
- 18 April 2023
- Published by Elsevier in BioSystems
- Vol. 227-228, 104902
Gene regulatory networks with binary weights
- Open Access
- 19 September 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (18) , 3408
On the Complexity of Stable and Biased Majority
A majority automata is a two-state cellular automata, where each cell updates its state according to the most represented state in its neighborhood. A question that naturally arises in the study of these dynamical systems asks whether there exists an efficient algorithm that can be implemented in order to compute the state configuration reached by the system at a given time-step. This problem is called the prediction problem. In this work, we study the prediction problem for a more general setting in which the local functions can be different according to their behavior in tie cases. We define two types of local rules: the stable majority and biased majority. The first one remains invariant in tie cases, and the second one takes the value 1. We call this class the heterogeneous majority cellular automata (HMCA). For this latter class, we show that in one dimension, the prediction problem for HMCA is in NL as a consequence of the dynamics exhibiting a type of bounded change property, while in two or more dimensions, the problem is P-Complete as a consequence of the capability of the system of simulating Boolean circuits.
- 19 September 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (18) , 3408
Open AccessOn the Complexity of Stable and Biased Majority
A majority automata is a two-state cellular automata, where each cell updates its state according to the most represented state in its neighborhood. A question that naturally arises in the study of these dynamical systems asks whether there exists an efficient algorithm that can be implemented in order to compute the state configuration reached by the system at a given time-step. This problem is called the prediction problem. In this work, we study the prediction problem for a more general setting in which the local functions can be different according to their behavior in tie cases. We define two types of local rules: the stable majority and biased majority. The first one remains invariant in tie cases, and the second one takes the value 1. We call this class the heterogeneous majority cellular automata (HMCA). For this latter class, we show that in one dimension, the prediction problem for HMCA is in NL as a consequence of the dynamics exhibiting a type of bounded change property, while in two or more dimensions, the problem is P-Complete as a consequence of the capability of the system of simulating Boolean circuits.