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 *

135 related articles for article (PubMed ID: 20976188)

  • 1. A kernelisation approach for multiple d-Hitting Set and its application in optimal multi-drug therapeutic combinations.
    Mellor D; Prieto E; Mathieson L; Moscato P
    PLoS One; 2010 Oct; 5(10):e13055. PubMed ID: 20976188
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Optimal drug combinations and minimal hitting sets.
    Vazquez A
    BMC Syst Biol; 2009 Aug; 3():81. PubMed ID: 19660129
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Fixed-parameter tractability of the maximum agreement supertree problem.
    Guillemot S; Berry V
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Parameterized complexity analysis in computational biology.
    Bodlaender HL; Downey RG; Fellows MR; Hallett MT; Wareham HT
    Comput Appl Biosci; 1995 Feb; 11(1):49-57. PubMed ID: 7796275
    [TBL] [Abstract][Full Text] [Related]  

  • 5. On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes.
    Bonizzoni P; Dondi R; Klau GW; Pirola Y; Pisanti N; Zaccaria S
    J Comput Biol; 2016 Sep; 23(9):718-36. PubMed ID: 27280382
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Exploiting bounded signal flow for graph orientation based on cause-effect pairs.
    Dorn B; Hüffner F; Krüger D; Niedermeier R; Uhlmann J
    Algorithms Mol Biol; 2011 Aug; 6():21. PubMed ID: 21867496
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Stable Matchings with Covering Constraints: A Complete Computational Trichotomy.
    Mnich M; Schlotter I
    Algorithmica; 2020; 82(5):1136-1188. PubMed ID: 32214574
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An "optimal" k-needle placement strategy and its application to guiding transbronchial needle aspirations.
    Kukuk M
    Comput Aided Surg; 2004; 9(6):261-90. PubMed ID: 16112977
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Identifying multi-hit carcinogenic gene combinations: Scaling up a weighted set cover algorithm using compressed binary matrix representation on a GPU.
    Al Hajri Q; Dash S; Feng WC; Garner HR; Anandakrishnan R
    Sci Rep; 2020 Feb; 10(1):2022. PubMed ID: 32029803
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Improved Analysis of High-Throughput Sequencing Data Using Small Universal k-Mer Hitting Sets.
    Orenstein Y
    Methods Mol Biol; 2021; 2243():95-105. PubMed ID: 33606254
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Combining targeted therapies: practical issues to consider at the bench and bedside.
    Rodon J; Perez J; Kurzrock R
    Oncologist; 2010; 15(1):37-50. PubMed ID: 20080862
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Parameterized Complexity of Eulerian Deletion Problems.
    Cygan M; Marx D; Pilipczuk M; Pilipczuk M; Schlotter I
    Algorithmica; 2014; 68(1):41-61. PubMed ID: 24415818
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.
    Hüffner F; Komusiewicz C; Niedermeier R; Wernicke S
    Methods Mol Biol; 2017; 1526():363-402. PubMed ID: 27896752
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Computing galled networks from real data.
    Huson DH; Rupp R; Berry V; Gambette P; Paul C
    Bioinformatics; 2009 Jun; 25(12):i85-93. PubMed ID: 19478021
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems.
    Berry V; Nicolas F
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(3):289-302. PubMed ID: 17048466
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Hierarchical clustering using the arithmetic-harmonic cut: complexity and experiments.
    Rizzi R; Mahata P; Mathieson L; Moscato P
    PLoS One; 2010 Dec; 5(12):e14067. PubMed ID: 21151943
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication.
    Hunt FY
    J Res Natl Inst Stand Technol; 2016; 121():180-195. PubMed ID: 34434619
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Statistical mechanics of the hitting set problem.
    Mézard M; Tarzia M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Oct; 76(4 Pt 1):041124. PubMed ID: 17994953
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Predicting Tumor Cell Response to Synergistic Drug Combinations Using a Novel Simplified Deep Learning Model.
    Zhang H; Feng J; Zeng A; Payne P; Li F
    AMIA Annu Symp Proc; 2020; 2020():1364-1372. PubMed ID: 33936513
    [TBL] [Abstract][Full Text] [Related]  

  • 20. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
    Ganian R; Ordyniak S
    Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.