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 *

111 related articles for article (PubMed ID: 38333715)

  • 1. A parameter-independent algorithm of finding maximum clique with Seidel continuous-time quantum walks.
    Li X; Chen X; Hu S; Xu J; Liu Z
    iScience; 2024 Feb; 27(2):108953. PubMed ID: 38333715
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. An efficient approximation algorithm for finding a maximum clique using Hopfield network learning.
    Wang RL; Tang Z; Cao QP
    Neural Comput; 2003 Jul; 15(7):1605-19. PubMed ID: 12816568
    [TBL] [Abstract][Full Text] [Related]  

  • 4. An optimization algorithm for maximum quasi-clique problem based on information feedback model.
    Liu S; Zhou J; Wang D; Zhang Z; Lei M
    PeerJ Comput Sci; 2024; 10():e2173. PubMed ID: 39145205
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Quantum algorithm for de novo DNA sequence assembly based on quantum walks on graphs.
    Varsamis GD; Karafyllidis IG; Gilkes KM; Arranz U; Martin-Cuevas R; Calleja G; Wong J; Jessen HC; Dimitrakis P; Kolovos P; Sandaltzopoulos R
    Biosystems; 2023 Nov; 233():105037. PubMed ID: 37734700
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Single-point position and transition defects in continuous time quantum walks.
    Li ZJ; Wang JB
    Sci Rep; 2015 Sep; 5():13585. PubMed ID: 26323855
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Approximating the maximum weight clique using replicator dynamics.
    Bomze IR; Pelillo M; Stix V
    IEEE Trans Neural Netw; 2000; 11(6):1228-41. PubMed ID: 18249849
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. Measuring graph similarity through continuous-time quantum walks and the quantum Jensen-Shannon divergence.
    Rossi L; Torsello A; Hancock ER
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Feb; 91(2):022815. PubMed ID: 25768560
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Exact parallel maximum clique algorithm for general and protein graphs.
    Depolli M; Konc J; Rozman K; Trobec R; Janežič D
    J Chem Inf Model; 2013 Sep; 53(9):2217-28. PubMed ID: 23965016
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Systematic dimensionality reduction for continuous-time quantum walks of interacting fermions.
    Izaac JA; Wang JB
    Phys Rev E; 2017 Sep; 96(3-1):032136. PubMed ID: 29346966
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Approximating maximum clique with a Hopfield network.
    Jagota A
    IEEE Trans Neural Netw; 1995; 6(3):724-35. PubMed ID: 18263357
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Quadratic Speedup for Spatial Search by Continuous-Time Quantum Walk.
    Apers S; Chakraborty S; Novo L; Roland J
    Phys Rev Lett; 2022 Oct; 129(16):160502. PubMed ID: 36306753
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Payoff-monotonic game dynamics and the maximum clique problem.
    Pelillo M; Torsello A
    Neural Comput; 2006 May; 18(5):1215-58. PubMed ID: 16595063
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. The maximum clique enumeration problem: algorithms, applications, and implementations.
    Eblen JD; Phillips CA; Rogers GL; Langston MA
    BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S5. PubMed ID: 22759429
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Clique percolation in random graphs.
    Li M; Deng Y; Wang BH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Oct; 92(4):042116. PubMed ID: 26565177
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Quantum Walk on the Generalized Birkhoff Polytope Graph.
    Cação R; Cortez L; de Farias I; Kozyreff E; Khatibi Moqadam J; Portugal R
    Entropy (Basel); 2021 Sep; 23(10):. PubMed ID: 34681963
    [TBL] [Abstract][Full Text] [Related]  

  • 19. On the complexity of quantum link prediction in complex networks.
    Moutinho JP; Magano D; Coutinho B
    Sci Rep; 2024 Jan; 14(1):1026. PubMed ID: 38200071
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An exact algorithm to find a maximum weight clique in a weighted undirected graph.
    Rozman K; Ghysels A; Janežič D; Konc J
    Sci Rep; 2024 Apr; 14(1):9118. PubMed ID: 38643335
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.