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 *

108 related articles for article (PubMed ID: 11928691)

  • 21. Estimation of optimal feeding strategies for fed-batch bioprocesses.
    Franco-Lara E; Weuster-Botz D
    Bioprocess Biosyst Eng; 2005 Jul; 27(4):255-62. PubMed ID: 15928931
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Bloat control operators and diversity in genetic programming: a comparative study.
    Alfaro-Cid E; Merelo JJ; Fernández de Vega F; Esparcia-Alcázar AI; Sharman K
    Evol Comput; 2010; 18(2):305-32. PubMed ID: 20210598
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Data reconciliation and parameter estimation in flux-balance analysis.
    Raghunathan AU; Pérez-Correa JR; Bieger LT
    Biotechnol Bioeng; 2003 Dec; 84(6):700-9. PubMed ID: 14595782
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Converting general nonlinear programming problems into separable programming problems with feedforward neural networks.
    Lu BL; Ito K
    Neural Netw; 2003 Sep; 16(7):1059-74. PubMed ID: 14692639
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Linear programming to optimize performance in a department of surgery.
    Mulholland MW; Abrahamse P; Bahl V
    J Am Coll Surg; 2005 Jun; 200(6):861-8. PubMed ID: 15922196
    [TBL] [Abstract][Full Text] [Related]  

  • 26. The generalized quadratic knapsack problem. A neuronal network approach.
    Talaván PM; Yáñez J
    Neural Netw; 2006 May; 19(4):416-28. PubMed ID: 16488117
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Genetic algorithms with decomposition procedures for multidimensional 0-1 knapsack problems with block angular structures.
    Kato K; Sakawa M
    IEEE Trans Syst Man Cybern B Cybern; 2003; 33(3):410-9. PubMed ID: 18238188
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Memetic algorithms for the unconstrained binary quadratic programming problem.
    Merz P; Katayama K
    Biosystems; 2004 Dec; 78(1-3):99-118. PubMed ID: 15555762
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Symbolic modeling of epistasis.
    Moore JH; Barney N; Tsai CT; Chiang FT; Gui J; White BC
    Hum Hered; 2007; 63(2):120-33. PubMed ID: 17283441
    [TBL] [Abstract][Full Text] [Related]  

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

  • 31. Modelling biological evolvability: implicit context and variation filtering in enzyme genetic programming.
    Lones MA; Tyrrell AM
    Biosystems; 2004; 76(1-3):229-38. PubMed ID: 15351146
    [TBL] [Abstract][Full Text] [Related]  

  • 32. A linear programming approach for identifying a consensus sequence on DNA sequences.
    Li HL; Fu CJ
    Bioinformatics; 2005 May; 21(9):1838-45. PubMed ID: 15671117
    [TBL] [Abstract][Full Text] [Related]  

  • 33. A graph-based evolutionary algorithm: Genetic Network Programming (GNP) and its extension using reinforcement learning.
    Mabu S; Hirasawa K; Hu J
    Evol Comput; 2007; 15(3):369-98. PubMed ID: 17705783
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Optimizing phylogenetic diversity under constraints.
    Moulton V; Semple C; Steel M
    J Theor Biol; 2007 May; 246(1):186-94. PubMed ID: 17275037
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Perspectives on artificial intelligence programming.
    Bobrow DG; Stefik MJ
    Science; 1986 Feb; 231(4741):951-7. PubMed ID: 17740291
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Time series modeling by a regression approach based on a latent process.
    Chamroukhi F; Samé A; Govaert G; Aknin P
    Neural Netw; 2009; 22(5-6):593-602. PubMed ID: 19616918
    [TBL] [Abstract][Full Text] [Related]  

  • 37. A novel infinite-time optimal tracking control scheme for a class of discrete-time nonlinear systems via the greedy HDP iteration algorithm.
    Zhang H; Wei Q; Luo Y
    IEEE Trans Syst Man Cybern B Cybern; 2008 Aug; 38(4):937-42. PubMed ID: 18632381
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Cleaner production for continuous digester processes based on hybrid Pareto genetic algorithm.
    Jin FJ; Wang H; Li P
    J Environ Sci (China); 2003 Jan; 15(1):129-35. PubMed ID: 12602617
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Neutral networks of sequence to shape maps.
    Jin EY; Qin J; Reidys CM
    J Theor Biol; 2008 Feb; 250(3):484-97. PubMed ID: 18045617
    [TBL] [Abstract][Full Text] [Related]  

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

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