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 *

137 related articles for article (PubMed ID: 19008180)

  • 21. Molecular solutions to the binary integer programming problem based on DNA computation.
    Yeh CW; Chu CP; Wu KR
    Biosystems; 2006 Jan; 83(1):56-66. PubMed ID: 16229936
    [TBL] [Abstract][Full Text] [Related]  

  • 22. An Integer Linear Programming Model to Optimize Coding DNA Sequences By Joint Control of Transcript Indicators.
    Arbib C; D'ascenzo A; Rossi F; Santoni D
    J Comput Biol; 2024 May; 31(5):416-428. PubMed ID: 38687334
    [No Abstract]   [Full Text] [Related]  

  • 23. On the solution of mixed-integer nonlinear programming models for computer aided molecular design.
    Ostrovsky GM; Achenie LE; Sinha M
    Comput Chem; 2002 Nov; 26(6):645-60. PubMed ID: 12385479
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Decomposition techniques with mixed integer programming and heuristics for home healthcare planning.
    Laesanklang W; Landa-Silva D
    Ann Oper Res; 2017; 256(1):93-127. PubMed ID: 31258236
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Computing the minimum recombinant haplotype configuration from incomplete genotype data on a pedigree by integer linear programming.
    Li J; Jiang T
    J Comput Biol; 2005; 12(6):719-39. PubMed ID: 16108713
    [TBL] [Abstract][Full Text] [Related]  

  • 26. A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems.
    Abouelseoud G; Abouelseoud Y; Shoukry A; Ismail N; Mekky J
    IEEE Trans Neural Syst Rehabil Eng; 2018 Feb; 26(2):527-537. PubMed ID: 29432118
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Polynomial-time algorithms for the integer minimal principle for centrosymmetric structures.
    Vaia A; Sahinidis NV
    Acta Crystallogr A; 2005 Jul; 61(Pt 4):445-52. PubMed ID: 15972998
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Model abstraction for discrete-event systems by binary linear programming with applications to manufacturing systems.
    Cheng L; Feng L; Li Z
    Sci Prog; 2021; 104(3):368504211030833. PubMed ID: 34292845
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Solving an airport ground service task assignment problem with an exact algorithm.
    Tian Q; Li J; Huang G; Yuan W
    PLoS One; 2022; 17(12):e0279131. PubMed ID: 36548303
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Comparing genomes with rearrangements and segmental duplications.
    Shao M; Moret BM
    Bioinformatics; 2015 Jun; 31(12):i329-38. PubMed ID: 26072500
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A branch-and-cut approach to physical mapping of chromosomes by unique end-probes.
    Christof T; Jünger M; Kececioglu J; Mutzel P; Reinelt G
    J Comput Biol; 1997; 4(4):433-47. PubMed ID: 9385538
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Modeling and solving the dynamic patient admission scheduling problem under uncertainty.
    Ceschia S; Schaerf A
    Artif Intell Med; 2012 Nov; 56(3):199-205. PubMed ID: 23122690
    [TBL] [Abstract][Full Text] [Related]  

  • 33. An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.
    Zhao Y; Liu S
    Springerplus; 2016; 5(1):1302. PubMed ID: 27547676
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems.
    Leitner M
    Comput Optim Appl; 2016; 65():73-92. PubMed ID: 27512292
    [TBL] [Abstract][Full Text] [Related]  

  • 35. The double digest problem: finding all solutions.
    Sur-Kolay S; Banerjee S; Mukhopadhyaya S; Murthy CA
    Int J Bioinform Res Appl; 2009; 5(5):570-92. PubMed ID: 19778871
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Solving 0-1 Integer Programming Problem Based on DNA Strand Displacement Reaction Network.
    Tang Z; Yin Z; Wang L; Cui J; Yang J; Wang R
    ACS Synth Biol; 2021 Sep; 10(9):2318-2330. PubMed ID: 34431290
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Solution to dynamic economic dispatch with prohibited operating zones via MILP.
    Pan S; Jian J; Yang L
    Math Biosci Eng; 2022 Apr; 19(7):6455-6468. PubMed ID: 35730266
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A fast exact sequential algorithm for the partial digest problem.
    Abbas MM; Bahig HM
    BMC Bioinformatics; 2016 Dec; 17(Suppl 19):510. PubMed ID: 28155644
    [TBL] [Abstract][Full Text] [Related]  

  • 39. A singular value decomposition linear programming (SVDLP) optimization technique for circular cone based robotic radiotherapy.
    Liang B; Li Y; Wei R; Guo B; Xu X; Liu B; Li J; Wu Q; Zhou F
    Phys Med Biol; 2018 Jan; 63(1):015034. PubMed ID: 29148432
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Application of Constrained Optimization Methods in Health Services Research: Report 2 of the ISPOR Optimization Methods Emerging Good Practices Task Force.
    Crown W; Buyukkaramikli N; Sir MY; Thokala P; Morton A; Marshall DA; Tosh JC; Ijzerman MJ; Padula WV; Pasupathy KS
    Value Health; 2018 Sep; 21(9):1019-1028. PubMed ID: 30224103
    [TBL] [Abstract][Full Text] [Related]  

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