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 *

118 related articles for article (PubMed ID: 36883187)

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

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

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

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

  • 5. The Complexity of Optimal Design of Temporally Connected Graphs.
    Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG
    Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196
    [TBL] [Abstract][Full Text] [Related]  

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

  • 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. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 12. Continuous facility location on graphs.
    Hartmann TA; Lendl S; Woeginger GJ
    Math Program; 2022; 192(1-2):207-227. PubMed ID: 35300152
    [TBL] [Abstract][Full Text] [Related]  

  • 13. NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH.
    Linderman GC; Steinerberger S
    Math Comput; 2020; 89(324):1933-1952. PubMed ID: 33927452
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem.
    Bossek J; Grimme C
    Evol Comput; 2024 Jun; 32(2):143-175. PubMed ID: 37290030
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 17. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.
    Lai X; Zhou Y; Xia X; Zhang Q
    Evol Comput; 2017; 25(4):707-723. PubMed ID: 27959580
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Flip Distances Between Graph Orientations.
    Aichholzer O; Cardinal J; Huynh T; Knauer K; Mütze T; Steiner R; Vogtenhuber B
    Algorithmica; 2021; 83(1):116-143. PubMed ID: 33583986
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Partitioning Biological Networks into Highly Connected Clusters with Maximum Edge Coverage.
    Hüffner F; Komusiewicz C; Liebtrau A; Niedermeier R
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(3):455-67. PubMed ID: 26356014
    [TBL] [Abstract][Full Text] [Related]  

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

    [Next]    [New Search]
    of 6.