These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
4. Artificial evolution by viability rather than competition. Maesani A; Fernando PR; Floreano D PLoS One; 2014; 9(1):e86831. PubMed ID: 24489790 [TBL] [Abstract][Full Text] [Related]
5. Constructing robust and efficient experimental designs in groundwater modeling using a Galerkin method, proper orthogonal decomposition, and metaheuristic algorithms. Ushijima TT; Yeh WWG; Wong WK PLoS One; 2021; 16(8):e0254620. PubMed ID: 34351931 [TBL] [Abstract][Full Text] [Related]
6. Predicting the evolution of sex on complex fitness landscapes. Misevic D; Kouyos RD; Bonhoeffer S PLoS Comput Biol; 2009 Sep; 5(9):e1000510. PubMed ID: 19763171 [TBL] [Abstract][Full Text] [Related]
7. On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments. Qian C; Yu Y; Tang K; Jin Y; Yao X; Zhou ZH Evol Comput; 2018; 26(2):237-267. PubMed ID: 27982697 [TBL] [Abstract][Full Text] [Related]
8. Toward a theory of evolutionary computation. Eberbach E Biosystems; 2005 Oct; 82(1):1-19. PubMed ID: 16102892 [TBL] [Abstract][Full Text] [Related]
9. Optimization by hierarchical mutant production. Schober A; Thuerk M; Eigen M Biol Cybern; 1993; 69(5-6):493-501. PubMed ID: 8274548 [TBL] [Abstract][Full Text] [Related]
10. Efficient and scalable Pareto optimization by evolutionary local selection algorithms. Menczer F; Degeratu M; Street WN Evol Comput; 2000; 8(2):223-47. PubMed ID: 10843522 [TBL] [Abstract][Full Text] [Related]
11. Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Merz P; Freisleben B Evol Comput; 2000; 8(1):61-91. PubMed ID: 10753231 [TBL] [Abstract][Full Text] [Related]
12. On the Performance of Different Genetic Programming Approaches for the SORTING Problem. Wagner M; Neumann F; Urli T Evol Comput; 2015; 23(4):583-609. PubMed ID: 25870929 [TBL] [Abstract][Full Text] [Related]
13. Genetic algorithms: principles of natural selection applied to computation. Forrest S Science; 1993 Aug; 261(5123):872-8. PubMed ID: 8346439 [TBL] [Abstract][Full Text] [Related]
14. Constraint Handling Guided by Landscape Analysis in Combinatorial and Continuous Search Spaces. Malan KM; Moser I Evol Comput; 2019; 27(2):267-289. PubMed ID: 29528726 [TBL] [Abstract][Full Text] [Related]
15. GENOMEPOP: a program to simulate genomes in populations. Carvajal-RodrÃguez A BMC Bioinformatics; 2008 Apr; 9():223. PubMed ID: 18447924 [TBL] [Abstract][Full Text] [Related]
16. Varying environments can speed up evolution. Kashtan N; Noor E; Alon U Proc Natl Acad Sci U S A; 2007 Aug; 104(34):13711-6. PubMed ID: 17698964 [TBL] [Abstract][Full Text] [Related]
17. Improved evolutionary optimization from genetically adaptive multimethod search. Vrugt JA; Robinson BA Proc Natl Acad Sci U S A; 2007 Jan; 104(3):708-11. PubMed ID: 17215363 [TBL] [Abstract][Full Text] [Related]
18. Computational Complexity as an Ultimate Constraint on Evolution. Kaznatcheev A Genetics; 2019 May; 212(1):245-265. PubMed ID: 30833289 [TBL] [Abstract][Full Text] [Related]
19. Quantifying uncertainty in NMR T2 spectra using Monte Carlo inversion. Prange M; Song YQ J Magn Reson; 2009 Jan; 196(1):54-60. PubMed ID: 18952474 [TBL] [Abstract][Full Text] [Related]
20. Naturally selecting solutions: the use of genetic algorithms in bioinformatics. Manning T; Sleator RD; Walsh P Bioengineered; 2013; 4(5):266-78. PubMed ID: 23222169 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]