• Reference Citation Analysis
  • v
  • v
  • Find an Article
Find an Article PDF (5068562)   Today's Articles (5)
For: Hočevar T, Demšar J. Combinatorial algorithm for counting small induced graphs and orbits. PLoS One 2017;12:e0171428. [PMID: 28182743 DOI: 10.1371/journal.pone.0171428] [Citation(s) in RCA: 10] [Impact Index Per Article: 1.3] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 06/02/2016] [Accepted: 01/20/2017] [Indexed: 11/19/2022]  Open
Number Cited by Other Article(s)
1
Paul D, Saha S, Basu S, Chakraborti T. Computational analysis of pathogen-host interactome for fast and low-risk in-silico drug repurposing in emerging viral threats like Mpox. Sci Rep 2024;14:18736. [PMID: 39134619 PMCID: PMC11319331 DOI: 10.1038/s41598-024-69617-8] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 04/30/2024] [Accepted: 08/07/2024] [Indexed: 08/15/2024]  Open
2
Singh P, Kuder H, Ritz A. Identification of disease modules using higher-order network structure. BIOINFORMATICS ADVANCES 2023;3:vbad140. [PMID: 37860106 PMCID: PMC10582521 DOI: 10.1093/bioadv/vbad140] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Grants] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 05/23/2023] [Revised: 09/18/2023] [Accepted: 10/03/2023] [Indexed: 10/21/2023]
3
Cunningham E, Greene D. Surrogate explanations for role discovery on graphs. APPLIED NETWORK SCIENCE 2023;8:28. [PMID: 37250201 PMCID: PMC10219885 DOI: 10.1007/s41109-023-00551-w] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 03/06/2023] [Accepted: 05/05/2023] [Indexed: 05/31/2023]
4
Fushimi T, Saito K, Motoda H. Efficient computation of expected motif frequency in uncertain graphs by exploiting possible world marginalization and motif transition. SOCIAL NETWORK ANALYSIS AND MINING 2022. [DOI: 10.1007/s13278-022-00956-y] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/14/2022]
5
Matelsky JK, Reilly EP, Johnson EC, Stiso J, Bassett DS, Wester BA, Gray-Roncal W. DotMotif: an open-source tool for connectome subgraph isomorphism search and graph queries. Sci Rep 2021;11:13045. [PMID: 34158519 PMCID: PMC8219732 DOI: 10.1038/s41598-021-91025-5] [Citation(s) in RCA: 10] [Impact Index Per Article: 2.5] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Grants] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/29/2021] [Accepted: 04/29/2021] [Indexed: 01/02/2023]  Open
PrevPage 1 of 1 1Next
© 2004-2025 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA