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 *

198 related articles for article (PubMed ID: 30956356)

  • 1. New algorithms for maximum disjoint paths based on tree-likeness.
    Fleszar K; Mnich M; Spoerhase J
    Math Program; 2018; 171(1):433-461. PubMed ID: 30956356
    [TBL] [Abstract][Full Text] [Related]  

  • 2. New Tools and Connections for Exponential-Time Approximation.
    Bansal N; Chalermsook P; Laekhanukit B; Nanongkai D; Nederlof J
    Algorithmica; 2019; 81(10):3993-4009. PubMed ID: 31496549
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. On the Parameterized Complexity of Compact Set Packing.
    Gadekar A
    Algorithmica; 2024; 86(11):3579-3597. PubMed ID: 39411119
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.
    Tomescu AI; Gagie T; Popa A; Rizzi R; Kuosmanen A; Mäkinen V
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1345-54. PubMed ID: 26671806
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Simple Algorithm for Finding All k-Edge-Connected Components.
    Wang T; Zhang Y; Chin FY; Ting HF; Tsin YH; Poon SH
    PLoS One; 2015; 10(9):e0136264. PubMed ID: 26368134
    [TBL] [Abstract][Full Text] [Related]  

  • 7. An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length.
    Shin D; Choi S
    PLoS One; 2023; 18(11):e0294353. PubMed ID: 37988376
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Querying graphs in protein-protein interactions networks using feedback vertex set.
    Blin G; Sikora F; Vialette S
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):628-35. PubMed ID: 20498512
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Dynamic Averaging Load Balancing on Cycles.
    Alistarh D; Nadiradze G; Sabour A
    Algorithmica; 2022; 84(4):1007-1029. PubMed ID: 35330618
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds.
    Bansal N; Oosterwijk T; Vredeveld T; van der Zwaan R
    Algorithmica; 2016; 76(4):1077-1096. PubMed ID: 32355383
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Untangling tanglegrams: comparing trees by their drawings.
    Venkatachalam B; Apple J; St John K; Gusfield D
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):588-97. PubMed ID: 20530818
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Equivalence classes and conditional hardness in massively parallel computations.
    Nanongkai D; Scquizzato M
    Distrib Comput; 2022; 35(2):165-183. PubMed ID: 35300185
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Approximating the double-cut-and-join distance between unsigned genomes.
    Chen X; Sun R; Yu J
    BMC Bioinformatics; 2011 Oct; 12 Suppl 9(Suppl 9):S17. PubMed ID: 22151948
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On Perturbation Resilience of Non-uniform
    Bandyapadhyay S
    Algorithmica; 2022; 84(1):13-36. PubMed ID: 35125578
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Complexity of Secure Sets.
    Bliem B; Woltran S
    Algorithmica; 2018; 80(10):2909-2940. PubMed ID: 29937611
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Approximation properties of haplotype tagging.
    Vinterbo SA; Dreiseitl S; Ohno-Machado L
    BMC Bioinformatics; 2006 Jan; 7():8. PubMed ID: 16401341
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Torus Pairwise Disjoint-Path Routing.
    Bossard A; Kaneko K
    Sensors (Basel); 2018 Nov; 18(11):. PubMed ID: 30428614
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.