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 *

844 related articles for article (PubMed ID: 23955387)

  • 21. An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures.
    Jain S; Saju S; Petingi L; Schlick T
    Methods; 2019 Jun; 162-163():74-84. PubMed ID: 30928508
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Building k-connected neighborhood graphs for isometric data embedding.
    Yang L
    IEEE Trans Pattern Anal Mach Intell; 2006 May; 28(5):827-31. PubMed ID: 16640268
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Clone temporal centrality measures for incomplete sequences of graph snapshots.
    Hanke M; Foraita R
    BMC Bioinformatics; 2017 May; 18(1):261. PubMed ID: 28511665
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Maximal unicyclic graphs with respect to new atom-bond connectivity index.
    Das KCh; Xu K; Graovac A
    Acta Chim Slov; 2013; 60(1):34-42. PubMed ID: 23841330
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Relating Vertex and Global Graph Entropy in Randomly Generated Graphs.
    Tee P; Parisis G; Berthouze L; Wakeman I
    Entropy (Basel); 2018 Jun; 20(7):. PubMed ID: 33265571
    [TBL] [Abstract][Full Text] [Related]  

  • 26. On the Extremal Wiener Polarity Index of Hückel Graphs.
    Wang H
    Comput Math Methods Med; 2016; 2016():3873597. PubMed ID: 27247613
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Cyclic connectivity index of fuzzy incidence graphs with applications in the highway system of different cities to minimize road accidents and in a network of different computers.
    Nazeer I; Rashid T; Hussain MT
    PLoS One; 2021; 16(9):e0257642. PubMed ID: 34547043
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Are randomly grown graphs really random?
    Callaway DS; Hopcroft JE; Kleinberg JM; Newman ME; Strogatz SH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Oct; 64(4 Pt 1):041902. PubMed ID: 11690047
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Vertex Deletion into Bipartite Permutation Graphs.
    Bożyk Ł; Derbisz J; Krawczyk T; Novotná J; Okrasa K
    Algorithmica; 2022; 84(8):2271-2291. PubMed ID: 35880199
    [TBL] [Abstract][Full Text] [Related]  

  • 30. On Divided-Type Connectivity of Graphs.
    Zhou Q; Wang X; Yao B
    Entropy (Basel); 2023 Jan; 25(1):. PubMed ID: 36673317
    [TBL] [Abstract][Full Text] [Related]  

  • 31. On sum-connectivity matrix and sum-connectivity energy of (molecular) graphs.
    Zhou B; Trinajstić N
    Acta Chim Slov; 2010 Sep; 57(3):518-23. PubMed ID: 24061795
    [TBL] [Abstract][Full Text] [Related]  

  • 32. The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures.
    Gao W; Wang W
    Comput Math Methods Med; 2015; 2015():418106. PubMed ID: 26640513
    [TBL] [Abstract][Full Text] [Related]  

  • 33. A selection rule for molecular conduction.
    Fowler PW; Pickup BT; Todorova TZ; Myrvold W
    J Chem Phys; 2009 Jul; 131(4):044104. PubMed ID: 19655834
    [TBL] [Abstract][Full Text] [Related]  

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

  • 35. Sequence Alignment on Directed Graphs.
    Kavya VNS; Tayal K; Srinivasan R; Sivadasan N
    J Comput Biol; 2019 Jan; 26(1):53-67. PubMed ID: 30204489
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Bond topology of chain, ribbon and tube silicates. Part II. Geometrical analysis of infinite 1D arrangements of (TO
    Day MC; Hawthorne FC; Rostami A
    Acta Crystallogr A Found Adv; 2024 May; 80(Pt 3):258-281. PubMed ID: 38683645
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Querying large graphs in biomedicine with colored graphs and decomposition.
    Chou CH; Sheu P; Hayakawa M; Kitazawa A
    J Biomed Inform; 2020 Aug; 108():103503. PubMed ID: 32682828
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Robustness of random graphs based on graph spectra.
    Wu J; Barahona M; Tan YJ; Deng HZ
    Chaos; 2012 Dec; 22(4):043101. PubMed ID: 23278036
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Relative timing information and orthology in evolutionary scenarios.
    Schaller D; Hartmann T; Lafond M; Stadler PF; Wieseke N; Hellmuth M
    Algorithms Mol Biol; 2023 Nov; 18(1):16. PubMed ID: 37940998
    [TBL] [Abstract][Full Text] [Related]  

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