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 *

159 related articles for article (PubMed ID: 23514240)

  • 1. The conduciveness of CA-rule graphs.
    Barbosa VC
    Artif Life; 2013; 19(2):255-66. PubMed ID: 23514240
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Network conduciveness with application to the graph-coloring and independent-set optimization transitions.
    Barbosa VC
    PLoS One; 2010 Jul; 5(7):e11232. PubMed ID: 20628597
    [TBL] [Abstract][Full Text] [Related]  

  • 3. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Fast rule identification and neighborhood selection for cellular automata.
    Sun X; Rosin PL; Martin RR
    IEEE Trans Syst Man Cybern B Cybern; 2011 Jun; 41(3):749-60. PubMed ID: 21134817
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Network of evolutionary processors with splicing rules and permitting context.
    Choudhary A; Krithivasan K
    Biosystems; 2007 Feb; 87(2-3):111-6. PubMed ID: 17045388
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. Efficient rewirings for enhancing synchronizability of dynamical networks.
    Rad AA; Jalili M; Hasler M
    Chaos; 2008 Sep; 18(3):037104. PubMed ID: 19045478
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Searching for nodes in random graphs.
    Lancaster D
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Nov; 84(5 Pt 2):056107. PubMed ID: 22181473
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Generating symmetric graphs.
    Klickstein I; Sorrentino F
    Chaos; 2018 Dec; 28(12):121102. PubMed ID: 30599516
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Random graph models for directed acyclic networks.
    Karrer B; Newman ME
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Oct; 80(4 Pt 2):046110. PubMed ID: 19905393
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Biological applications of knowledge graph embedding models.
    Mohamed SK; Nounu A; Nováček V
    Brief Bioinform; 2021 Mar; 22(2):1679-1693. PubMed ID: 32065227
    [TBL] [Abstract][Full Text] [Related]  

  • 12. The evolution of helping and harming on graphs: the return of the inclusive fitness effect.
    Lehmann L; Keller L; Sumpter DJ
    J Evol Biol; 2007 Nov; 20(6):2284-95. PubMed ID: 17956391
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Training similarity measures for specific activities: application to reduced graphs.
    Birchall K; Gillet VJ; Harper G; Pickett SD
    J Chem Inf Model; 2006; 46(2):577-86. PubMed ID: 16562986
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Combining hierarchy and energy for drawing directed graphs.
    Carmel L; Harel D; Koren Y
    IEEE Trans Vis Comput Graph; 2004; 10(1):46-57. PubMed ID: 15382697
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Perceptual organization in user-generated graph layouts.
    van Ham F; Rogowitz BE
    IEEE Trans Vis Comput Graph; 2008; 14(6):1333-9. PubMed ID: 18988981
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Visual exploration of complex time-varying graphs.
    Kumar G; Garland M
    IEEE Trans Vis Comput Graph; 2006; 12(5):805-12. PubMed ID: 17080803
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Multi-way association extraction and visualization from biological text documents using hyper-graphs: applications to genetic association studies for diseases.
    Mukhopadhyay S; Palakal M; Maddu K
    Artif Intell Med; 2010 Jul; 49(3):145-54. PubMed ID: 20382004
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Intrinsic graph structure estimation using graph Laplacian.
    Noda A; Hino H; Tatsuno M; Akaho S; Murata N
    Neural Comput; 2014 Jul; 26(7):1455-83. PubMed ID: 24708372
    [TBL] [Abstract][Full Text] [Related]  

  • 20. GrouseFlocks: steerable exploration of graph hierarchy space.
    Archambault D; Munzner T; Auber D
    IEEE Trans Vis Comput Graph; 2008; 14(4):900-13. PubMed ID: 18467763
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.