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 *

126 related articles for article (PubMed ID: 25865959)

  • 1. Efficient heuristics for maximum common substructure search.
    Englert P; Kovács P
    J Chem Inf Model; 2015 May; 55(5):941-55. PubMed ID: 25865959
    [TBL] [Abstract][Full Text] [Related]  

  • 2. MultiMCS: a fast algorithm for the maximum common substructure problem on multiple molecules.
    Hariharan R; Janakiraman A; Nilakantan R; Singh B; Varghese S; Landrum G; Schuffenhauer A
    J Chem Inf Model; 2011 Apr; 51(4):788-806. PubMed ID: 21446748
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Computing atom mappings for biochemical reactions without subgraph isomorphism.
    Heinonen M; Lappalainen S; Mielikäinen T; Rousu J
    J Comput Biol; 2011 Jan; 18(1):43-58. PubMed ID: 21210731
    [TBL] [Abstract][Full Text] [Related]  

  • 4. The optimization of running time for a maximum common substructure-based algorithm and its application in drug design.
    Chen J; Sheng J; Lv D; Zhong Y; Zhang G; Nan P
    Comput Biol Chem; 2014 Feb; 48():14-20. PubMed ID: 24291488
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Simple Hyper-Heuristics Control the Neighbourhood Size of Randomised Local Search Optimally for LeadingOnes
    Lissovoi A; Oliveto PS; Warwicker JA
    Evol Comput; 2020; 28(3):437-461. PubMed ID: 31120773
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. High-quality, customizable heuristics for RNA 3D structure alignment.
    Zurkowski M; Antczak M; Szachniuk M
    Bioinformatics; 2023 May; 39(5):. PubMed ID: 37166444
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A hyper-heuristic for the Longest Common Subsequence problem.
    Tabataba FS; Mousavi SR
    Comput Biol Chem; 2012 Feb; 36():42-54. PubMed ID: 22286085
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Efficient substructure searching of large chemical libraries: the ABCD chemical cartridge.
    Agrafiotis DK; Lobanov VS; Shemanarev M; Rassokhin DN; Izrailev S; Jaeger EP; Alex S; Farnum M
    J Chem Inf Model; 2011 Dec; 51(12):3113-30. PubMed ID: 22035187
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Build-up algorithm for atomic correspondence between chemical structures.
    Kawabata T
    J Chem Inf Model; 2011 Aug; 51(8):1775-87. PubMed ID: 21736325
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Maximum-score diversity selection for early drug discovery.
    Meinl T; Ostermann C; Berthold MR
    J Chem Inf Model; 2011 Feb; 51(2):237-47. PubMed ID: 21309543
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Finding maximum colorful subtrees in practice.
    Rauf I; Rasche F; Nicolas F; Böcker S
    J Comput Biol; 2013 Apr; 20(4):311-21. PubMed ID: 23509858
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.
    Hart E; Sim K
    Evol Comput; 2016; 24(4):609-635. PubMed ID: 27120113
    [TBL] [Abstract][Full Text] [Related]  

  • 15. LEAP into the Pfizer Global Virtual Library (PGVL) space: creation of readily synthesizable design ideas automatically.
    Hu Q; Peng Z; Kostrowicki J; Kuki A
    Methods Mol Biol; 2011; 685():253-76. PubMed ID: 20981528
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Comparison of Maximum Common Subgraph Isomorphism Algorithms for the Alignment of 2D Chemical Structures.
    Duesbury E; Holliday J; Willett P
    ChemMedChem; 2018 Mar; 13(6):588-598. PubMed ID: 29057611
    [TBL] [Abstract][Full Text] [Related]  

  • 17. The compressed feature matrix--a fast method for feature based substructure search.
    Abolmaali SF; Wegner JK; Zell A
    J Mol Model; 2003 Aug; 9(4):235-41. PubMed ID: 12720113
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems.
    Kheiri A; Keedwell E
    Evol Comput; 2017; 25(3):473-501. PubMed ID: 27258841
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Efficient Heuristic Algorithms for Single-Vehicle Task Planning With Precedence Constraints.
    Bai X; Cao M; Yan W; Ge SS; Zhang X
    IEEE Trans Cybern; 2021 Dec; 51(12):6274-6283. PubMed ID: 32149678
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 7.