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 *

191 related articles for article (PubMed ID: 17930306)

  • 1. Graph animals, subgraph sampling, and motif search in large networks.
    Baskerville K; Grassberger P; Paczuski M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Sep; 76(3 Pt 2):036107. PubMed ID: 17930306
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Subgraph ensembles and motif discovery using an alternative heuristic for graph isomorphism.
    Baskerville K; Paczuski M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Nov; 74(5 Pt 1):051903. PubMed ID: 17279935
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Network motifs come in sets: correlations in the randomization process.
    Ginoza R; Mugler A
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Jul; 82(1 Pt 1):011921. PubMed ID: 20866662
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Subgraphs in random networks.
    Itzkovitz S; Milo R; Kashtan N; Ziv G; Alon U
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Aug; 68(2 Pt 2):026127. PubMed ID: 14525069
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks.
    He J; Wang C; Qiu K; Zhong W
    BMC Syst Biol; 2014; 8 Suppl 3(Suppl 3):S6. PubMed ID: 25350277
    [TBL] [Abstract][Full Text] [Related]  

  • 6. An algorithm for network motif discovery in biological networks.
    Qin G; Gao L
    Int J Data Min Bioinform; 2012; 6(1):1-16. PubMed ID: 22479815
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs.
    Kashtan N; Itzkovitz S; Milo R; Alon U
    Bioinformatics; 2004 Jul; 20(11):1746-58. PubMed ID: 15001476
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Detection of Complexes in Biological Networks Through Diversified Dense Subgraph Mining.
    Ma X; Zhou G; Shang J; Wang J; Peng J; Han J
    J Comput Biol; 2017 Sep; 24(9):923-941. PubMed ID: 28570104
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Subgraphs and network motifs in geometric networks.
    Itzkovitz S; Alon U
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Feb; 71(2 Pt 2):026117. PubMed ID: 15783388
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Link and subgraph likelihoods in random undirected networks with fixed and partially fixed degree sequences.
    Foster JG; Foster DV; Grassberger P; Paczuski M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Oct; 76(4 Pt 2):046112. PubMed ID: 17995065
    [TBL] [Abstract][Full Text] [Related]  

  • 11. k-Partite cliques of protein interactions: A novel subgraph topology for functional coherence analysis on PPI networks.
    Liu Q; Chen YP; Li J
    J Theor Biol; 2014 Jan; 340():146-54. PubMed ID: 24056214
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Robust subgraph counting with distribution-free random graph analysis.
    van Leeuwaarden JSH; Stegehuis C
    Phys Rev E; 2021 Oct; 104(4-1):044313. PubMed ID: 34781540
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A linear delay algorithm for enumerating all connected induced subgraphs.
    Alokshiya M; Salem S; Abed F
    BMC Bioinformatics; 2019 Jun; 20(Suppl 12):319. PubMed ID: 31216984
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks.
    Dondi R; Hosseinzadeh MM; Guzzi PH
    Appl Netw Sci; 2021; 6(1):40. PubMed ID: 34124340
    [TBL] [Abstract][Full Text] [Related]  

  • 15. MotifCut: regulatory motifs finding with maximum density subgraphs.
    Fratkin E; Naughton BT; Brutlag DL; Batzoglou S
    Bioinformatics; 2006 Jul; 22(14):e150-7. PubMed ID: 16873465
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Sampling Motif-Constrained Ensembles of Networks.
    Fischer R; Leitão JC; Peixoto TP; Altmann EG
    Phys Rev Lett; 2015 Oct; 115(18):188701. PubMed ID: 26565509
    [TBL] [Abstract][Full Text] [Related]  

  • 17. RASMA: a reverse search algorithm for mining maximal frequent subgraphs.
    Salem S; Alokshiya M; Hasan MA
    BioData Min; 2021 Mar; 14(1):19. PubMed ID: 33726790
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Atomic subgraphs and the statistical mechanics of networks.
    Wegner AE; Olhede S
    Phys Rev E; 2021 Apr; 103(4-1):042311. PubMed ID: 34005963
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs.
    Yoon S; Goltsev AV; Dorogovtsev SN; Mendes JF
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Oct; 84(4 Pt 1):041144. PubMed ID: 22181124
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Dissecting molecular network structures using a network subgraph approach.
    Huang CH; Zaenudin E; Tsai JJP; Kurubanjerdjit N; Dessie EY; Ng KL
    PeerJ; 2020; 8():e9556. PubMed ID: 33005483
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.