Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Julio Aracena"'
Publikováno v:
Automata and Complexity ISBN: 9783030925505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a82a24af7db68f54f8e885b0b5fee8e
https://doi.org/10.1007/978-3-030-92551-2_15
https://doi.org/10.1007/978-3-030-92551-2_15
Publikováno v:
SSRN Electronic Journal.
The {\em asynchronous automaton} associated with a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$, considered in many applications, is the finite deterministic automaton where the set of states is $\{0,1\}^n$, the alphabet is $[n]$, and the action of lett
Publikováno v:
Bioinformatics (Oxford, England). 37(8)
Motivation In the modeling of biological systems by Boolean networks, a key problem is finding the set of fixed points of a given network. Some constructed algorithms consider certain structural properties of the regulatory graph like those proposed
The weighted \emph{Sitting Closer to Friends than Enemies} (SCFE) problem is to find an injection of the vertex set of a given weighted graph into a given metric space so that, for every pair of incident edges with different weight, the end vertices
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c8df2dbd80c1546de9e3b13af81e3f3
Publikováno v:
Journal of Computer and System Sciences
Journal of Computer and System Sciences, Elsevier, 2017, 88, pp.145-163. ⟨10.1016/j.jcss.2017.03.016⟩
Journal of Computer and System Sciences, Elsevier, 2017, 88, pp.145-163. ⟨10.1016/j.jcss.2017.03.016⟩
Given a graph $G$, viewed as a loop-less symmetric digraph, we study the maximum number of fixed points in a conjunctive boolean network with $G$ as interaction graph. We prove that if $G$ has no induced $C_4$, then this quantity equals both the numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::183627067bdc586126ac3971cfb9c3a2
https://hal.archives-ouvertes.fr/hal-01630474/file/2017-04-18_MaxFP_Symmetric_Arxiv_V2.pdf
https://hal.archives-ouvertes.fr/hal-01630474/file/2017-04-18_MaxFP_Symmetric_Arxiv_V2.pdf
Publikováno v:
Discrete Applied Mathematics
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
DISCRETE APPLIED MATHEMATICS
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
DISCRETE APPLIED MATHEMATICS
Boolean networks have been used as models of gene regulation and other biological networks, as well as for other kinds of distributed dynamical systems. One key element in these models is the update schedule, which indicates the order in which states
Publikováno v:
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2017, 31 (3), pp.1702-1725. ⟨10.1137/16M1060868⟩
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2017, 31 (3), pp.1702-1725. ⟨10.1137/16M1060868⟩
Given a digraph $G$, a lot of attention has been deserved on the maximum number $\phi(G)$ of fixed points in a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$ with $G$ as interaction graph. In particular, a central problem in network coding consists in stu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba45e2d774e65a1921f97d1b83c4cd48
Publikováno v:
Discrete Applied Mathematics. 159(6):401-409
Boolean networks have been used as models of gene regulation and other biological networks. One key element in these models is the update schedule, which indicates the order in which states have to be updated. In Aracena et al. (2009) [1], the author
Autor:
Julio Aracena
Publikováno v:
BULLETIN OF MATHEMATICAL BIOLOGY
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Boolean networks (BNs) have been extensively used as mathematical models of genetic regulatory networks. The number of fixed points of a BN is a key feature of its dynamical behavior. Here, we study the maximum number of fixed points in a particular
Publikováno v:
Electronic Notes in Discrete Mathematics. 30:249-254
Given a directed graph G = ( V , E ) and w : E → { − 1 , + 1 } a sign function on the arcs of G, we study the positive feedback vertex set problem (PFVS) which consists on finding a minimum cardinality set of vertices that meets all the cycles wi