Estimating the size of the solution space of metabolic networks
暂无分享,去创建一个
[1] David Avis,et al. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1991, SCG '91.
[2] 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.
[3] M. Mézard,et al. Analytic and Algorithmic Solution of Random Satisfiability Problems , 2002, Science.
[4] B. Palsson,et al. Metabolic capabilities of Escherichia coli: I. synthesis of biosynthetic precursors and cofactors. , 1993, Journal of theoretical biology.
[5] William T. Freeman,et al. Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology , 1999, Neural Computation.
[6] Dongxiao Zhu,et al. BMC Bioinformatics BioMed Central , 2005 .
[7] B. Palsson,et al. Candidate Metabolic Network States in Human Mitochondria , 2005, Journal of Biological Chemistry.
[8] X. Jin. Factor graphs and the Sum-Product Algorithm , 2002 .
[9] M. .. Moore. Exactly Solved Models in Statistical Mechanics , 1983 .
[10] Riccardo Zecchina,et al. Survey propagation: An algorithm for satisfiability , 2002, Random Struct. Algorithms.
[11] A. Barabasi,et al. Global organization of metabolic fluxes in the bacterium Escherichia coli , 2004, Nature.
[12] B. Palsson,et al. An expanded genome-scale model of Escherichia coli K-12 (iJR904 GSM/GPR) , 2003, Genome Biology.
[13] M. Mézard,et al. The Bethe lattice spin glass revisited , 2000, cond-mat/0009418.
[14] B. Palsson,et al. Uniform sampling of steady-state flux spaces: means to design experiments and to interpret enzymopathies. , 2004, Biophysical journal.
[15] B. Palsson,et al. Escherichia coli K-12 undergoes adaptive evolution to achieve in silico predicted optimal growth , 2002, Nature.
[16] R Monasson,et al. Von Neumann’s expanding model on random graphs , 2007, cond-mat/0703343.
[17] W. Freeman,et al. Generalized Belief Propagation , 2000, NIPS.
[18] G. Church,et al. Analysis of optimality in natural and perturbed metabolic networks , 2002 .
[19] Komei Fukuda,et al. Exact volume computation for polytopes: a practical study , 1996 .
[20] Riccardo Zecchina,et al. Coloring random graphs , 2002, Physical review letters.
[21] Riccardo Zecchina,et al. Viable flux distribution in metabolic networks , 2008, Networks Heterog. Media.
[22] H. Qian,et al. Thermodynamic constraints for biochemical networks. , 2004, Journal of theoretical biology.
[23] Martin E. Dyer,et al. On the Complexity of Computing the Volume of a Polyhedron , 1988, SIAM J. Comput..
[24] L. Khachiyan. Complexity of Polytope Volume Computation , 1993 .
[25] Bernhard Ø Palsson,et al. Candidate states of Helicobacter pylori's genome-scale metabolic network upon application of "loop law" thermodynamic constraints. , 2006, Biophysical journal.
[26] R. Albert,et al. The large-scale organization of metabolic networks , 2000, Nature.
[27] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[28] David J. C. MacKay,et al. Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.
[29] D. Fell,et al. The small world of metabolism , 2000, Nature Biotechnology.
[30] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[31] Miklós Simonovits,et al. How to compute the volume in high dimension? , 2003, Math. Program..
[32] Kiyoko F. Aoki-Kinoshita,et al. From genomics to chemical genomics: new developments in KEGG , 2005, Nucleic Acids Res..
[33] M. Mézard,et al. The Cavity Method at Zero Temperature , 2002, cond-mat/0207121.