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 *

98 related articles for article (PubMed ID: 26928851)

  • 41. A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.
    Drake JH; Özcan E; Burke EK
    Evol Comput; 2016; 24(1):113-41. PubMed ID: 25635698
    [TBL] [Abstract][Full Text] [Related]  

  • 42. The k partition-distance problem.
    Chen YH
    J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708
    [TBL] [Abstract][Full Text] [Related]  

  • 43. A physiology-based inverse dynamic analysis of human gait using sequential convex programming: a comparative study.
    De Groote F; Demeulenaere B; Swevers J; De Schutter J; Jonkers I
    Comput Methods Biomech Biomed Engin; 2012; 15(10):1093-102. PubMed ID: 21878002
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Human body pose estimation with particle swarm optimisation.
    Ivekovic S; Trucco E; Petillot YR
    Evol Comput; 2008; 16(4):509-28. PubMed ID: 19053497
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Rugged fitness landscapes of Kauffman models with a scale-free network.
    Iguchi K; Kinoshita S; Yamada H
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Dec; 72(6 Pt 1):061901. PubMed ID: 16485968
    [TBL] [Abstract][Full Text] [Related]  

  • 46. A study of redundancy and neutrality in evolutionary optimization.
    Correia MB
    Evol Comput; 2013; 21(3):413-43. PubMed ID: 22998618
    [TBL] [Abstract][Full Text] [Related]  

  • 47. ACOustic: A Nature-Inspired Exploration Indicator for Ant Colony Optimization.
    Sagban R; Ku-Mahamud KR; Abu Bakar MS
    ScientificWorldJournal; 2015; 2015():392345. PubMed ID: 25954768
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Comparison of heuristics and metaheuristics for topology optimisation in acoustic porous materials.
    Ramamoorthy VT; Özcan E; Parkes AJ; Sreekumar A; Jaouen L; Bécot FX
    J Acoust Soc Am; 2021 Oct; 150(4):3164. PubMed ID: 34717464
    [TBL] [Abstract][Full Text] [Related]  

  • 49. Online Discovery of Search Objectives for Test-Based Problems.
    Liskowski P; Krawiec K
    Evol Comput; 2017; 25(3):375-406. PubMed ID: 26953882
    [TBL] [Abstract][Full Text] [Related]  

  • 50. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.
    Lim WL; Wibowo A; Desa MI; Haron H
    Comput Intell Neurosci; 2016; 2016():5803893. PubMed ID: 26819585
    [TBL] [Abstract][Full Text] [Related]  

  • 51. On the taxonomy of optimization problems under estimation of distribution algorithms.
    Echegoyen C; Mendiburu A; Santana R; Lozano JA
    Evol Comput; 2013; 21(3):471-95. PubMed ID: 23136917
    [TBL] [Abstract][Full Text] [Related]  

  • 52. Improved packing of protein side chains with parallel ant colonies.
    Quan L; Lü Q; Li H; Xia X; Wu H
    BMC Bioinformatics; 2014; 15 Suppl 12(Suppl 12):S5. PubMed ID: 25474164
    [TBL] [Abstract][Full Text] [Related]  

  • 53. Hyperspace geography: visualizing fitness landscapes beyond 4D.
    Wiles J; Tonkes B
    Artif Life; 2006; 12(2):211-6. PubMed ID: 16539765
    [TBL] [Abstract][Full Text] [Related]  

  • 54. A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems.
    Sabar NR; Ayob M; Kendall G; Qu R
    IEEE Trans Cybern; 2015 Feb; 45(2):217-28. PubMed ID: 24951713
    [TBL] [Abstract][Full Text] [Related]  

  • 55. Some mathematical refinements concerning error minimization in the genetic code.
    Buhrman H; van der Gulik PT; Kelk SM; Koolen WM; Stougie L
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1358-72. PubMed ID: 21358008
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Ligand-based virtual screening and in silico design of new antimalarial compounds using nonstochastic and stochastic total and atom-type quadratic maps.
    Marrero-Ponce Y; Iyarreta-Veitía M; Montero-Torres A; Romero-Zaldivar C; Brandt CA; Avila PE; Kirchgatter K; Machado Y
    J Chem Inf Model; 2005; 45(4):1082-100. PubMed ID: 16045304
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Motif difficulty (MD): a predictive measure of problem difficulty for evolutionary algorithms using network motifs.
    Liu J; Abbass HA; Green DG; Zhong W
    Evol Comput; 2012; 20(3):321-47. PubMed ID: 21815769
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Using landscape topology to compare continuous metaheuristics: a framework and case study on EDAs and ridge structure.
    Morgan R; Gallagher M
    Evol Comput; 2012; 20(2):277-99. PubMed ID: 22339400
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Efficient sequential and parallel algorithms for finding edit distance based motifs.
    Pal S; Xiao P; Rajasekaran S
    BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):465. PubMed ID: 27557423
    [TBL] [Abstract][Full Text] [Related]  

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

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