Reliable and efficient solution of genome-scale models of Metabolism and macromolecular Expression

Scientific Reports

Volumn 7, Issue , 2017, Pages

  Ma, Ding ^a   Yang, Laurence ^b   Fleming, Ronan M T ^c   Thiele, Ines ^c   Palsson, Bernhard O ^b,d   Saunders, Michael A ^a  

^a Stanford University   (United States)

^b UNIVERSITY OF CALIFORNIA SAN DIEGO   (United States)

^c UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^d Chalmers University of Technology   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; BIOLOGICAL MODEL; GENOME; PROCEDURES; SYSTEMS BIOLOGY;

ALGORITHMS; GENOME; MODELS, GENETIC; SYSTEMS BIOLOGY;

EID: 85010036575     PISSN: None     EISSN: 20452322     Source Type: Journal    
DOI: 10.1038/srep40863     Document Type: Article

References (53)

1. Palsson, B. O. Systems Biology: Properties of Reconstructed Networks (Cambridge University Press, NY, 2006).
2. Schellenberger, J. et al. Quantitative prediction of cellular metabolism with constraint-based models: the COBRA Toolbox v2.0. Nature Protocols 6, 1290-1307 (2011).
3. Ebrahim, A., Lerman, J. A., Palsson, B. O. & Hyduke, D. R. COBRApy: COnstraints-Based Reconstruction and Analysis for Python. BMC Syst Biol 7, 74 (2013).
4. Gurobi optimization system for linear and integer programming (2014). URL http://www.gurobi.com (Date of access: 01/02/2016).
5. IBM ILOG CPLEX optimizer (2014). URL http://www.ibm.com/software/commerce/optimization/cplex-optimizer/ (Date of access: 27/04/2014).
6. MOSEK Optimization Software (2014). URL http://www.mosek.com/ (Date of access: 27/04/2014).
7. Thiele, I., Jamshidi, N., Fleming, R. M. T. & Palsson, B. O. Genome-scale reconstruction of E. coli's transcriptional and translational machinery: A knowledge-base, its mathematical formulation, and its functional characterization. PLoS Comput Biol 5, e1000312 (2009).
8. Thiele, I., Fleming, R. M. T., Bordbar, A., Que, R. & Palsson, B. O. A systems biology approach to the evolution of codon use pattern. Nature Precedings (2011). URL http://dx.doi.org/10.1038/npre.2011.6312.1 (Date of access: 13/10/2016).
9. Fourer, R. Solving staircase linear programs by the simplex method, 1: Inversion. Math. Program. 23, 274-313 (1982).
10. Tomlin, J. A. On scaling linear programming problems. In Computational Practice in Mathematical Programming, vol. 4 of Mathematical Programming Studies 146-166 (Springer, 1975).
11. Sun, Y., Fleming, R. M. T., Thiele, I. & Saunders, M. A. Robust flux balance analysis of multiscale biochemical reaction networks. BMC Bioinformatics 14 (2013).
12. Dhiflaoui, M. et al. Certifying and repairing solutions to large LPs: How good are LP-solvers? In Proceedings of the 14th annual ACM-SIAM Symposium on Discrete Algorithms (SODA '03) 255-256 (Baltimore, MD, 2003).
13. Applegate, D. L., Cook, W., Dash, S. & Espinoza, D. G. Exact solutions to linear programming problems. Operations Res. Lett. 35, 693-699 (2007).
14. Applegate, D., Cook, W., Dash, S. & Mevnkamp, M. QSopt-ex: A simplex solver for computing exact rational solutions to LP problems (2008). URL http://www.math.uwaterloo.ca/ bico/qsopt/ex (Date of access: 13/10/2016).
15. Lerman, J. A. et al. In silico method for modelling metabolism and gene product expression at genome scale. Nat. Commun. 3, 10 pp (2012).
16. Chindelevitch, L., Trigg, J., Regev, A. & Berger, B. An exact arithmetic toolbox for a consistent and reproducible structural analysis of metabolic network models. Nat. Commun. 5, 9 pp (2014).
17. Gleixner, A. M., Steffy, D. E. & Wolter, K. Improving the accuracy of linear programming solvers with iterative refinement. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 187-194 (Grenoble, 2012).
18. Gleixner, A. M., Steffy, D. E. & Wolter, K. Iterative refinement for linear programming. ZIB Report 15-15, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, Germany (May 2015).
19. Gleixner, A. M. Exact and Fast Algorithms for Mixed-Integer Nonlinear Programming. Ph.D. thesis, Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB), Technical University of Berlin (2015).
20. Gleixner, A. M., Steffy, D. E. & Wolter, K. Iterative refinement for linear programming. INFORMS J. Computing 28, 449-464 (2016).
21. Kahan, W. Desperately needed remedies for the undebuggability of large floating-point computations in science and engineering. IFIP/SIAM/NIST Working Conference on Uncertainty Quantification in Scientific Computing, Boulder CO (2011). URL http:// www.eecs.berkeley.edu/wkahan/Boulder.pdf (Date of access: 16/12/2013).
22. Murtagh, B. A. & Saunders, M. A. Large-scale linearly constrained optimization. Math. Program. 14, 41-72 (1978).
23. Murtagh, B. A. & Saunders, M. A. A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints. Math. Program. Study 16, 84-117 (1982).
24. UCSD Systems Biology Research Group. Available predictive genome-scale metabolic network reconstructions (2015). URL http:// systemsbiology.ucsd.edu/InSilicoOrganisms/OtherOrganisms (Date of access: 03/05/2016).
25. Multiscale systems biology collaboration (2016). URL http://stanford.edu/group/SOL/multiscale/models.html (Date of access: 13/09/2016).
26. King, Z. A. et al. BiGG Models: A platform for integrating, standardizing, and sharing genome-scale models. Nucl. Acids Res. 44, D515-522 (2016).
27. Thiele, I. et al. Multiscale modeling of metabolism and macromolecular synthesis in E. coli and its application to the evolution of codon usage. PLOS ONE 7, 18 pp (2012).
28. Wunderling, R. Paralleler und objektorientierter Simplex-Algorithmus. Ph.D. thesis, Technische Universität Berlin (1996).
29. Soplex: The sequential object-oriented simplex solver (2016). URL http://soplex.zib.de. (Date of access: 16/06/2016).
30. Ma, D. & Saunders, M. A. Solving multiscale linear programs using the simplex method in quadruple precision. In Al-Baali, M., Grandinetti, L. & Purnama, A. (eds) Numerical Analysis and Optimization, NAO-III, Muscat, Oman, January 2014, vol. 134 of Springer Proceedings in Mathematics and Statistics (Springer International Publishing Switzerland, 2015).
31. Gill, P. E., Murray, W., Saunders, M. A. & Wright, M. H. A practical anti-cycling procedure for linear and nonlinear programming. Math. Program. 45, 437-474 (1989).
32. Ebrahim, A. Generation of 83 models from UCSD repository (2015). URL https://github.com/opencobra/m-model-collection/ blob/master/load-models.ipynb (Date of access: 10/06/2016).
33. Ebrahim, A. Solution of 83 models from UCSD repository (2015). URL https://github.com/opencobra/m-model-collection/blob/ master/exact-solving-models.ipynb. (Date of access: 10/06/2016).
34. Feist, A. M. et al. A genome-scale metabolic reconstruction for Escherichia coli K-12 MG1655 that accounts for 1260 ORFs and thermodynamic information. Mol Syst Biol 3, e121 (2007). URL http://www.hubmed.org/display.cgi?uids= 17593909 (Date of access: 05/03/2016).
35. Thiele, I., Fleming, R. M. T., Bordbar, A., Schellenberger, J. & Palsson, B. O. Functional characterization of alternate optimal solutions of Escherichia coli's transcriptional and translational machinery. Biophysical J 98, 2072-2081 (2010).
36. TOMLAB optimization environment for Matlab (2015). URL http://tomopt.com (Date of access: 03/05/2016).
37. NEOS server for optimization (2016). URL http://www.neos-server.org/neos/ (Date of access: 02/01/2016).
38. Koch, T. The final Netlib-LP results. Operations Research Letters 32, 138-142 (2004).
39. FICO Xpress Optimization Suite (2015). URL http://www.fico.com/en/products/fico-xpress-optimization-suite/ (Date of access: 27/04/2014).
40. Fleming, R. M. T., Vlassis, N., Thiele, I. & Saunders, M. A. Conditions for duality between fluxes and concentrations in biochemical networks. J. Theoretical Biology 409, 1-10 (2016).
41. Orth, J. D., Thiele, I. & Palsson, B. O. What is flux balance analysis? Nature Biotechnology 28, 245-248 (2010).
42. Gudmundsson, S. & Thiele, I. Computationally efficient flux variability analysis. BMC Bioinformatics 11 (2010).
43. Dattorro, J. Convex Optimization & Euclidean Distance Geometry (Meboo Publishing USA, 2015). V2015.09.29, pp 208-214.
44. Yang, L. et al. solveME: fast and reliable solution of nonlinear ME models. BMC Bioinformatics 17 (2016).
45. Input format for LP data (1960). URL http://lpsolve.sourceforge.net/5.5/mps-format.htm (Date of access: 27/04/2014).
46. Netlib collection of LP problems in MPS format (1988). URL http://www.netlib.org/lp/data. (Date of access: 27/04/2014).
47. Mészáros, C. A collection of challenging LP problems (2004). URL http://www.sztaki.hu/meszaros/public-ftp/lptestset/problematic (Date of access: 19/03/2014).
48. Fletcher, R. On Wolfe's method for resolving degeneracy in linearly constrained optimization. SIAM J. Optim. 24, 1122-1137 (2014).
49. Forrest, J. J. & Goldfarb, D. Steepest-edge simplex algorithms for linear programming. Math. Program. 57, 341-374 (1992).
50. O'Brien, E. J., Lerman, J. A., Chang, R. L., Hyduke, D. R. & Palsson, B. O. Genome-scale models of metabolism and gene expression extend and refine growth phenotype prediction. Mol Syst Biol 9, 693 (2013).
51. Wilkinson, J. H. The Algebraic Eigenvalue Problem (Oxford University Press, 1965).
52. Saunders, M. A. & Tenenblat, L. The Zoom strategy for accelerating and warm-starting interior methods. Talk at INFORMS Annual Meeting, Pittsburgh, PA, USA (2006). URL http://stanford.edu/group/SOL/talks/saunders-tenenblat-INFORMS2006.pdf (Date of access: 10/06/2016).
53. Gill, P. E., Murray, W. & Saunders, M. A. SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Review 47, 99-131 (2005). SIGEST article.