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 *

135 related articles for article (PubMed ID: 33267283)

  • 1. 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]  

  • 2. 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]  

  • 3. An R-Convolution Graph Kernel Based on Fast Discrete-Time Quantum Walk.
    Zhang Y; Wang L; Wilson RC; Liu K
    IEEE Trans Neural Netw Learn Syst; 2022 Jan; 33(1):292-303. PubMed ID: 33064655
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A (sub)graph isomorphism algorithm for matching large graphs.
    Cordella LP; Foggia P; Sansone C; Vento M
    IEEE Trans Pattern Anal Mach Intell; 2004 Oct; 26(10):1367-72. PubMed ID: 15641723
    [TBL] [Abstract][Full Text] [Related]  

  • 5. [A retrieval method of drug molecules based on graph collapsing].
    Qu JW; Lv XQ; Liu ZM; Liao Y; Sun PH; Wang B; Tang Z
    Beijing Da Xue Xue Bao Yi Xue Ban; 2018 Apr; 50(2):368-374. PubMed ID: 29643542
    [TBL] [Abstract][Full Text] [Related]  

  • 6. 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]  

  • 7. 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]  

  • 8. Exact and approximate graph matching using random walks.
    Gori M; Maggini M; Sarti L
    IEEE Trans Pattern Anal Mach Intell; 2005 Jul; 27(7):1100-11. PubMed ID: 16013757
    [TBL] [Abstract][Full Text] [Related]  

  • 9. An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks.
    He J; Wang C; Qiu K; Zhong W
    BMC Syst Biol; 2014; 8 Suppl 3(Suppl 3):S6. PubMed ID: 25350277
    [TBL] [Abstract][Full Text] [Related]  

  • 10. 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]  

  • 11. Top-k similar graph matching using TraM in biological networks.
    Amin MS; Finley RL; Jamil HM
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1790-804. PubMed ID: 22732692
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A Graph Isomorphism Condition and Equivalence of Reaction Systems.
    Genova D; Hoogeboom HJ; Jonoska N
    Theor Comput Sci; 2017 Nov; 701():109-119. PubMed ID: 32038065
    [TBL] [Abstract][Full Text] [Related]  

  • 13. On convex relaxation of graph isomorphism.
    Aflalo Y; Bronstein A; Kimmel R
    Proc Natl Acad Sci U S A; 2015 Mar; 112(10):2942-7. PubMed ID: 25713342
    [TBL] [Abstract][Full Text] [Related]  

  • 14. k-hop graph neural networks.
    Nikolentzos G; Dasoulas G; Vazirgiannis M
    Neural Netw; 2020 Oct; 130():195-205. PubMed ID: 32682085
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Multi-qubit quantum computing using discrete-time quantum walks on closed graphs.
    Chawla P; Singh S; Agarwal A; Srinivasan S; Chandrashekar CM
    Sci Rep; 2023 Jul; 13(1):12078. PubMed ID: 37495607
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Experimental quantum annealing: case study involving the graph isomorphism problem.
    Zick KM; Shehab O; French M
    Sci Rep; 2015 Jun; 5():11168. PubMed ID: 26053973
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Bond topology of chain, ribbon and tube silicates. Part I. Graph-theory generation of infinite one-dimensional arrangements of (TO
    Day MC; Hawthorne FC
    Acta Crystallogr A Found Adv; 2022 May; 78(Pt 3):212-233. PubMed ID: 35502713
    [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. Motif mining based on network space compression.
    Zhang Q; Xu Y
    BioData Min; 2015; 8(1):29. PubMed ID: 25525470
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Making graphs compact by lossless contraction.
    Fan W; Li Y; Liu M; Lu C
    VLDB J; 2023; 32(1):49-73. PubMed ID: 36686981
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.