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 *

239 related articles for article (PubMed ID: 31496549)

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

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

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

  • 4. Faster Cut Sparsification of Weighted Graphs.
    Forster S; de Vos T
    Algorithmica; 2023; 85(4):929-964. PubMed ID: 37008076
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Monotone Circuit Lower Bounds from Robust Sunflowers.
    Cavalar BP; Kumar M; Rossman B
    Algorithmica; 2022; 84(12):3655-3685. PubMed ID: 36465838
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Covering Convex Bodies and the Closest Vector Problem.
    Naszódi M; Venzin M
    Discrete Comput Geom; 2022; 67(4):1191-1210. PubMed ID: 35572812
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Computing a smallest multilabeled phylogenetic tree from rooted triplets.
    Guillemot S; Jansson J; Sung WK
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1141-7. PubMed ID: 20733243
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Comparison between a quantum annealer and a classical approximation algorithm for computing the ground state of an Ising spin glass.
    Yaacoby R; Schaar N; Kellerhals L; Raz O; Hermelin D; Pugatch R
    Phys Rev E; 2022 Mar; 105(3-2):035305. PubMed ID: 35428085
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem.
    Pourhassan M; Shi F; Neumann F
    Evol Comput; 2019; 27(4):559-575. PubMed ID: 31012735
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Faster algorithms for counting subgraphs in sparse graphs.
    Bressan M
    Algorithmica; 2021; 83(8):2578-2605. PubMed ID: 34720296
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Fast molecular shape matching using contact maps.
    Agarwal PK; Mustafa NH; Wang Y
    J Comput Biol; 2007 Mar; 14(2):131-43. PubMed ID: 17456012
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs.
    Liu C; Song Y
    J Comb Optim; 2010 Apr; 20(2):1-15. PubMed ID: 23874144
    [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. Efficient Algorithms for Max-Weighted Point Sweep Coverage on Lines.
    Liang D; Shen H
    Sensors (Basel); 2021 Feb; 21(4):. PubMed ID: 33669745
    [TBL] [Abstract][Full Text] [Related]  

  • 18. A faster 1.375-approximation algorithm for sorting by transpositions.
    Cunha LF; Kowada LA; Hausen Rde A; de Figueiredo CM
    J Comput Biol; 2015 Nov; 22(11):1044-56. PubMed ID: 26383040
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Approximating the correction of weighted and unweighted orthology and paralogy relations.
    Dondi R; Lafond M; El-Mabrouk N
    Algorithms Mol Biol; 2017; 12():4. PubMed ID: 28293276
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms.
    Friedrich T; Neumann F
    Evol Comput; 2015; 23(4):543-58. PubMed ID: 26135719
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 12.