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 *

158 related articles for article (PubMed ID: 34124340)

  • 21. An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures.
    Jain S; Saju S; Petingi L; Schlick T
    Methods; 2019 Jun; 162-163():74-84. PubMed ID: 30928508
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Mining integrated semantic networks for drug repositioning opportunities.
    Mullen J; Cockell SJ; Tipney H; Woollard PM; Wipat A
    PeerJ; 2016; 4():e1558. PubMed ID: 26844016
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Atomic subgraphs and the statistical mechanics of networks.
    Wegner AE; Olhede S
    Phys Rev E; 2021 Apr; 103(4-1):042311. PubMed ID: 34005963
    [TBL] [Abstract][Full Text] [Related]  

  • 24. CeFunMO: A centrality based method for discovering functional motifs with application in biological networks.
    Kouhsar M; Razaghi-Moghadam Z; Mousavian Z; Masoudi-Nejad A
    Comput Biol Med; 2016 Sep; 76():154-9. PubMed ID: 27454243
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Patterns of ties in problem-solving networks and their dynamic properties.
    Braha D
    Sci Rep; 2020 Oct; 10(1):18137. PubMed ID: 33093552
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Super.Complex: A supervised machine learning pipeline for molecular complex detection in protein-interaction networks.
    Palukuri MV; Marcotte EM
    bioRxiv; 2021 Oct; ():. PubMed ID: 34189530
    [TBL] [Abstract][Full Text] [Related]  

  • 27. RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology.
    Kim N; Zheng Z; Elmetwaly S; Schlick T
    PLoS One; 2014; 9(9):e106074. PubMed ID: 25188578
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Path matching and graph matching in biological networks.
    Yang Q; Sze SH
    J Comput Biol; 2007; 14(1):56-67. PubMed ID: 17381346
    [TBL] [Abstract][Full Text] [Related]  

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

  • 30. MODA: an efficient algorithm for network motif discovery in biological networks.
    Omidi S; Schreiber F; Masoudi-Nejad A
    Genes Genet Syst; 2009 Oct; 84(5):385-95. PubMed ID: 20154426
    [TBL] [Abstract][Full Text] [Related]  

  • 31. DHPV: a distributed algorithm for large-scale graph partitioning.
    Adoni WYH; Nahhal T; Krichen M; El Byed A; Assayad I
    J Big Data; 2020; 7(1):76. PubMed ID: 32953386
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. Isolate sets partition benefits community detection of parallel Louvain method.
    Qie H; Li S; Dou Y; Xu J; Xiong Y; Gao Z
    Sci Rep; 2022 May; 12(1):8248. PubMed ID: 35581228
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. PC2P: parameter-free network-based prediction of protein complexes.
    Omranian S; Angeleska A; Nikoloski Z
    Bioinformatics; 2021 Apr; 37(1):73-81. PubMed ID: 33416831
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 39. Mining coherent dense subgraphs across massive biological networks for functional discovery.
    Hu H; Yan X; Huang Y; Han J; Zhou XJ
    Bioinformatics; 2005 Jun; 21 Suppl 1():i213-21. PubMed ID: 15961460
    [TBL] [Abstract][Full Text] [Related]  

  • 40. The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration.
    Houbraken M; Demeyer S; Michoel T; Audenaert P; Colle D; Pickavet M
    PLoS One; 2014; 9(5):e97896. PubMed ID: 24879305
    [TBL] [Abstract][Full Text] [Related]  

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