Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Fernando Alcalde Cuesta"'
Publikováno v:
Scientific Reports, Vol 7, Iss 1, Pp 1-11 (2017)
Abstract Rent’s rule is empirical power law introduced in an effort to describe and optimize the wiring complexity of computer logic graphs. It is known that brain and neuronal networks also obey Rent’s rule, which is consistent with the idea tha
Externí odkaz:
https://doaj.org/article/7e963fe7dff3481986bb55ff2520b715
Publikováno v:
PLoS ONE, Vol 13, Iss 11, p e0200670 (2018)
The evolutionary dynamics of a finite population where resident individuals are replaced by mutant ones depends on its spatial structure. Usually, the population adopts the form of an undirected graph where the place occupied by each individual is re
Externí odkaz:
https://doaj.org/article/748151e8359d4799ae0f5ece06f29b07
Publikováno v:
PLoS ONE, Vol 12, Iss 7, p e0180549 (2017)
Inspired by recent works on evolutionary graph theory, an area of growing interest in mathematical and computational biology, we present examples of undirected structures acting as suppressors of selection for any fitness value r > 1. This means that
Externí odkaz:
https://doaj.org/article/e2fef07ab2334f72b4a20a680b987b08
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Proceedings of the American Mathematical Society. 149:2679-2691
We construct an uncountable family of transversely Cantor laminations of compact spaces defined by free minimal actions of solvable groups, which are not affable and whose orbits are not quasi-isometric to Cayley graphs.
12 pages, 3 figures, to
12 pages, 3 figures, to
Publikováno v:
Journal of Theoretical Biology. 534:110942
In this paper we introduce random proliferation models on graphs. We consider two types of particles: type-1/mutant/invader/red particles proliferates on a population of type-2/wild-type/resident/blue particles. Unlike the well-known Moran model on g
The evolutionary dynamics of a finite population where resident individuals are replaced by mutant ones depends on its spatial structure. The population adopts the form of an undirected graph where the place occupied by each individual is represented
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c16bfbc339240bae9b4bf08dcfb3482
https://doi.org/10.1101/361337
https://doi.org/10.1101/361337
Publikováno v:
Zaguán. Repositorio Digital de la Universidad de Zaragoza
instname
PLoS ONE, Vol 12, Iss 7, p e0180549 (2017)
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
PLoS ONE
instname
PLoS ONE, Vol 12, Iss 7, p e0180549 (2017)
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
PLoS ONE
Inspired by recent works on evolutionary graph theory, an area of growing interest in mathematical and computational biology, we present the first known examples of undirected structures acting as suppressors of selection for any fitness value $r > 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0c0f48d804965cedc30e1fcd0257c4e8
http://zaguan.unizar.es/record/61989
http://zaguan.unizar.es/record/61989
Publikováno v:
Bioinformatics and Biomedical Engineering ISBN: 9783319561530
IWBBIO (2)
IWBBIO (2)
We present a extremely precise database of the fixation probabilities of mutant individuals in a non-homogeneous population which are spatially arranged on a small graph. We explore what features of a graph increase the chances of a beneficial allele
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5144e4300c5683d76ac45c7f9ce74dbb
https://doi.org/10.1007/978-3-319-56154-7_20
https://doi.org/10.1007/978-3-319-56154-7_20
Publikováno v:
Zaguán. Repositorio Digital de la Universidad de Zaragoza
instname
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Scientific Reports
instname
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Scientific Reports
For a network, the accomplishment of its functions despite perturbations is called robustness. Although this property has been extensively studied, in most cases, the network is modified by removing nodes. In our approach, it is no longer perturbed b