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 *

150 related articles for article (PubMed ID: 27104292)

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

  • 2. The size of RNA as an ideal branched polymer.
    Fang LT; Gelbart WM; Ben-Shaul A
    J Chem Phys; 2011 Oct; 135(15):155105. PubMed ID: 22029339
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Common vertex matrix: a novel characterization of molecular graphs by counting.
    Randić M; Novič M; Plavšić D
    J Comput Chem; 2013 Jun; 34(16):1409-19. PubMed ID: 23619822
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Random graphs with arbitrary degree distributions and their applications.
    Newman ME; Strogatz SH; Watts DJ
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Aug; 64(2 Pt 2):026118. PubMed ID: 11497662
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Computer simulations of melts of randomly branching polymers.
    Rosa A; Everaers R
    J Chem Phys; 2016 Oct; 145(16):164906. PubMed ID: 27802612
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
    Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Dynamics of a semiflexible polymer or polymer ring in shear flow.
    Lang PS; Obermayer B; Frey E
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Feb; 89(2):022606. PubMed ID: 25353501
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Randomly branching θ-polymers in two and three dimensions: Average properties and distribution functions.
    Adroher-Benítez I; Rosa A
    J Chem Phys; 2020 Mar; 152(11):114903. PubMed ID: 32199437
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Fast Generation of Sparse Random Kernel Graphs.
    Hagberg A; Lemons N
    PLoS One; 2015; 10(9):e0135177. PubMed ID: 26356296
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Random line graphs and a linear law for assortativity.
    Liu D; Trajanovski S; Van Mieghem P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jan; 87(1):012816. PubMed ID: 23410397
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 15. The average distances in random graphs with given expected degrees.
    Chung F; Lu L
    Proc Natl Acad Sci U S A; 2002 Dec; 99(25):15879-82. PubMed ID: 12466502
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Seeing the results of a mutation with a vertex weighted hierarchical graph.
    Knisley DJ; Knisley JR
    BMC Proc; 2014; 8(Suppl 2 Proceedings of the 3rd Annual Symposium on Biologica):S7. PubMed ID: 25237394
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Statistical and Dynamical Properties of Topological Polymers with Graphs and Ring Polymers with Knots.
    Deguchi T; Uehara E
    Polymers (Basel); 2017 Jun; 9(7):. PubMed ID: 30970929
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Scaling laws of graphs of 3D protein structures.
    Pražnikar J
    J Bioinform Comput Biol; 2021 Jun; 19(3):2050050. PubMed ID: 33468031
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
    Azam NA; Shurbevski A; Nagamochi H
    Entropy (Basel); 2020 Aug; 22(9):. PubMed ID: 33286692
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Random sequential renormalization and agglomerative percolation in networks: application to Erdös-Rényi and scale-free graphs.
    Bizhani G; Grassberger P; Paczuski M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Dec; 84(6 Pt 2):066111. PubMed ID: 22304159
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.