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 *

125 related articles for article (PubMed ID: 33286692)

  • 21. On the spectrum, energy and Laplacian energy of graphs with self-loops.
    Preetha P U; Suresh M; Bonyah E
    Heliyon; 2023 Jul; 9(7):e17001. PubMed ID: 37415950
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
    Shimizu M; Nagamochi H; Akutsu T
    BMC Bioinformatics; 2011 Dec; 12 Suppl 14(Suppl 14):S3. PubMed ID: 22373441
    [TBL] [Abstract][Full Text] [Related]  

  • 23. The Complexity of Optimal Design of Temporally Connected Graphs.
    Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG
    Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Inferring optimal species trees under gene duplication and loss.
    Bayzid MS; Mirarab S; Warnow T
    Pac Symp Biocomput; 2013; ():250-61. PubMed ID: 23424130
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Exactly computing the parsimony scores on phylogenetic networks using dynamic programming.
    Kannan L; Wheeler WC
    J Comput Biol; 2014 Apr; 21(4):303-19. PubMed ID: 24559134
    [TBL] [Abstract][Full Text] [Related]  

  • 27. The combinatorics of discrete time-trees: theory and open problems.
    Gavryushkin A; Whidden C; Matsen FA
    J Math Biol; 2018 Apr; 76(5):1101-1121. PubMed ID: 28756523
    [TBL] [Abstract][Full Text] [Related]  

  • 28. MISAGA: An Algorithm for Mining Interesting Subgraphs in Attributed Graphs.
    He T; Chan KCC
    IEEE Trans Cybern; 2018 May; 48(5):1369-1382. PubMed ID: 28459699
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Connectivity of Triangulation Flip Graphs in the Plane.
    Wagner U; Welzl E
    Discrete Comput Geom; 2022; 68(4):1227-1284. PubMed ID: 36466128
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Tangled piecewise-linear embeddings of trivalent graphs.
    O'Keeffe M; Treacy MMJ
    Acta Crystallogr A Found Adv; 2022 Mar; 78(Pt 2):128-138. PubMed ID: 35230268
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Designing an A* algorithm for calculating edit distance between rooted-unordered trees.
    Horesh Y; Mehr R; Unger R
    J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Distributed Optimization for Graph Matching.
    Van Tran Q; Sun Z; D O Anderson B; Ahn HS
    IEEE Trans Cybern; 2023 Aug; 53(8):4815-4828. PubMed ID: 35081034
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Sitting Closer to Friends than Enemies, Revisited.
    Cygan M; Pilipczuk M; Pilipczuk M; Wojtaszczyk JO
    Theory Comput Syst; 2015; 56(2):394-405. PubMed ID: 26300686
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Hosoya Polynomial for Subdivided Caterpillar Graphs.
    Numan M; Nawaz A; Aslam A; Butt SI
    Comb Chem High Throughput Screen; 2022; 25(3):554-559. PubMed ID: 33308123
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Fast construction of assembly trees for molecular graphs.
    Artemova S; Grudinin S; Redon S
    J Comput Chem; 2011 Jun; 32(8):1589-98. PubMed ID: 21328401
    [TBL] [Abstract][Full Text] [Related]  

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

  • 37. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A Prüfer-Sequence Based Algorithm for Calculating the Size of Ideal Randomly Branched Polymers.
    Singaram SW; Gopal A; Ben-Shaul A
    J Phys Chem B; 2016 Jul; 120(26):6231-7. PubMed ID: 27104292
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Vertex-connectivity in periodic graphs and underlying nets of crystal structures.
    Eon JG
    Acta Crystallogr A Found Adv; 2016 May; 72(Pt 3):376-84. PubMed ID: 27126114
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Counting glycans revisited.
    Böcker S; Wagner S
    J Math Biol; 2014 Oct; 69(4):799-816. PubMed ID: 23974240
    [TBL] [Abstract][Full Text] [Related]  

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