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 *

202 related articles for article (PubMed ID: 30790228)

  • 21. SICOR: Subgraph Isomorphism Comparison of RNA Secondary Structures.
    Schmidt M; Hamacher K; Reinhardt F; Lotz TS; Groher F; Suess B; Jager S
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(6):2189-2195. PubMed ID: 31295116
    [TBL] [Abstract][Full Text] [Related]  

  • 22. [A retrieval method of drug molecules based on graph collapsing].
    Qu JW; Lv XQ; Liu ZM; Liao Y; Sun PH; Wang B; Tang Z
    Beijing Da Xue Xue Bao Yi Xue Ban; 2018 Apr; 50(2):368-374. PubMed ID: 29643542
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A (sub)graph isomorphism algorithm for matching large graphs.
    Cordella LP; Foggia P; Sansone C; Vento M
    IEEE Trans Pattern Anal Mach Intell; 2004 Oct; 26(10):1367-72. PubMed ID: 15641723
    [TBL] [Abstract][Full Text] [Related]  

  • 24. CytoMCS: A Multiple Maximum Common Subgraph Detection Tool for Cytoscape.
    Larsen SJ; Baumbach J
    J Integr Bioinform; 2017 Jul; 14(2):. PubMed ID: 28731857
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. Protein structure comparison using bipartite graph matching and its application to protein structure classification.
    Taylor WR
    Mol Cell Proteomics; 2002 Apr; 1(4):334-9. PubMed ID: 12096115
    [TBL] [Abstract][Full Text] [Related]  

  • 27. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Accurate classification of protein structural families using coherent subgraph analysis.
    Huan J; Wang W; Washington A; Prins J; Shah R; Tropsha A
    Pac Symp Biocomput; 2004; ():411-22. PubMed ID: 14992521
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 31. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
    Wang Z; Ren X; Ji Z; Huang W; Wu T
    Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Parallel clustering algorithm for large data sets with applications in bioinformatics.
    Olman V; Mao F; Wu H; Xu Y
    IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(2):344-52. PubMed ID: 19407357
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Grasping frequent subgraph mining for bioinformatics applications.
    Mrzic A; Meysman P; Bittremieux W; Moris P; Cule B; Goethals B; Laukens K
    BioData Min; 2018; 11():20. PubMed ID: 30202444
    [TBL] [Abstract][Full Text] [Related]  

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

  • 35. Motif discovery in biological network using expansion tree.
    Patra S; Mohapatra A
    J Bioinform Comput Biol; 2018 Dec; 16(6):1850024. PubMed ID: 30415600
    [TBL] [Abstract][Full Text] [Related]  

  • 36. SIGMA: a set-cover-based inexact graph matching algorithm.
    Mongiovì M; Di Natale R; Giugno R; Pulvirenti A; Ferro A; Sharan R
    J Bioinform Comput Biol; 2010 Apr; 8(2):199-218. PubMed ID: 20401944
    [TBL] [Abstract][Full Text] [Related]  

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

  • 38. Systematic identification of statistically significant network measures.
    Ziv E; Koytcheff R; Middendorf M; Wiggins C
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jan; 71(1 Pt 2):016110. PubMed ID: 15697661
    [TBL] [Abstract][Full Text] [Related]  

  • 39. cmFSM: a scalable CPU-MIC coordinated drug-finding tool by frequent subgraph mining.
    Yang S; Guo R; Liu R; Liao X; Zou Q; Shi B; Peng S
    BMC Bioinformatics; 2018 May; 19(Suppl 4):98. PubMed ID: 29745832
    [TBL] [Abstract][Full Text] [Related]  

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

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