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 *

170 related articles for article (PubMed ID: 34720296)

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

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

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

  • 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. Entropy, Graph Homomorphisms, and Dissociation Sets.
    Wang Z; Tu J; Lang R
    Entropy (Basel); 2023 Jan; 25(1):. PubMed ID: 36673303
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Robust subgraph counting with distribution-free random graph analysis.
    van Leeuwaarden JSH; Stegehuis C
    Phys Rev E; 2021 Oct; 104(4-1):044313. PubMed ID: 34781540
    [TBL] [Abstract][Full Text] [Related]  

  • 7. On Finding and Enumerating Maximal and Maximum
    Phillips CA; Wang K; Baker EJ; Bubier JA; Chesler EJ; Langston MA
    Algorithms; 2019 Jan; 12(1):. PubMed ID: 31448059
    [TBL] [Abstract][Full Text] [Related]  

  • 8. (p,q)-biclique counting and enumeration for large sparse bipartite graphs.
    Yang J; Peng Y; Ouyang D; Zhang W; Lin X; Zhao X
    VLDB J; 2023 Mar; ():1-25. PubMed ID: 37362202
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Maximal prime subgraph decomposition of Bayesian networks.
    Olesen KG; Madsen AL
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(1):21-31. PubMed ID: 18238100
    [TBL] [Abstract][Full Text] [Related]  

  • 10. k-Partite cliques of protein interactions: A novel subgraph topology for functional coherence analysis on PPI networks.
    Liu Q; Chen YP; Li J
    J Theor Biol; 2014 Jan; 340():146-54. PubMed ID: 24056214
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness.
    Roth M; Schmitt J
    Algorithmica; 2020; 82(8):2267-2291. PubMed ID: 32801408
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. Dissecting molecular network structures using a network subgraph approach.
    Huang CH; Zaenudin E; Tsai JJP; Kurubanjerdjit N; Dessie EY; Ng KL
    PeerJ; 2020; 8():e9556. PubMed ID: 33005483
    [TBL] [Abstract][Full Text] [Related]  

  • 14. acc-Motif: Accelerated Network Motif Detection.
    Meira LA; Máximo VR; Fazenda ÁL; da Conceição AF
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(5):853-62. PubMed ID: 26356858
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Dense Subgraph Partition of Positive Hypergraphs.
    Liu H; Latecki LJ; Yan S
    IEEE Trans Pattern Anal Mach Intell; 2015 Mar; 37(3):541-54. PubMed ID: 26353260
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Coupling Graphs, Efficient Algorithms and B-Cell Epitope Prediction.
    Liang Zhao ; Hoi SC; Li Z; Wong L; Nguyen H; Li J
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(1):7-16. PubMed ID: 26355502
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Biomolecular network motif counting and discovery by color coding.
    Alon N; Dao P; Hajirasouliha I; Hormozdiari F; Sahinalp SC
    Bioinformatics; 2008 Jul; 24(13):i241-9. PubMed ID: 18586721
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Discriminative Feature Selection for Uncertain Graph Classification.
    Kong X; Yu PS; Wang X; Ragin AB
    Proc SIAM Int Conf Data Min; 2013; 2013():82-93. PubMed ID: 25949925
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Generalized Sparse Learning of Linear Models Over the Complete Subgraph Feature Set.
    Takigawa I; Mamitsuka H
    IEEE Trans Pattern Anal Mach Intell; 2017 Mar; 39(3):617-624. PubMed ID: 27187949
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.