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 *

345 related articles for article (PubMed ID: 27303786)

  • 1. Greedy Hypervolume Subset Selection in Low Dimensions.
    Guerreiro AP; Fonseca CM; Paquete L
    Evol Comput; 2016; 24(3):521-44. PubMed ID: 27303786
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms.
    Kuhn T; Fonseca CM; Paquete L; Ruzika S; Duarte MM; Figueira JR
    Evol Comput; 2016; 24(3):411-25. PubMed ID: 26135717
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Hypervolume Subset Selection with Small Subsets.
    Groz B; Maniu S
    Evol Comput; 2019; 27(4):611-637. PubMed ID: 30365385
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Multiplicative approximations, optimal hypervolume distributions, and the choice of the reference point.
    Friedrich T; Neumann F; Thyssen C
    Evol Comput; 2015; 23(1):131-59. PubMed ID: 24654679
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm.
    Jiang S; Zhang J; Ong YS; Zhang AN; Tan PS
    IEEE Trans Cybern; 2015 Oct; 45(10):2202-13. PubMed ID: 25474815
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
    Friedrich T; Neumann F
    Evol Comput; 2015; 23(4):543-58. PubMed ID: 26135719
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Uncrowded Hypervolume-Based Multiobjective Optimization with Gene-Pool Optimal Mixing.
    Maree SC; Alderliesten T; Bosman PAN
    Evol Comput; 2022 Sep; 30(3):329-353. PubMed ID: 34878530
    [TBL] [Abstract][Full Text] [Related]  

  • 9. How to Specify a Reference Point in Hypervolume Calculation for Fair Performance Comparison.
    Ishibuchi H; Imada R; Setoguchi Y; Nojima Y
    Evol Comput; 2018; 26(3):411-440. PubMed ID: 29786458
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Multiobjective Evolutionary Algorithms Are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions.
    Qian C
    Evol Comput; 2021 Dec; 29(4):463-490. PubMed ID: 33350888
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A new 1.375-approximation algorithm for sorting by transpositions.
    Silva LAG; Kowada LAB; Rocco NR; Walter MEMT
    Algorithms Mol Biol; 2022 Jan; 17(1):1. PubMed ID: 35033127
    [TBL] [Abstract][Full Text] [Related]  

  • 12. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.
    Al-Okaily A; Huang CH
    J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A new evolutionary algorithm for solving many-objective optimization problems.
    Zou X; Chen Y; Liu M; Kang L
    IEEE Trans Syst Man Cybern B Cybern; 2008 Oct; 38(5):1402-12. PubMed ID: 18784020
    [TBL] [Abstract][Full Text] [Related]  

  • 14. HypE: an algorithm for fast hypervolume-based many-objective optimization.
    Bader J; Zitzler E
    Evol Comput; 2011; 19(1):45-76. PubMed ID: 20649424
    [TBL] [Abstract][Full Text] [Related]  

  • 15. R2 Indicator-Based Multiobjective Search.
    Brockhoff D; Wagner T; Trautmann H
    Evol Comput; 2015; 23(3):369-95. PubMed ID: 24983593
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Per-Round Knapsack-Constrained Linear Submodular Bandits.
    Yu B; Fang M; Tao D
    Neural Comput; 2016 Dec; 28(12):2757-2789. PubMed ID: 27626968
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Estimating effective population size from temporally spaced samples with a novel, efficient maximum-likelihood algorithm.
    Hui TY; Burt A
    Genetics; 2015 May; 200(1):285-93. PubMed ID: 25747459
    [TBL] [Abstract][Full Text] [Related]  

  • 18. On the Construction of Pareto-Compliant Combined Indicators.
    Falcón-Cardona JG; Emmerich MTM; Coello CAC
    Evol Comput; 2022 Sep; 30(3):381-408. PubMed ID: 35180301
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Encoded expansion: an efficient algorithm to discover identical string motifs.
    Azmi AM; Al-Ssulami A
    PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups.
    Bandeira AS; Kennedy C; Singer A
    Math Program; 2016 Nov; 160(1):433-475. PubMed ID: 27867224
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 18.