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 *

146 related articles for article (PubMed ID: 28486475)

  • 1. A simulated annealing heuristic for maximum correlation core/periphery partitioning of binary networks.
    Brusco M; Stolze HJ; Hoffman M; Steinley D
    PLoS One; 2017; 12(5):e0170448. PubMed ID: 28486475
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Comparison of metaheuristics to measure gene effects on phylogenetic supports and topologies.
    Garnier R; Guyeux C; Couchot JF; Salomon M; Al-Nuaimi B; AlKindy B
    BMC Bioinformatics; 2018 Jul; 19(Suppl 7):218. PubMed ID: 30066663
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Hardware prototypes of a Boolean neural network and the simulated annealing optimization method.
    Niittylahti J
    Int J Neural Syst; 1996 Mar; 7(1):45-52. PubMed ID: 8828049
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Identification of clandestine groundwater pollution sources using heuristics optimization algorithms: a comparison between simulated annealing and particle swarm optimization.
    Chakraborty A; Prakash O
    Environ Monit Assess; 2020 Nov; 192(12):791. PubMed ID: 33242155
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Metaheuristic Algorithms for Convolution Neural Network.
    Rere LM; Fanany MI; Arymurthy AM
    Comput Intell Neurosci; 2016; 2016():1537325. PubMed ID: 27375738
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Simulated parallel annealing within a neighborhood for optimization of biomechanical systems.
    Higginson JS; Neptune RR; Anderson FC
    J Biomech; 2005 Sep; 38(9):1938-42. PubMed ID: 16023483
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Detection of the dominant direction of information flow and feedback links in densely interconnected regulatory networks.
    Ispolatov I; Maslov S
    BMC Bioinformatics; 2008 Oct; 9():424. PubMed ID: 18842147
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Dynamic Inertia Weight Binary Bat Algorithm with Neighborhood Search.
    Huang X; Zeng X; Han R
    Comput Intell Neurosci; 2017; 2017():3235720. PubMed ID: 28634487
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Optimization of a stochastically simulated gene network model via simulated annealing.
    Tomshine J; Kaznessis YN
    Biophys J; 2006 Nov; 91(9):3196-205. PubMed ID: 16920827
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Gaussian model-based partitioning using iterated local search.
    Brusco MJ; Shireman E; Steinley D; Brudvig S; Cradit JD
    Br J Math Stat Psychol; 2017 Feb; 70(1):1-24. PubMed ID: 28130935
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A deterministic annealing algorithm for approximating a solution of the min-bisection problem.
    Dang C; Ma W; Liang J
    Neural Netw; 2009 Jan; 22(1):58-66. PubMed ID: 18995985
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Constructing circular phylogenetic networks from weighted quartets using simulated annealing.
    Eslahchi C; Hassanzadeh R; Mottaghi E; Habibi M; Pezeshk H; Sadeghi M
    Math Biosci; 2012 Feb; 235(2):123-7. PubMed ID: 22108294
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Information theory inspired optimization algorithm for efficient service orchestration in distributed systems.
    Lima MS
    PLoS One; 2021; 16(1):e0242285. PubMed ID: 33395689
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Solving the multiple competitive facilities location and design problem on the plane.
    Redondo JL; Fernández J; García I; Ortigosa PM
    Evol Comput; 2009; 17(1):21-53. PubMed ID: 19207087
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Identification of core-periphery structure in networks.
    Zhang X; Martin T; Newman ME
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Mar; 91(3):032803. PubMed ID: 25871153
    [TBL] [Abstract][Full Text] [Related]  

  • 18. List-Based Simulated Annealing Algorithm for Traveling Salesman Problem.
    Zhan SH; Lin J; Zhang ZJ; Zhong YW
    Comput Intell Neurosci; 2016; 2016():1712630. PubMed ID: 27034650
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Neural Network Structure Optimization by Simulated Annealing.
    Kuo CL; Kuruoglu EE; Chan WKV
    Entropy (Basel); 2022 Feb; 24(3):. PubMed ID: 35327859
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 8.