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 *

246 related articles for article (PubMed ID: 34720297)

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

  • 2. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 6. A New Augmentation Based Algorithm for Extracting Maximal Chordal Subgraphs.
    Bhowmick S; Chen TY; Halappanavar M
    J Parallel Distrib Comput; 2015 Feb; 76():132-144. PubMed ID: 25767331
    [TBL] [Abstract][Full Text] [Related]  

  • 7. The Connected
    Bai C; Zhou J; Liang Z
    Comput Intell Neurosci; 2021; 2021():3533623. PubMed ID: 34992643
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A Sharp Threshold Phenomenon in String Graphs.
    Tomon I
    Discrete Comput Geom; 2022; 67(1):338-359. PubMed ID: 35023884
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. MISAGA: An Algorithm for Mining Interesting Subgraphs in Attributed Graphs.
    He T; Chan KCC
    IEEE Trans Cybern; 2018 May; 48(5):1369-1382. PubMed ID: 28459699
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Mining the Enriched Subgraphs for Specific Vertices in a Biological Graph.
    Meysman P; Saeys Y; Sabaghian E; Bittremieux W; Van de Peer Y; Goethals B; Laukens K
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1496-1507. PubMed ID: 27295680
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Sitting Closer to Friends than Enemies, Revisited.
    Cygan M; Pilipczuk M; Pilipczuk M; Wojtaszczyk JO
    Theory Comput Syst; 2015; 56(2):394-405. PubMed ID: 26300686
    [TBL] [Abstract][Full Text] [Related]  

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

  • 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. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO
    Day MC; Hawthorne FC
    Acta Crystallogr A Found Adv; 2022 May; 78(Pt 3):212-233. PubMed ID: 35502713
    [TBL] [Abstract][Full Text] [Related]  

  • 18. The differential on operator S(Γ).
    Castro J; Basilio LA; Reyna G; Rosario O
    Math Biosci Eng; 2023 May; 20(7):11568-11584. PubMed ID: 37501409
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs.
    Fan Y; Zhang Z; Yu Q; Lai Y; Su K; Wang Y; Pan S; Latecki LJ
    Entropy (Basel); 2023 Sep; 25(10):. PubMed ID: 37895498
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 13.