Computing knock-out strategies in metabolic networks

Journal of Computational Biology

Volumn 15, Issue 3, 2008, Pages 259-268

  Haus, Utz Uwe ^a   Klamt, Steffen ^b   Stephen, Tamon ^c  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b MAX PLANCK INSTITUTE FOR DYNAMICS OF COMPLEX TECHNICAL SYSTEMS   (Germany)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Algorithms; Elementary modes; Hypergraph transversal; Metabolic networks; Minimal cut sets

Indexed keywords

ALGORITHM; ARTICLE; GEOMETRY; METABOLISM; METABOLITE; MODEL; MOLECULAR BIOLOGY; PRIORITY JOURNAL;

ALGORITHMS; COMPUTATIONAL BIOLOGY; METABOLIC NETWORKS AND PATHWAYS;

EID: 41349112373     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2007.0229     Document Type: Article

References (24)

1. Ausiello, G., D'Atri, A., and Protasi, M. 1980. Structure preserving reductions among convex optimization problems. J. Comput. Syst. Sci. 21, 136-153.
2. Bailey, J., Manoukian, T., and Ramamohanarao, K. 2003. A fast algorithm for computing hypergraph transversals and its application in mining emerging patterns. Proc. 3rd IEEE ICDM 485-488.
3. Berge, C. 1989. Hypergraphs. Combinatorics of Finite Sets. North-Holland, Amsterdam.
4. Boros, E., Elbassioni, K., Gurvich, V., et al. 2006. An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation. Discrete Appl. Math. 154, 2350-2372.
5. Chierichetti, F., Lacroix, V., Marchetti-Spaccamela, A., et al. 2007. Modes and cuts in metabolic networks: complexity and algorithms. Technical Report 2007-01. Technische Universiteit Eindhoven, Eindhoven.
6. Eiter, T., Makino, K., and Gottlob, G. 2007. Computational aspects of monotone dualization: a brief survey. Discrete Appl. Math. DOI: 10.1016/j.dam.2006.04.017.
7. Fredman, M.L., and Khachiyan, L. 1996. On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21, 618-628.
8. Fukuda, K., and Prodon, A. 1996. Double description method revisited. Lect. Notes Comput. Sci. 1120, 91-111.
9. Gagneur, J., and Klamt, S. 2004. Computation of elementary modes: a unifying framework and the new binary approach. BMC Bioinform. 5:175.
10. Gurvich, V., and Khachiyan, L. 1999. On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Discrete Appl. Math. 96-97, 363-373.
11. Hagen, M. 2007. Lower bounds for three algorithms for the transversal hypergraph problem. 33rd Int. WG 2007, Lecture Notes in Computer Science 4769, Springer-Verlag, 316-327.
12. Haus, U.-U., Klamt, S., and Stephen, T. 2007. MATLAB code for hypergraph transversal. Available at: www.math.sfu.ca/∼tamon/Software/Berge/index. html. Accessed February 15, 2008.
13. ILOG. 1997-2007. CPLEX. Available at: www.ilog.com/products/cplex/. Accessed February 15, 2008.
14. Kavvadias, D., and Stavropoulos, E.C. 2005. An efficient algorithm for the transversal hypergraph generation. J. Graph Algorithms Appl. 9, 239-264.
15. Klamt, S. 2006. Generalized concept of minimal cut sets in biochemical networks. Biosystems 83, 233-247.
16. Klamt, S., Gagneur, J., and von Kamp, A. 2006a. Algorithmic approaches for computing elementary modes in large biochemical reaction networks. IEE Proc. Syst. Biol. 154, 249-255.
17. Klamt, S., and Gilles, E.D. 2004. Minimal cut sets in biochemical reaction networks. Bioinformatics 20, 226-234.
18. Klamt, S., Saez-Rodriguez, J., and Gilles, E.D. 2007. Structural and functional analysis of cellular networks with CellNetAnalyzer. BMC Syst. Biol. 1:2. [CellNetAnalyzer can be downloaded for free (academic use): www.mpi-magdeburg.mpg.de/projects/cna/cna.html].
19. Klamt, S., Saez-Rodriguez, J., Lindquist, J., et al. 2006b. A methodology for the structural and functional analysis of signaling and regulatory networks. BMC Bioinformatics 7:56.
20. Pritchard, P. 1995. A simple sub-quadratic algorithm for computing the subset partial order. Inform. Proc. Lett. 56, 337-341.
21. Pritchard, P. 1999. On computing the subset graph of a collection of sets. J. Algorithms 33, 187-203.
22. Schuster, S., Fell, D.A., and Dandekar, T. 2000. A general definition of metabolic pathways useful for systematic organization and analysis of complex metabolic network. Nat. Biotechnol. 18, 326-332.
23. Shen, H., and Evans, D.J. 1996. Fast sequential and parallel algorithms for finding extremal sets. Int. J. Comput. Math. 61, 195-211.
24. Stelling, J., Klamt, S., Bettenbrock, K., et al. 2002. Metabolic network structure determines key aspects of functionality and regulations. Nature 420, 190-193.