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 *

186 related articles for article (PubMed ID: 33265675)

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

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

  • 23. FlexGraph: Flexible partitioning and storage for scalable graph mining.
    Park C; Park HM; Kang U
    PLoS One; 2020; 15(1):e0227032. PubMed ID: 31978075
    [TBL] [Abstract][Full Text] [Related]  

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

  • 25. Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics.
    Aparo A; Bonnici V; Micale G; Ferro A; Shasha D; Pulvirenti A; Giugno R
    Interdiscip Sci; 2019 Mar; 11(1):21-32. PubMed ID: 30790228
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Coupling Graphs, Efficient Algorithms and B-Cell Epitope Prediction.
    Liang Zhao ; Hoi SC; Li Z; Wong L; Nguyen H; Li J
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(1):7-16. PubMed ID: 26355502
    [TBL] [Abstract][Full Text] [Related]  

  • 27. A Lagrangian relaxation network for graph matching.
    Rangarajan A; Mjolsness ED
    IEEE Trans Neural Netw; 1996; 7(6):1365-81. PubMed ID: 18263531
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 30. Efficient quantum walk on a quantum processor.
    Qiang X; Loke T; Montanaro A; Aungskunsiri K; Zhou X; O'Brien JL; Wang JB; Matthews JCF
    Nat Commun; 2016 May; 7():11511. PubMed ID: 27146471
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. Quantum walk processes in quantum devices.
    Madhu AK; Melnikov AA; Fedichkin LE; Alodjants AP; Lee RK
    Heliyon; 2023 Mar; 9(3):e13416. PubMed ID: 36895413
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.
    Chang WL; Chen JC; Chung WY; Hsiao CY; Wong R; Vasilakos AV
    IEEE Trans Nanobioscience; 2021 Jul; 20(3):354-376. PubMed ID: 33900920
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Comparing pedigree graphs.
    Kirkpatrick B; Reshef Y; Finucane H; Jiang H; Zhu B; Karp RM
    J Comput Biol; 2012 Sep; 19(9):998-1014. PubMed ID: 22897201
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 38. Transport Efficiency of Continuous-Time Quantum Walks on Graphs.
    Razzoli L; Paris MGA; Bordone P
    Entropy (Basel); 2021 Jan; 23(1):. PubMed ID: 33435338
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Mining the Enriched Subgraphs for Specific Vertices in a Biological Graph.
    Meysman P; Saeys Y; Sabaghian E; Bittremieux W; Van de Peer Y; Goethals B; Laukens K
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1496-1507. PubMed ID: 27295680
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 10.