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.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

111 related articles for article (PubMed ID: 32735542)

  • 1. A New Crossover Mechanism for Genetic Algorithms for Steiner Tree Optimization.
    Zhang Q; Yang S; Liu M; Liu J; Jiang L
    IEEE Trans Cybern; 2022 May; 52(5):3147-3158. PubMed ID: 32735542
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Network random keys - a tree representation scheme for genetic and evolutionary algorithms.
    Rothlauf F; Goldberg DE; Heinzl A
    Evol Comput; 2002; 10(1):75-97. PubMed ID: 11911783
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem.
    Contreras-Bolton C; Parada V
    PLoS One; 2015; 10(9):e0137724. PubMed ID: 26367182
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Dynastic Potential Crossover Operator.
    Chicano F; Ochoa G; Whitley LD; Tinós R
    Evol Comput; 2022 Sep; 30(3):409-446. PubMed ID: 34902015
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Variable-Length Chromosome Genetic Algorithm for Time-Based Sensor Network Schedule Optimization.
    Ha VP; Dao TK; Pham NY; Le MH
    Sensors (Basel); 2021 Jun; 21(12):. PubMed ID: 34207789
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator.
    Hussain A; Muhammad YS; Nauman Sajid M; Hussain I; Mohamd Shoukry A; Gani S
    Comput Intell Neurosci; 2017; 2017():7430125. PubMed ID: 29209364
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Adversarial search by evolutionary computation.
    Hong TP; Huang KY; Lin WY
    Evol Comput; 2001; 9(3):371-85. PubMed ID: 11522212
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Crossover versus mutation: a comparative analysis of the evolutionary strategy of genetic algorithms applied to combinatorial optimization problems.
    Osaba E; Carballedo R; Diaz F; Onieva E; de la Iglesia I; Perallos A
    ScientificWorldJournal; 2014; 2014():154676. PubMed ID: 25165731
    [TBL] [Abstract][Full Text] [Related]  

  • 10. An alternative approach for neural network evolution with a genetic algorithm: crossover by combinatorial optimization.
    García-Pedrajas N; Ortiz-Boyer D; Hervás-Martínez C
    Neural Netw; 2006 May; 19(4):514-28. PubMed ID: 16343847
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Bio-Inspired Genetic Algorithms with Formalized Crossover Operators for Robotic Applications.
    Zhang J; Kang M; Li X; Liu GY
    Front Neurorobot; 2017; 11():56. PubMed ID: 29114217
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Automated global structure extraction for effective local building block processing in XCS.
    Butz MV; Pelikan M; Llorà X; Goldberg DE
    Evol Comput; 2006; 14(3):345-80. PubMed ID: 16903797
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.
    Lai X; Zhou Y; Xia X; Zhang Q
    Evol Comput; 2017; 25(4):707-723. PubMed ID: 27959580
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Statistical mechanics of steiner trees.
    Bayati M; Borgs C; Braunstein A; Chayes J; Ramezanpour A; Zecchina R
    Phys Rev Lett; 2008 Jul; 101(3):037208. PubMed ID: 18764290
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A computationally efficient evolutionary algorithm for real-parameter optimization.
    Deb K; Anand A; Joshi D
    Evol Comput; 2002; 10(4):371-95. PubMed ID: 12450456
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A Novel Selection Approach for Genetic Algorithms for Global Optimization of Multimodal Continuous Functions.
    Haq EU; Ahmad I; Hussain A; Almanjahie IM
    Comput Intell Neurosci; 2019; 2019():8640218. PubMed ID: 31885532
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A Novel Memetic Algorithm Based on Multiparent Evolution and Adaptive Local Search for Large-Scale Global Optimization.
    Zhang W; Lan Y
    Comput Intell Neurosci; 2022; 2022():3558385. PubMed ID: 35371240
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Real-coded memetic algorithms with crossover hill-climbing.
    Lozano M; Herrera F; Krasnogor N; Molina D
    Evol Comput; 2004; 12(3):273-302. PubMed ID: 15355602
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Steiner tree methods for optimal sub-network identification: an empirical study.
    Sadeghi A; Fröhlich H
    BMC Bioinformatics; 2013 Apr; 14():144. PubMed ID: 23627667
    [TBL] [Abstract][Full Text] [Related]  

  • 20. On the effectiveness of crossover in simulated evolutionary optimization.
    Fogel DB; Stayton LC
    Biosystems; 1994; 32(3):171-82. PubMed ID: 7919114
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.