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 *

191 related articles for article (PubMed ID: 30365387)

  • 41. Solving the 0/1 knapsack problem by a biomolecular DNA computer.
    Taghipour H; Rezaei M; Esmaili HA
    Adv Bioinformatics; 2013; 2013():341419. PubMed ID: 23509451
    [TBL] [Abstract][Full Text] [Related]  

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

  • 43. Hybrid Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems.
    Coelho VN; Coelho IM; Souza MJ; Oliveira TA; Cota LP; Haddad MN; Mladenovic N; Silva RC; Guimarães FG
    Evol Comput; 2016; 24(4):637-666. PubMed ID: 27258842
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications.
    Li X; Liu S; Wang J; Chen X; Ong YS; Tang K
    IEEE Trans Cybern; 2024 Jun; PP():. PubMed ID: 38837918
    [TBL] [Abstract][Full Text] [Related]  

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

  • 46. How Humans Solve Complex Problems: The Case of the Knapsack Problem.
    Murawski C; Bossaerts P
    Sci Rep; 2016 Oct; 6():34851. PubMed ID: 27713516
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem.
    Viana GV; Gomes FA; Ferreira CE; Meneses CN
    Int J Bioinform Res Appl; 2009; 5(2):163-77. PubMed ID: 19324602
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Analysis of Randomised Search Heuristics for Dynamic Optimisation.
    Jansen T; Zarges C
    Evol Comput; 2015; 23(4):513-41. PubMed ID: 26241197
    [TBL] [Abstract][Full Text] [Related]  

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

  • 50. A Modified Genetic Algorithm with Local Search Strategies and Multi-Crossover Operator for Job Shop Scheduling Problem.
    Viana MS; Morandin Junior O; Contreras RC
    Sensors (Basel); 2020 Sep; 20(18):. PubMed ID: 32971959
    [TBL] [Abstract][Full Text] [Related]  

  • 51. Simplified partial digest problem: enumerative and dynamic programming algorithms.
    Blazewicz J; Burke E; Kasprzak M; Kovalev A; Kovalyov M
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):668-80. PubMed ID: 17975277
    [TBL] [Abstract][Full Text] [Related]  

  • 52. GASAT: a genetic local search algorithm for the satisfiability problem.
    Lardeux F; Saubion F; Hao JK
    Evol Comput; 2006; 14(2):223-53. PubMed ID: 16831107
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 55. A novel approach for solving travelling thief problem using enhanced simulated annealing.
    Ali H; Zaid Rafique M; Shahzad Sarfraz M; Malik MSA; Alqahtani MA; Alqurni JS
    PeerJ Comput Sci; 2021; 7():e377. PubMed ID: 33834093
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Automating the packing heuristic design process with genetic programming.
    Burke EK; Hyde MR; Kendall G; Woodward J
    Evol Comput; 2012; 20(1):63-89. PubMed ID: 21609273
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.
    Moreno-Scott JH; Ortiz-Bayliss JC; Terashima-Marín H; Conant-Pablos SE
    Comput Intell Neurosci; 2016; 2016():7349070. PubMed ID: 26949383
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Scientific discovery as a combinatorial optimisation problem: how best to navigate the landscape of possible experiments?
    Kell DB
    Bioessays; 2012 Mar; 34(3):236-44. PubMed ID: 22252984
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Algorithms for Pedigree Comparison.
    Chen ZZ; Feng Q; Shen C; Wang J; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):422-431. PubMed ID: 27076461
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Quantifying hybridization in realistic time.
    Collins J; Linz S; Semple C
    J Comput Biol; 2011 Oct; 18(10):1305-18. PubMed ID: 21210735
    [TBL] [Abstract][Full Text] [Related]  

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