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 *

201 related articles for article (PubMed ID: 26356296)

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

  • 2. Spectra of "real-world" graphs: beyond the semicircle law.
    Farkas IJ; Derényi I; Barabási AL; Vicsek T
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Aug; 64(2 Pt 2):026704. PubMed ID: 11497741
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 6. Context-Dependent Random Walk Graph Kernels and Tree Pattern Graph Matching Kernels with Applications to Action Recognition.
    Hu W; Wu B; Wang P; Yuan C; Li Y; Maybank S
    IEEE Trans Image Process; 2018 Jun; ():. PubMed ID: 29994476
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Classifying Dissemination Processes in Temporal Graphs.
    Oettershagen L; Kriege NM; Morris C; Mutzel P
    Big Data; 2020 Oct; 8(5):363-378. PubMed ID: 33090027
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Novel kernels for error-tolerant graph classification.
    Neuhaus M; Riesen K; Bunke H
    Spat Vis; 2009; 22(5):425-41. PubMed ID: 19814905
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Network robustness and fragility: percolation on random graphs.
    Callaway DS; Newman ME; Strogatz SH; Watts DJ
    Phys Rev Lett; 2000 Dec; 85(25):5468-71. PubMed ID: 11136023
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Sensible method for updating motif instances in an increased biological network.
    Kim WY; Kurmar S
    Methods; 2015 Jul; 83():71-9. PubMed ID: 25869675
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Sparse random feature maps for the item-multiset kernel.
    Atarashi K; Oyama S; Kurihara M
    Neural Netw; 2021 Nov; 143():500-514. PubMed ID: 34280609
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data.
    Bhadra S; Bhattacharyya C; Chandra NR; Mian IS
    Algorithms Mol Biol; 2009 Feb; 4():5. PubMed ID: 19239685
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Synchronization in power-law networks.
    Kocarev L; Amato P
    Chaos; 2005 Jun; 15(2):24101. PubMed ID: 16035901
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Random acyclic networks.
    Karrer B; Newman ME
    Phys Rev Lett; 2009 Mar; 102(12):128701. PubMed ID: 19392330
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. Bias in generation of random graphs.
    Klein-Hennig H; Hartmann AK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Feb; 85(2 Pt 2):026101. PubMed ID: 22463273
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Neighborhood Preserving Kernels for Attributed Graphs.
    Salim A; Shiju SS; Sumitra S
    IEEE Trans Pattern Anal Mach Intell; 2023 Jan; 45(1):828-840. PubMed ID: 35041594
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
    Del Genio CI; Kim H; Toroczkai Z; Bassler KE
    PLoS One; 2010 Apr; 5(4):e10012. PubMed ID: 20386694
    [TBL] [Abstract][Full Text] [Related]  

  • 20. On Edge Exchangeable Random Graphs.
    Janson S
    J Stat Phys; 2018; 173(3):448-484. PubMed ID: 30930480
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.