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 *

116 related articles for article (PubMed ID: 23868775)

  • 1. Fast detection of dense subgraphs with iterative shrinking and expansion.
    Liu H; Latecki LJ; Yan S
    IEEE Trans Pattern Anal Mach Intell; 2013 Sep; 35(9):2131-42. PubMed ID: 23868775
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 7. Using Gaussian Boson Sampling to Find Dense Subgraphs.
    Arrazola JM; Bromley TR
    Phys Rev Lett; 2018 Jul; 121(3):030503. PubMed ID: 30085825
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 10. Subgraph queries by context-free grammars.
    Sevon P; Eronen L
    J Integr Bioinform; 2008 Aug; 5(2):. PubMed ID: 20134073
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Matched Filters for Noisy Induced Subgraph Detection.
    Sussman DL; Park Y; Priebe CE; Lyzinski V
    IEEE Trans Pattern Anal Mach Intell; 2020 Nov; 42(11):2887-2900. PubMed ID: 31059426
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs.
    Yang X; Qiao H; Liu ZY
    IEEE Trans Neural Netw Learn Syst; 2018 Jul; 29(7):3295-3300. PubMed ID: 28692989
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Graph classification using signal-subgraphs: applications in statistical connectomics.
    Vogelstein JT; Gray Roncal W; Vogelstein RJ; Priebe CE
    IEEE Trans Pattern Anal Mach Intell; 2013 Jul; 35(7):1539-51. PubMed ID: 23681985
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks.
    Dondi R; Hosseinzadeh MM; Guzzi PH
    Appl Netw Sci; 2021; 6(1):40. PubMed ID: 34124340
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Affinity learning with diffusion on tensor product graph.
    Yang X; Prasad L; Latecki LJ
    IEEE Trans Pattern Anal Mach Intell; 2013 Jan; 35(1):28-38. PubMed ID: 22392704
    [TBL] [Abstract][Full Text] [Related]  

  • 18. RASMA: a reverse search algorithm for mining maximal frequent subgraphs.
    Salem S; Alokshiya M; Hasan MA
    BioData Min; 2021 Mar; 14(1):19. PubMed ID: 33726790
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A method for identification of highly conserved elements and evolutionary analysis of superphylum Alveolata.
    Rubanov LI; Seliverstov AV; Zverkov OA; Lyubetsky VA
    BMC Bioinformatics; 2016 Sep; 17():385. PubMed ID: 27645252
    [TBL] [Abstract][Full Text] [Related]  

  • 20. The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.
    Demeyer S; Michoel T; Fostier J; Audenaert P; Pickavet M; Demeester P
    PLoS One; 2013; 8(4):e61183. PubMed ID: 23620730
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.