217 related articles for article (PubMed ID: 23353025)
1. A novel analytical method for evolutionary graph theory problems.
Shakarian P; Roos P; Moores G
Biosystems; 2013 Feb; 111(2):136-44. PubMed ID: 23353025
[TBL] [Abstract][Full Text] [Related]
2. Analytical calculation of average fixation time in evolutionary graphs.
Askari M; Samani KA
Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Oct; 92(4):042707. PubMed ID: 26565272
[TBL] [Abstract][Full Text] [Related]
3. Reproductive value in graph-structured populations.
Maciejewski W
J Theor Biol; 2014 Jan; 340():285-93. PubMed ID: 24096097
[TBL] [Abstract][Full Text] [Related]
4. Evolutionary dynamics on graphs.
Lieberman E; Hauert C; Nowak MA
Nature; 2005 Jan; 433(7023):312-6. PubMed ID: 15662424
[TBL] [Abstract][Full Text] [Related]
5. Fast and asymptotic computation of the fixation probability for Moran processes on graphs.
Alcalde Cuesta F; González Sequeiros P; Lozano Rojo Á
Biosystems; 2015 Mar; 129():25-35. PubMed ID: 25625871
[TBL] [Abstract][Full Text] [Related]
6. Exact results for fixation probability of bithermal evolutionary graphs.
Houchmandzadeh B; Vallade M
Biosystems; 2013 Apr; 112(1):49-54. PubMed ID: 23567507
[TBL] [Abstract][Full Text] [Related]
7. Evolution of cooperation on dynamical graphs.
Kun A; Scheuring I
Biosystems; 2009 Apr; 96(1):65-8. PubMed ID: 19095039
[TBL] [Abstract][Full Text] [Related]
8. Exact numerical calculation of fixation probability and time on graphs.
Hindersin L; Möller M; Traulsen A; Bauer B
Biosystems; 2016 Dec; 150():87-91. PubMed ID: 27555086
[TBL] [Abstract][Full Text] [Related]
9. Martingales and the fixation probability of high-dimensional evolutionary graphs.
Monk T
J Theor Biol; 2018 Aug; 451():10-18. PubMed ID: 29727631
[TBL] [Abstract][Full Text] [Related]
10. A review of evolutionary graph theory with applications to game theory.
Shakarian P; Roos P; Johnson A
Biosystems; 2012 Feb; 107(2):66-80. PubMed ID: 22020107
[TBL] [Abstract][Full Text] [Related]
11. Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.
Barbu A; Zhu SC
IEEE Trans Pattern Anal Mach Intell; 2005 Aug; 27(8):1239-53. PubMed ID: 16119263
[TBL] [Abstract][Full Text] [Related]
12. Bi-level evolutionary graphs with multi-fitness.
Zhang PA; Nie PY; Hu DQ
IET Syst Biol; 2010 Jan; 4(1):33-8. PubMed ID: 20001090
[TBL] [Abstract][Full Text] [Related]
13. Invasion and effective size of graph-structured populations.
Giaimo S; Arranz J; Traulsen A
PLoS Comput Biol; 2018 Nov; 14(11):e1006559. PubMed ID: 30419017
[TBL] [Abstract][Full Text] [Related]
14. Fixation probabilities in graph-structured populations under weak selection.
Allen B; Sample C; Steinhagen P; Shapiro J; King M; Hedspeth T; Goncalves M
PLoS Comput Biol; 2021 Feb; 17(2):e1008695. PubMed ID: 33529219
[TBL] [Abstract][Full Text] [Related]
15. Optimal parallel algorithm for shortest paths problem on interval graphs.
Mishra PK
J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010
[TBL] [Abstract][Full Text] [Related]
16. Two measures of effective population size for graphs.
Broom M; Voelkl B
Evolution; 2012 May; 66(5):1613-23. PubMed ID: 22519794
[TBL] [Abstract][Full Text] [Related]
17. The hierarchical fair competition (HFC) framework for sustainable evolutionary algorithms.
Hu J; Goodman E; Seo K; Fan Z; Rosenberg R
Evol Comput; 2005; 13(2):241-77. PubMed ID: 15969902
[TBL] [Abstract][Full Text] [Related]
18. Universality of fixation probabilities in randomly structured populations.
Adlam B; Nowak MA
Sci Rep; 2014 Oct; 4():6692. PubMed ID: 25346111
[TBL] [Abstract][Full Text] [Related]
19. A framework for estimating the fixation time of an advantageous allele in stepping-stone models.
Hartfield M
J Evol Biol; 2012 Sep; 25(9):1751-64. PubMed ID: 22805049
[TBL] [Abstract][Full Text] [Related]
20. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
Guturu P; Dantu R
IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
