350 related articles for article (PubMed ID: 28459699)
1. 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]
2. 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]
3. Discovering interesting molecular substructures for molecular classification.
Lam WW; Chan KC
IEEE Trans Nanobioscience; 2010 Jun; 9(2):77-89. PubMed ID: 20650702
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. 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]
6. 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]
7. FlexGraph: Flexible partitioning and storage for scalable graph mining.
Park C; Park HM; Kang U
PLoS One; 2020; 15(1):e0227032. PubMed ID: 31978075
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. 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]
10. 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]
11. Attribute-based Decision Graphs: A framework for multiclass data classification.
Bertini JR; Nicoletti MD; Zhao L
Neural Netw; 2017 Jan; 85():69-84. PubMed ID: 27814467
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. Context-driven automatic subgraph creation for literature-based discovery.
Cameron D; Kavuluru R; Rindflesch TC; Sheth AP; Thirunarayan K; Bodenreider O
J Biomed Inform; 2015 Apr; 54():141-57. PubMed ID: 25661592
[TBL] [Abstract][Full Text] [Related]
14. Graph mining: procedure, application to drug discovery and recent advances.
Takigawa I; Mamitsuka H
Drug Discov Today; 2013 Jan; 18(1-2):50-7. PubMed ID: 22889967
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. 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]
17. 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]
18. 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]
19. Multi-Graph Multi-Label Learning Based on Entropy.
Zhu Z; Zhao Y
Entropy (Basel); 2018 Apr; 20(4):. PubMed ID: 33265336
[TBL] [Abstract][Full Text] [Related]
20. The frequent complete subgraphs in the human connectome.
Fellner M; Varga B; Grolmusz V
PLoS One; 2020; 15(8):e0236883. PubMed ID: 32817642
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
