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 *

148 related articles for article (PubMed ID: 35397632)

  • 1. Continuous-time quantum walk based centrality testing on weighted graphs.
    Wang Y; Xue S; Wu J; Xu P
    Sci Rep; 2022 Apr; 12(1):6001. PubMed ID: 35397632
    [TBL] [Abstract][Full Text] [Related]  

  • 2. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Experimental Parity-Time Symmetric Quantum Walks for Centrality Ranking on Directed Graphs.
    Wu T; Izaac JA; Li ZX; Wang K; Chen ZZ; Zhu S; Wang JB; Ma XS
    Phys Rev Lett; 2020 Dec; 125(24):240501. PubMed ID: 33412067
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A generalized eigenvector centrality for multilayer networks with inter-layer constraints on adjacent node importance.
    Frost HR
    Appl Netw Sci; 2024; 9(1):14. PubMed ID: 38699246
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Temporal walk based centrality metric for graph streams.
    Béres F; Pálovics R; Oláh A; Benczúr AA
    Appl Netw Sci; 2018; 3(1):32. PubMed ID: 30839791
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs.
    Bai L; Rossi L; Cui L; Cheng J; Hancock ER
    IEEE Trans Cybern; 2020 Mar; 50(3):1264-1277. PubMed ID: 31295131
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Range-limited centrality measures in complex networks.
    Ercsey-Ravasz M; Lichtenwalter RN; Chawla NV; Toroczkai Z
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jun; 85(6 Pt 2):066103. PubMed ID: 23005158
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Node centrality measures are a poor substitute for causal inference.
    Dablander F; Hinne M
    Sci Rep; 2019 May; 9(1):6846. PubMed ID: 31048731
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Fast computation of matrix function-based centrality measures for layer-coupled multiplex networks.
    Bergermann K; Stoll M
    Phys Rev E; 2022 Mar; 105(3-1):034305. PubMed ID: 35428049
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Maximal-entropy random walk unifies centrality measures.
    Ochab JK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Dec; 86(6 Pt 2):066109. PubMed ID: 23368006
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Top influencers can be identified universally by combining classical centralities.
    Bucur D
    Sci Rep; 2020 Nov; 10(1):20550. PubMed ID: 33239723
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A proposal for ranking through selective computation of centrality measures.
    Bertaccini D; Filippo A
    PLoS One; 2023; 18(9):e0289488. PubMed ID: 37721940
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
    Chakraborty S; Novo L; Ambainis A; Omar Y
    Phys Rev Lett; 2016 Mar; 116(10):100501. PubMed ID: 27015464
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Clone temporal centrality measures for incomplete sequences of graph snapshots.
    Hanke M; Foraita R
    BMC Bioinformatics; 2017 May; 18(1):261. PubMed ID: 28511665
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk.
    Wang X; Zhang Y; Lu K; Wang X; Liu K
    Entropy (Basel); 2018 Aug; 20(8):. PubMed ID: 33265675
    [TBL] [Abstract][Full Text] [Related]  

  • 16. EIGENVECTOR-BASED CENTRALITY MEASURES FOR TEMPORAL NETWORKS
    Taylor D; Myers SA; Clauset A; Porter MA; Mucha PJ
    Multiscale Model Simul; 2017; 15(1):537-574. PubMed ID: 29046619
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Centrality-based identification of important edges in complex networks.
    Bröhl T; Lehnertz K
    Chaos; 2019 Mar; 29(3):033115. PubMed ID: 30927842
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity.
    Minello G; Rossi L; Torsello A
    Entropy (Basel); 2019 Mar; 21(3):. PubMed ID: 33267042
    [TBL] [Abstract][Full Text] [Related]  

  • 19. MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk.
    Liu K; Zhang Y; Lu K; Wang X; Wang X; Tian G
    Entropy (Basel); 2019 Jun; 21(6):. PubMed ID: 33267283
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A centrality measure for cycles and subgraphs II.
    Giscard PL; Wilson RC
    Appl Netw Sci; 2018; 3(1):9. PubMed ID: 30839787
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.