On Defining and Computing “Good” Conservation Laws
Conservation laws are a key-tool to study systems of chemical reactions in biology. We address the problem of defining and computing “good” sets of conservation laws. In this article, we chose to focus on sparsest sets of conservation laws. We present a greedy algorithm computing a sparsest set of conservation laws equivalent to a given set of conservation laws. Benchmarks over a subset of the curated models taken from the BioModels database are given.
Keywordsconservation analysis sparse conservation laws biological models sparse null space greedy algorithm
Unable to display preview. Download preview PDF.
- 1.Biomodels database, http://www.ebi.ac.uk/biomodels-main/publmodels (accessed June 16, 2014)
- 6.Granlund, T., the GMP development team: GNU MP: The GNU Multiple Precision Arithmetic Library, http://gmplib.org/
- 7.Lenstra, A.K., Lenstra, H.W., Lovász, L.: Factoring Polynomials with Rational Coefficients. Afdeling Informatica: IW. Mathematisch Centrum, Afdeling Informatica (1982)Google Scholar
- 8.Panteleev, M.A., Ovanesov, M.V., Kireev, D.A., Shibeko, A.M., Sinauridze, E.I., Ananyeva, N.M., Butylin, A.A., Saenko, E.L., Ataullakhanov, F.I.: Spatial propagation and localization of blood coagulation are regulated by intrinsic and protein c pathways, respectively. Biophysical Journal 90(5), 1489–1500 (2006)CrossRefGoogle Scholar
- 9.Roman, S.: Advanced Linear Algebra. Graduate Texts in Mathematics. Springer (2007)Google Scholar