Structure-Dynamics Relationships in Biological Networks
暂无分享,去创建一个
Matti Nykter | Ilya Shmulevich | Olli Yli-Harja | Juha Kesseli | Lauri Hahne | M. Nykter | I. Shmulevich | O. Yli-Harja | J. Kesseli | L. Hahne
[1] P. Cluzel,et al. A natural class of robust networks , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[2] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[3] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[4] Jack Heidel,et al. Random Boolean network model exhibiting deterministic chaos. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[5] B. Derrida,et al. Phase Transitions in Two-Dimensional Kauffman Cellular Automata , 1986 .
[6] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..
[7] I. Shmulevich,et al. Basin entropy in Boolean network ensembles. , 2007, Physical review letters.
[8] Stuart A. Kauffman,et al. The ensemble approach to understand genetic regulatory networks , 2004 .
[9] Stefan Bornholdt,et al. Topology of biological networks and reliability of information processing , 2004, Proceedings of the National Academy of Sciences of the United States of America.
[10] Nathan D. Price,et al. Set-based complexity and biological information , 2008, ArXiv.
[11] S. Kauffman,et al. Activities and sensitivities in boolean network models. , 2004, Physical review letters.
[12] Albert-László Barabási,et al. Linked: The New Science of Networks , 2002 .
[13] Ilya Shmulevich,et al. Critical networks exhibit maximal information diversity in structure-dynamics relationships. , 2008, Physical review letters.
[14] L. Hood,et al. Gene expression dynamics in the macrophage exhibit criticality , 2008, Proceedings of the National Academy of Sciences.
[15] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[16] O. Yli-Harja,et al. Stability of functions in Boolean models of gene regulatory networks. , 2005, Chaos.
[17] M. K. Ali,et al. Chaos in a Simple Boolean Network , 2001 .
[18] Nathan D. Price,et al. Biological Information as Set-Based Complexity , 2010, IEEE Transactions on Information Theory.
[19] Bin Ma,et al. The similarity metric , 2001, IEEE Transactions on Information Theory.
[20] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[21] P. Bourgine,et al. Topological and causal structure of the yeast transcriptional regulatory network , 2002, Nature Genetics.
[22] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.
[23] William I. Gasarch,et al. Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.
[24] Hod Lipson,et al. Networks, dynamics, and modularity. , 2004, Physical review letters.
[25] M. Gerstein,et al. Structure and evolution of transcriptional regulatory networks. , 2004, Current opinion in structural biology.
[26] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[27] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[28] Péter Gács,et al. Information Distance , 1998, IEEE Trans. Inf. Theory.
[29] Stuart A. Kauffman,et al. The origins of order , 1993 .
[30] Yigal D. Nochomovitz,et al. Highly designable phenotypes and mutational buffers emerge from a systematic mapping between network topology and dynamic output. , 2006, Proceedings of the National Academy of Sciences of the United States of America.
[31] B. Derrida,et al. Random networks of automata: a simple annealed approximation , 1986 .
[32] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[33] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[34] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[35] S. Kauffman. Metabolic stability and epigenesis in randomly constructed genetic nets. , 1969, Journal of theoretical biology.
[36] Paul M. B. Vitányi,et al. Clustering by compression , 2003, IEEE Transactions on Information Theory.
[37] Jerrold E. Marsden,et al. Perspectives and Problems in Nonlinear Science , 2003 .
[38] Pauli Rämö,et al. Iterated maps for annealed Boolean networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.
[39] Glen G. Langdon,et al. Arithmetic Coding , 1979 .
[40] Gregory J. Chaitin,et al. On the Length of Programs for Computing Finite Binary Sequences: statistical considerations , 1969, JACM.
[41] Ilya Shmulevich,et al. Entropy of complex relevant components of Boolean networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.
[42] M. Andrecut,et al. Mean field dynamics of random Boolean networks , 2005 .
[43] Jaakko Astola,et al. The role of certain Post classes in Boolean network models of genetic networks , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[44] L. Kadanoff,et al. Boolean Dynamics with Random Couplings , 2002, nlin/0204062.
[45] J. Barrow-Green. Poincare and the Three Body Problem , 1996 .