The space of feasible solutions in metabolic networks
暂无分享,去创建一个
[1] M. Mézard,et al. Survey propagation: An algorithm for satisfiability , 2005 .
[2] L. Khachiyan. Complexity of Polytope Volume Computation , 1993 .
[3] Martin E. Dyer,et al. On the Complexity of Computing the Volume of a Polyhedron , 1988, SIAM J. Comput..
[4] Bernhard O. Palsson,et al. On the dynamics of the irreversible Michaelis-Menten reaction mechanism , 1987 .
[5] D. Fell,et al. The small world of metabolism , 2000, Nature Biotechnology.
[6] R. Albert,et al. The large-scale organization of metabolic networks , 2000, Nature.
[7] Kiyoko F. Aoki-Kinoshita,et al. From genomics to chemical genomics: new developments in KEGG , 2005, Nucleic Acids Res..
[8] H. Qian,et al. Thermodynamic constraints for biochemical networks. , 2004, Journal of theoretical biology.
[9] B. Palsson,et al. Escherichia coli K-12 undergoes adaptive evolution to achieve in silico predicted optimal growth , 2002, Nature.
[10] O. Nicrosini,et al. Higher-order QED corrections to single-W production in electron–positron collisions , 2000, hep-ph/0005121.
[11] B. Palsson,et al. Metabolic capabilities of Escherichia coli: I. synthesis of biosynthetic precursors and cofactors. , 1993, Journal of theoretical biology.
[12] Komei Fukuda,et al. Exact volume computation for polytopes: a practical study , 1996 .
[13] H. J. Greenberg,et al. Monte Carlo sampling can be used to determine the size and shape of the steady-state flux space. , 2004, Journal of theoretical biology.
[14] M. Mézard,et al. The Cavity Method at Zero Temperature , 2002, cond-mat/0207121.
[15] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[16] David J. C. MacKay,et al. Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.
[17] R Monasson,et al. Von Neumann’s expanding model on random graphs , 2007, cond-mat/0703343.