Journal
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS
Volume 10, Issue 5, Pages 1329-1333Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TCBB.2013.116
Keywords
Elementary mode analysis; minimal cut sets; gene knockout; bit pattern; tree code
Categories
Funding
- Federal Ministry of Economy, Family and Youth (bmwfj)
- Federal Ministry of Traffic, Innovation and Technology (bmvit)
- Styrian Business Promotion Agency SFG
- Standortagentur Tirol
- ZIT-Technology Agency of the City of Vienna through the COMET-Funding Program
Ask authors/readers for more resources
Minimal cut sets are a valuable tool for analyzing metabolic networks and for identifying optimal gene intervention strategies by eliminating unwanted metabolic functions and keeping desired functionality. Minimal cut sets rely on the concept of elementary flux modes, which are sets of indivisible metabolic pathways under steady-state condition. However, the computation of minimal cut sets is nontrivial, as even medium-sized metabolic networks with just 100 reactions easily have several hundred million elementary flux modes. We developed a minimal cut set tool that implements the well-known Berge algorithm and utilizes a novel approach to significantly reduce the program runtime by using binary bit pattern trees. By using the introduced tree approach, the size of metabolic models that can be analyzed and optimized by minimal cut sets is pushed to new and considerably higher limits.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available