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 *

106 related articles for article (PubMed ID: 33723497)

  • 1. Multi-objective database queries in combined knapsack and set covering problem domains.
    Mochocki SA; Lamont GB; Leishman RC; Kauffman KJ
    J Big Data; 2021; 8(1):46. PubMed ID: 33723497
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem.
    Wang Z; Zhang H; Li Y
    Comput Intell Neurosci; 2022; 2022():1266529. PubMed ID: 36317076
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Explaining Wrong Queries Using Small Examples.
    Miao Z; Roy S; Yang J
    Proc ACM SIGMOD Int Conf Manag Data; 2019; 2019():503-520. PubMed ID: 31439982
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A high-performance spatial database based approach for pathology imaging algorithm evaluation.
    Wang F; Kong J; Gao J; Cooper LA; Kurc T; Zhou Z; Adler D; Vergara-Niedermayr C; Katigbak B; Brat DJ; Saltz JH
    J Pathol Inform; 2013; 4():5. PubMed ID: 23599905
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Binary salp swarm algorithm for discounted {0-1} knapsack problem.
    Dang BT; Truong TK
    PLoS One; 2022; 17(4):e0266537. PubMed ID: 35390109
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Exploring performance issues for a clinical database organized using an entity-attribute-value representation.
    Chen RS; Nadkarni P; Marenco L; Levin F; Erdos J; Miller PL
    J Am Med Inform Assoc; 2000; 7(5):475-87. PubMed ID: 10984467
    [TBL] [Abstract][Full Text] [Related]  

  • 7. CohortExplorer: A Generic Application Programming Interface for Entity Attribute Value Database Schemas.
    Dixit A; Dobson RJ
    JMIR Med Inform; 2014 Dec; 2(2):e32. PubMed ID: 25601296
    [TBL] [Abstract][Full Text] [Related]  

  • 8. On complexity of optimal recombination for binary representations of solutions.
    Eremeev AV
    Evol Comput; 2008; 16(1):127-47. PubMed ID: 18386998
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A searching and reporting system for relational databases using a graph-based metadata representation.
    Hewitt R; Gobbi A; Lee ML
    J Chem Inf Model; 2005; 45(4):863-9. PubMed ID: 16045279
    [TBL] [Abstract][Full Text] [Related]  

  • 10. An efficient optimizer for the 0/1 knapsack problem using group counseling.
    Ghadi YY; AlShloul T; Nezami ZI; Ali H; Asif M; Aljuaid H; Ahmad S
    PeerJ Comput Sci; 2023; 9():e1315. PubMed ID: 37346609
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A relational database in neurosurgery.
    Sicurello F; Marchetti MR; Cazzaniga P
    Medinfo; 1995; 8 Pt 1():485. PubMed ID: 8591240
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Integration of relational and textual biomedical sources. A pilot experiment using a semi-automated method for logical schema acquisition.
    García-Remesal M; Maojo V; Billhardt H; Crespo J
    Methods Inf Med; 2010; 49(4):337-48. PubMed ID: 19936436
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Informatics in radiology: use of CouchDB for document-based storage of DICOM objects.
    Rascovsky SJ; Delgado JA; Sanz A; Calvo VD; Castrillón G
    Radiographics; 2012; 32(3):913-27. PubMed ID: 22403116
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Translating synthetic natural language to database queries with a polyglot deep learning framework.
    Bazaga A; Gunwant N; Micklem G
    Sci Rep; 2021 Sep; 11(1):18462. PubMed ID: 34531510
    [TBL] [Abstract][Full Text] [Related]  

  • 15. KNApSAcK-3D: a three-dimensional structure database of plant metabolites.
    Nakamura K; Shimura N; Otabe Y; Hirai-Morita A; Nakamura Y; Ono N; Ul-Amin MA; Kanaya S
    Plant Cell Physiol; 2013 Feb; 54(2):e4. PubMed ID: 23292603
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Representing genetic sequence data for pharmacogenomics: an evolutionary approach using ontological and relational models.
    Rubin DL; Shafa F; Oliver DE; Hewett M; Altman RB
    Bioinformatics; 2002; 18 Suppl 1():S207-15. PubMed ID: 12169549
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Chemical reaction optimization for solving shortest common supersequence problem.
    Khaled Saifullah CM; Rafiqul Islam M
    Comput Biol Chem; 2016 Oct; 64():82-93. PubMed ID: 27299980
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Improved Online Algorithms for Knapsack and GAP in the Random Order Model.
    Albers S; Khan A; Ladewig L
    Algorithmica; 2021; 83(6):1750-1785. PubMed ID: 34720295
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Visually defining and querying consistent multi-granular clinical temporal abstractions.
    Combi C; Oliboni B
    Artif Intell Med; 2012 Feb; 54(2):75-101. PubMed ID: 22177662
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 6.