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 *

145 related articles for article (PubMed ID: 29937611)

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

  • 2. Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics.
    Marchand B; Ponty Y; Bulteau L
    Algorithms Mol Biol; 2022 Apr; 17(1):8. PubMed ID: 35366923
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Counting Linear Extensions: Parameterizations by Treewidth.
    Eiben E; Ganian R; Kangas K; Ordyniak S
    Algorithmica; 2019; 81(4):1657-1683. PubMed ID: 31007326
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. Parameterized Complexity of Directed Spanner Problems.
    Fomin FV; Golovach PA; Lochet W; Misra P; Saurabh S; Sharma R
    Algorithmica; 2022; 84(8):2292-2308. PubMed ID: 35880198
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
    Baste J; Paul C; Sau I; Scornavacca C
    Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Treewidth-based algorithms for the small parsimony problem on networks.
    Scornavacca C; Weller M
    Algorithms Mol Biol; 2022 Aug; 17(1):15. PubMed ID: 35987645
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Vertex Deletion into Bipartite Permutation Graphs.
    Bożyk Ł; Derbisz J; Krawczyk T; Novotná J; Okrasa K
    Algorithmica; 2022; 84(8):2271-2291. PubMed ID: 35880199
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
    Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B
    Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Solving Problems on Graphs of High Rank-Width.
    Eiben E; Ganian R; Szeider S
    Algorithmica; 2018; 80(2):742-771. PubMed ID: 31997848
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Finding Cactus Roots in Polynomial Time.
    Golovach PA; Kratsch D; Paulusma D; Stewart A
    Theory Comput Syst; 2018; 62(6):1409-1426. PubMed ID: 30996654
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Approximation and Parameterized Runtime Analysis of Evolutionary Algorithms for the Maximum Cut Problem.
    Zhou Y; Lai X; Li K
    IEEE Trans Cybern; 2015 Aug; 45(8):1491-8. PubMed ID: 25222964
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Parameterized model checking of rendezvous systems.
    Aminof B; Kotek T; Rubin S; Spegni F; Veith H
    Distrib Comput; 2018; 31(3):187-222. PubMed ID: 31258231
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Non-Preemptive Tree Packing.
    Lendl S; Woeginger G; Wulf L
    Algorithmica; 2023; 85(3):783-804. PubMed ID: 36883187
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Relating Vertex and Global Graph Entropy in Randomly Generated Graphs.
    Tee P; Parisis G; Berthouze L; Wakeman I
    Entropy (Basel); 2018 Jun; 20(7):. PubMed ID: 33265571
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.