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 *

129 related articles for article (PubMed ID: 35528366)

  • 21. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
    Ganian R; Ordyniak S
    Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803
    [TBL] [Abstract][Full Text] [Related]  

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

  • 23. Analysis of the relationship among the graphs isomorphic to multilayered cyclic fence graphs (MLCFG).
    Xia J; Hosoya H
    J Chem Inf Comput Sci; 2002; 42(5):1004-10. PubMed ID: 12376987
    [TBL] [Abstract][Full Text] [Related]  

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

  • 25. On
    Inayah N; Susanto F; Semaničová-Feňovčíková A
    Heliyon; 2021 Oct; 7(10):e08203. PubMed ID: 34712860
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Classes of tree-based networks.
    Fischer M; Galla M; Herbst L; Long Y; Wicke K
    Vis Comput Ind Biomed Art; 2020 May; 3(1):12. PubMed ID: 32415350
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes.
    Shabbir A; Nadeem MF; Ovais A; Ashraf F; Nasir S
    Comb Chem High Throughput Screen; 2022; 25(3):500-509. PubMed ID: 33297913
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Genus Ranges of 4-Regular Rigid Vertex Graphs.
    Buck D; Dolzhenko E; Jonoska N; Saito M; Valencia K
    Electron J Comb; 2015; 22(3):. PubMed ID: 27807395
    [TBL] [Abstract][Full Text] [Related]  

  • 29. NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH.
    Linderman GC; Steinerberger S
    Math Comput; 2020; 89(324):1933-1952. PubMed ID: 33927452
    [TBL] [Abstract][Full Text] [Related]  

  • 30. On the super edge-magic deficiency of some graphs.
    Krisnawati VH; Ngurah AAG; Hidayat N; Alghofari AR
    Heliyon; 2020 Nov; 6(11):e05561. PubMed ID: 33294698
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Hamiltonian Paths Through Two- and Three-Dimensional Grids.
    Mitchell WF
    J Res Natl Inst Stand Technol; 2005; 110(2):127-36. PubMed ID: 27308109
    [TBL] [Abstract][Full Text] [Related]  

  • 33. DNA computing the Hamiltonian path problem.
    Lee CM; Kim SW; Kim SM; Sohn U
    Mol Cells; 1999 Oct; 9(5):464-9. PubMed ID: 10597033
    [TBL] [Abstract][Full Text] [Related]  

  • 34. The Connected
    Bai C; Zhou J; Liang Z
    Comput Intell Neurosci; 2021; 2021():3533623. PubMed ID: 34992643
    [TBL] [Abstract][Full Text] [Related]  

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

  • 36. On Vertex Covering Transversal Domination Number of Regular Graphs.
    Vasanthi R; Subramanian K
    ScientificWorldJournal; 2016; 2016():1029024. PubMed ID: 27119089
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Hamilton cycles and paths in fullerenes.
    Marusic D
    J Chem Inf Model; 2007; 47(3):732-6. PubMed ID: 17488067
    [TBL] [Abstract][Full Text] [Related]  

  • 38. The wiener index of the zero-divisor graph for a new class of residue class rings.
    Wei Y; Luo R
    Front Chem; 2022; 10():985001. PubMed ID: 36176890
    [TBL] [Abstract][Full Text] [Related]  

  • 39. The Steiner cycle and path cover problem on interval graphs.
    Ćustić A; Lendl S
    J Comb Optim; 2022; 43(1):226-234. PubMed ID: 35125930
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Subdivision of graphs in
    Wijaya K; Baskoro ET; Assiyatun H; Suprijanto D
    Heliyon; 2020 Jun; 6(6):e03843. PubMed ID: 32637673
    [TBL] [Abstract][Full Text] [Related]  

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