215 related articles for article (PubMed ID: 25767331)
1. 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]
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 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]
4. 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]
5. Discriminative Feature Selection for Uncertain Graph Classification.
Kong X; Yu PS; Wang X; Ragin AB
Proc SIAM Int Conf Data Min; 2013; 2013():82-93. PubMed ID: 25949925
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. 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]
8. Maximal prime subgraph decomposition of Bayesian networks.
Olesen KG; Madsen AL
IEEE Trans Syst Man Cybern B Cybern; 2002; 32(1):21-31. PubMed ID: 18238100
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. 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]
11. 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]
12. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B
Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297
[TBL] [Abstract][Full Text] [Related]
13. On the Variable Ordering in Subgraph Isomorphism Algorithms.
Bonnici V; Giugno R
IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(1):193-203. PubMed ID: 26761859
[TBL] [Abstract][Full Text] [Related]
14. Algorithms for the quantitative Lock/Key model of cytoplasmic incompatibility.
Calamoneri T; Gastaldello M; Mary A; Sagot MF; Sinaimeri B
Algorithms Mol Biol; 2020; 15():14. PubMed ID: 32704304
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. 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]
17. 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]
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. 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]
20. 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]
[Next] [New Search]
