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)

  • 21. Scalable probabilistic truss decomposition using central limit theorem and H-index.
    Esfahani F; Daneshmand M; Srinivasan V; Thomo A; Wu K
    Distrib Parallel Databases; 2022; 40(2-3):299-333. PubMed ID: 35911177
    [TBL] [Abstract][Full Text] [Related]  

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

  • 23. A linear delay algorithm for enumerating all connected induced subgraphs.
    Alokshiya M; Salem S; Abed F
    BMC Bioinformatics; 2019 Jun; 20(Suppl 12):319. PubMed ID: 31216984
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 27. SING: subgraph search in non-homogeneous graphs.
    Di Natale R; Ferro A; Giugno R; Mongiovì M; Pulvirenti A; Shasha D
    BMC Bioinformatics; 2010 Feb; 11():96. PubMed ID: 20170516
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Efficient orbit-aware triad and quad census in directed and undirected graphs.
    Ortmann M; Brandes U
    Appl Netw Sci; 2017; 2(1):13. PubMed ID: 30443568
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics.
    Aparo A; Bonnici V; Micale G; Ferro A; Shasha D; Pulvirenti A; Giugno R
    Interdiscip Sci; 2019 Mar; 11(1):21-32. PubMed ID: 30790228
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Directed acyclic graphs with edge-specific bounds.
    Vanderweele TJ; Tan Z
    Biometrika; 2012 Mar; 99(1):115-126. PubMed ID: 23049135
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Subgraph ensembles and motif discovery using an alternative heuristic for graph isomorphism.
    Baskerville K; Paczuski M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Nov; 74(5 Pt 1):051903. PubMed ID: 17279935
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting.
    Bouritsas G; Frasca F; Zafeiriou S; Bronstein MM
    IEEE Trans Pattern Anal Mach Intell; 2023 Jan; 45(1):657-668. PubMed ID: 35201983
    [TBL] [Abstract][Full Text] [Related]  

  • 33. The probabilistic convolution tree: efficient exact Bayesian inference for faster LC-MS/MS protein inference.
    Serang O
    PLoS One; 2014; 9(3):e91507. PubMed ID: 24626234
    [TBL] [Abstract][Full Text] [Related]  

  • 34. The local vertex anti-magic coloring for certain graph operations.
    Uma L; Rajasekaran G
    Heliyon; 2024 Jul; 10(13):e33400. PubMed ID: 39044974
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Sequence Alignment on Directed Graphs.
    Kavya VNS; Tayal K; Srinivasan R; Sivadasan N
    J Comput Biol; 2019 Jan; 26(1):53-67. PubMed ID: 30204489
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Factorization and pseudofactorization of weighted graphs.
    Sheridan K; Berleant J; Bathe M; Condon A; Williams VV
    Discrete Appl Math; 2023 Oct; 337():81-105. PubMed ID: 37213330
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Multibody graph transformations and analysis: Part I: Tree topology systems.
    Jain A
    Nonlinear Dyn; 2012 Mar; 67(4):. PubMed ID: 24288438
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A Two-Phase Algorithm for Differentially Private Frequent Subgraph Mining.
    Cheng X; Su S; Xu S; Xiong L; Xiao K; Zhao M
    IEEE Trans Knowl Data Eng; 2018 Aug; 30(8):1411-1425. PubMed ID: 33223776
    [TBL] [Abstract][Full Text] [Related]  

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

  • 40. Querying large graphs in biomedicine with colored graphs and decomposition.
    Chou CH; Sheu P; Hayakawa M; Kitazawa A
    J Biomed Inform; 2020 Aug; 108():103503. PubMed ID: 32682828
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 9.