BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

137 related articles for article (PubMed ID: 26134848)

  • 1. An Integer Programming Formulation of the Minimum Common String Partition Problem.
    Ferdous SM; Rahman MS
    PLoS One; 2015; 10(7):e0130266. PubMed ID: 26134848
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.
    Zörnig P
    J Comput Biol; 2015 Aug; 22(8):729-42. PubMed ID: 25525691
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.
    Lyubetsky V; Gershgorin R; Gorbunov K
    BMC Bioinformatics; 2017 Dec; 18(1):537. PubMed ID: 29212445
    [TBL] [Abstract][Full Text] [Related]  

  • 4. The Multi-State Perfect Phylogeny Problem with missing and removable data: solutions via integer-programming and chordal graph theory.
    Gusfield D
    J Comput Biol; 2010 Mar; 17(3):383-99. PubMed ID: 20377452
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Efficient Minimum Flow Decomposition via Integer Linear Programming.
    Dias FHC; Williams L; Mumey B; Tomescu AI
    J Comput Biol; 2022 Nov; 29(11):1252-1267. PubMed ID: 36260412
    [TBL] [Abstract][Full Text] [Related]  

  • 7. An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes.
    Shao M; Lin Y; Moret BM
    J Comput Biol; 2015 May; 22(5):425-35. PubMed ID: 25517208
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An Integer Linear Programming Approach for Scaffolding Based on Exemplar Breakpoint Distance.
    Shieh YK; Peng DY; Chen YH; Wu TW; Lu CL
    J Comput Biol; 2022 Sep; 29(9):961-973. PubMed ID: 35638936
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A safety framework for flow decomposition problems via integer linear programming.
    Dias FHC; Cáceres M; Williams L; Mumey B; Tomescu AI
    Bioinformatics; 2023 Nov; 39(11):. PubMed ID: 37862229
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Scale-Free Spanning Trees and Their Application in Genomic Epidemiology.
    Orlovich Y; Kukharenko K; Kaibel V; Skums P
    J Comput Biol; 2021 Oct; 28(10):945-960. PubMed ID: 34491104
    [No Abstract]   [Full Text] [Related]  

  • 11. Genome Rearrangement with ILP.
    Hartmann T; Wieseke N; Sharan R; Middendorf M; Bernt M
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(5):1585-1593. PubMed ID: 28574364
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Discovery of Boolean metabolic networks: integer linear programming based approach.
    Qiu Y; Jiang H; Ching WK; Cheng X
    BMC Syst Biol; 2018 Apr; 12(Suppl 1):7. PubMed ID: 29671395
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An integer programming formulation of the parsimonious loss of heterozygosity problem.
    Catanzaro D; Labbé M; Halldórsson BV
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1391-402. PubMed ID: 24407298
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Better ILP models for haplotype assembly.
    Etemadi M; Bagherian M; Chen ZZ; Wang L
    BMC Bioinformatics; 2018 Feb; 19(Suppl 1):52. PubMed ID: 29504891
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Solving and analyzing side-chain positioning problems using linear and integer programming.
    Kingsford CL; Chazelle B; Singh M
    Bioinformatics; 2005 Apr; 21(7):1028-36. PubMed ID: 15546935
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming.
    Wu Z; Zhang Y
    Int J Bioinform Res Appl; 2008; 4(4):351-62. PubMed ID: 19008180
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A binary linear programming formulation of the graph edit distance.
    Justice D; Hero A
    IEEE Trans Pattern Anal Mach Intell; 2006 Aug; 28(8):1200-14. PubMed ID: 16886857
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An ILP solution for the gene duplication problem.
    Chang WC; Burleigh GJ; Fernández-Baca DF; Eulenstein O
    BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S14. PubMed ID: 21342543
    [TBL] [Abstract][Full Text] [Related]  

  • 19. RAPTOR: optimal protein threading by linear programming.
    Xu J; Li M; Kim D; Xu Y
    J Bioinform Comput Biol; 2003 Apr; 1(1):95-117. PubMed ID: 15290783
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Approaching the One-Sided Exemplar Adjacency Number Problem.
    Qingge L; Smith K; Jungst S; Wang B; Yang Q; Zhu B
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(6):1946-1954. PubMed ID: 31056506
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.