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.
23. Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3. Carletti V; Foggia P; Saggese A; Vento M IEEE Trans Pattern Anal Mach Intell; 2018 Apr; 40(4):804-818. PubMed ID: 28436848 [TBL] [Abstract][Full Text] [Related]
24. Sensible method for updating motif instances in an increased biological network. Kim WY; Kurmar S Methods; 2015 Jul; 83():71-9. PubMed ID: 25869675 [TBL] [Abstract][Full Text] [Related]
25. NSSRF: global network similarity search with subgraph signatures and its applications. Zhang J; Kwong S; Jia Y; Wong KC Bioinformatics; 2017 Jun; 33(11):1696-1702. PubMed ID: 28158419 [TBL] [Abstract][Full Text] [Related]
26. 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]
27. Recognizing Predictive Substructures With Subgraph Information Bottleneck. Yu J; Xu T; Rong Y; Bian Y; Huang J; He R IEEE Trans Pattern Anal Mach Intell; 2024 Mar; 46(3):1650-1663. PubMed ID: 34520347 [TBL] [Abstract][Full Text] [Related]
28. (p,q)-biclique counting and enumeration for large sparse bipartite graphs. Yang J; Peng Y; Ouyang D; Zhang W; Lin X; Zhao X VLDB J; 2023 Mar; ():1-25. PubMed ID: 37362202 [TBL] [Abstract][Full Text] [Related]
29. Tugging graphs faster: efficiently modifying path-preserving hierarchies for browsing paths. Archambault D; Munzner T; Auber D IEEE Trans Vis Comput Graph; 2011 Mar; 17(3):276-89. PubMed ID: 20421680 [TBL] [Abstract][Full Text] [Related]
31. DotMotif: an open-source tool for connectome subgraph isomorphism search and graph queries. Matelsky JK; Reilly EP; Johnson EC; Stiso J; Bassett DS; Wester BA; Gray-Roncal W Sci Rep; 2021 Jun; 11(1):13045. PubMed ID: 34158519 [TBL] [Abstract][Full Text] [Related]
32. Leveraging the structure of the Semantic Web to enhance information retrieval for proteomics. Smith A; Cheung K; Krauthammer M; Schultz M; Gerstein M Bioinformatics; 2007 Nov; 23(22):3073-9. PubMed ID: 17923450 [TBL] [Abstract][Full Text] [Related]
33. 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]
34. A query language for biological networks. Leser U Bioinformatics; 2005 Sep; 21 Suppl 2():ii33-9. PubMed ID: 16204121 [TBL] [Abstract][Full Text] [Related]
35. Developing a modern web interface for database-driven bioinformatics tools. Khandheria P; Garner HR IEEE Eng Med Biol Mag; 2007; 26(2):96-8. PubMed ID: 17441614 [No Abstract] [Full Text] [Related]
36. Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming. Imada T; Ota S; Nagamochi H; Akutsu T J Chem Inf Model; 2011 Nov; 51(11):2788-807. PubMed ID: 21848281 [TBL] [Abstract][Full Text] [Related]
37. 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]
38. The LAILAPS search engine: relevance ranking in life science databases. Lange M; Spies K; Bargsten J; Haberhauer G; Klapperstück M; Leps M; Weinel C; Wünschiers R; Weissbach M; Stein J; Scholz U J Integr Bioinform; 2010 Jan; 7(2):110. PubMed ID: 20134080 [TBL] [Abstract][Full Text] [Related]
39. 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]
40. Subgraph-aware graph structure revision for spatial-temporal graph modeling. Wang Y; Zhang C; Xiang S; Pan C Neural Netw; 2022 Oct; 154():190-202. PubMed ID: 35905653 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]