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 *

175 related articles for article (PubMed ID: 29528726)

  • 41. A lifelong learning hyper-heuristic method for bin packing.
    Sim K; Hart E; Paechter B
    Evol Comput; 2015; 23(1):37-67. PubMed ID: 24512321
    [TBL] [Abstract][Full Text] [Related]  

  • 42. 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]  

  • 43. 3off2: A network reconstruction algorithm based on 2-point and 3-point information statistics.
    Affeldt S; Verny L; Isambert H
    BMC Bioinformatics; 2016 Jan; 17 Suppl 2(Suppl 2):12. PubMed ID: 26823190
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Generator Maintenance Scheduling using Exchange Market Algorithm.
    Moyo L; Nwulu NI; Ekpenyong UE
    MethodsX; 2020; 7():100932. PubMed ID: 32489912
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Estimating meme fitness in adaptive memetic algorithms for combinatorial problems.
    Smith JE
    Evol Comput; 2012; 20(2):165-88. PubMed ID: 22129225
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Optimal Synthesis of Four-Bar Linkage Path Generation through Evolutionary Computation with a Novel Constraint Handling Technique.
    Sleesongsom S; Bureerat S
    Comput Intell Neurosci; 2018; 2018():5462563. PubMed ID: 30515198
    [TBL] [Abstract][Full Text] [Related]  

  • 47. A hybrid approach to protein folding problem integrating constraint programming with local search.
    Ullah AD; Steinhöfel K
    BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S39. PubMed ID: 20122212
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Reconstruction of ancestral genomic sequences using likelihood.
    Elias I; Tuller T
    J Comput Biol; 2007 Mar; 14(2):216-37. PubMed ID: 17456016
    [TBL] [Abstract][Full Text] [Related]  

  • 49. Analysis of epistatic interactions and fitness landscapes using a new geometric approach.
    Beerenwinkel N; Pachter L; Sturmfels B; Elena SF; Lenski RE
    BMC Evol Biol; 2007 Apr; 7():60. PubMed ID: 17433106
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Memetic algorithms for continuous optimisation based on local search chains.
    Molina D; Lozano M; García-Martínez C; Herrera F
    Evol Comput; 2010; 18(1):27-63. PubMed ID: 20064025
    [TBL] [Abstract][Full Text] [Related]  

  • 51. A Parameterised Complexity Analysis of Bi-level Optimisation with Evolutionary Algorithms.
    Corus D; Lehre PK; Neumann F; Pourhassan M
    Evol Comput; 2016; 24(1):183-203. PubMed ID: 25700147
    [TBL] [Abstract][Full Text] [Related]  

  • 52. libSRES: a C library for stochastic ranking evolution strategy for parameter estimation.
    Ji X; Xu Y
    Bioinformatics; 2006 Jan; 22(1):124-6. PubMed ID: 16267082
    [TBL] [Abstract][Full Text] [Related]  

  • 53. Heuristics for the Reversal and Transposition Distance Problem.
    Brito KL; Oliveira AR; Dias U; Dias Z
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(1):2-13. PubMed ID: 31603793
    [TBL] [Abstract][Full Text] [Related]  

  • 54. 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]  

  • 55. On the behaviour of the (1, λ)-ES for conically constrained linear problems.
    Arnold DV
    Evol Comput; 2014; 22(3):503-23. PubMed ID: 24605845
    [TBL] [Abstract][Full Text] [Related]  

  • 56. An improved hybrid of particle swarm optimization and the gravitational search algorithm to produce a kinetic parameter estimation of aspartate biochemical pathways.
    Ismail AM; Mohamad MS; Abdul Majid H; Abas KH; Deris S; Zaki N; Mohd Hashim SZ; Ibrahim Z; Remli MA
    Biosystems; 2017 Dec; 162():81-89. PubMed ID: 28951204
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems.
    Blot A; Kessaci MÉ; Jourdan L; Hoos HH
    Evol Comput; 2019; 27(1):147-171. PubMed ID: 30407875
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Principled Design and Runtime Analysis of Abstract Convex Evolutionary Search.
    Moraglio A; Sudholt D
    Evol Comput; 2017; 25(2):205-236. PubMed ID: 26469220
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Algebraic theory of recombination spaces.
    Stadler PF; Wagner GP
    Evol Comput; 1997; 5(3):241-75. PubMed ID: 10021760
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Adaptive ranking mutation operator based differential evolution for constrained optimization.
    Gong W; Cai Z; Liang D
    IEEE Trans Cybern; 2015 Apr; 45(4):716-27. PubMed ID: 25055390
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 9.