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 *

115 related articles for article (PubMed ID: 38215388)

  • 1. Number of Attractors in the Critical Kauffman Model Is Exponential.
    Fink TMA; Sheldon FC
    Phys Rev Lett; 2023 Dec; 131(26):267402. PubMed ID: 38215388
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Superpolynomial growth in the number of attractors in Kauffman networks.
    Samuelsson B; Troein C
    Phys Rev Lett; 2003 Mar; 90(9):098701. PubMed ID: 12689263
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Dynamics of critical Kauffman networks under asynchronous stochastic update.
    Greil F; Drossel B
    Phys Rev Lett; 2005 Jul; 95(4):048701. PubMed ID: 16090847
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Number and length of attractors in a critical Kauffman model with connectivity one.
    Drossel B; Mihaljev T; Greil F
    Phys Rev Lett; 2005 Mar; 94(8):088701. PubMed ID: 15783941
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Stability of the Kauffman model.
    Bilke S; Sjunnesson F
    Phys Rev E Stat Nonlin Soft Matter Phys; 2002 Jan; 65(1 Pt 2):016129. PubMed ID: 11800758
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Counting and classifying attractors in high dimensional dynamical systems.
    Bagley RJ; Glass L
    J Theor Biol; 1996 Dec; 183(3):269-84. PubMed ID: 9015450
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Boolean dynamics of Kauffman models with a scale-free network.
    Iguchi K; Kinoshita S; Yamada HS
    J Theor Biol; 2007 Jul; 247(1):138-51. PubMed ID: 17408697
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Stable and unstable attractors in Boolean networks.
    Klemm K; Bornholdt S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Nov; 72(5 Pt 2):055101. PubMed ID: 16383673
    [TBL] [Abstract][Full Text] [Related]  

  • 9. An efficient algorithm for computing attractors of synchronous and asynchronous Boolean networks.
    Zheng D; Yang G; Li X; Wang Z; Liu F; He L
    PLoS One; 2013; 8(4):e60593. PubMed ID: 23585840
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Scaling in critical random Boolean networks.
    Kaufman V; Mihaljev T; Drossel B
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Oct; 72(4 Pt 2):046124. PubMed ID: 16383485
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Number of attractors in random Boolean networks.
    Drossel B
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jul; 72(1 Pt 2):016110. PubMed ID: 16090039
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Scaling in a general class of critical random Boolean networks.
    Mihaljev T; Drossel B
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 Oct; 74(4 Pt 2):046101. PubMed ID: 17155127
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Complexity of the predecessor problem in Kauffman networks.
    Coppersmith SN
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 May; 75(5 Pt 1):051108. PubMed ID: 17677023
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Random walk through a fertile site.
    Bauer M; Krapivsky PL; Mallick K
    Phys Rev E; 2021 Feb; 103(2-1):022114. PubMed ID: 33736009
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Robust Exponential Memory in Hopfield Networks.
    Hillar CJ; Tran NM
    J Math Neurosci; 2018 Jan; 8(1):1. PubMed ID: 29340803
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A numerical study of the critical line of Kauffman networks.
    Bastolla U; Parisi G
    J Theor Biol; 1997 Jul; 187(1):117-33. PubMed ID: 9236114
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications.
    Li XY; Yang GW; Zheng DS; Guo WS; Hung WN
    Genet Mol Res; 2015 Apr; 14(2):4238-44. PubMed ID: 25966195
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Comparative approximations of criticality in a neural and quantum regime.
    Bettinger JS
    Prog Biophys Mol Biol; 2017 Dec; 131():445-462. PubMed ID: 29031703
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Network capacity analysis for latent attractor computation.
    Doboli S; Minai AA
    Network; 2003 May; 14(2):273-302. PubMed ID: 12790185
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A REDUCTION METHOD FOR BOOLEAN NETWORK MODELS PROVEN TO CONSERVE ATTRACTORS.
    Saadatpour A; Albert R; Reluga TC
    SIAM J Appl Dyn Syst; 2013; 12(4):1997-2011. PubMed ID: 33132767
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.