scholarly journals Gene Deletion Algorithms for Minimum Reaction Network Design by Mixed-integer Linear Programming for Metabolite Production in Constraint-based Models: gDel_minRN

Author(s):  
Takeyuki Tamura ◽  
Ai Muto-Fujita ◽  
Yukako Tohsato ◽  
Tomoyuki Kosaka

Abstract Background: Genome-scale constraint-based metabolic networks play an important role in the simulation of growth coupling, which means that cell growth and target metabolite production are simultaneously achieved. To achieve growth coupling, a minimal reaction-network-based design is known to be effective. However, the obtained reaction networks often fail to be realized by gene deletions due to conflicts with gene-protein-reaction relations.Results: Here, we developed gDel_minRN that determines gene deletion strategies using mixed-integer linear programming to achieve growth coupling by repressing the maximum number of reactions via gene-protein-reaction relations. Computational experiments were conducted in which gDel_minRN was applied to iML1515, a genome-scale model of Escherichia coli. The target metabolites were three vitamins that are highly valuable and require cost-effective bioprocesses for economics and the environment. gDel_minRN successfully calculated gene deletion strategies that achieve growth coupling for the production of biotin (vitamin B7), riboflavin (vitamin B2), and pantothenate (vitaminB5).Conclusion: Since gDel_minRN calculates a constraint-based model of the minimum number of gene-associated reactions without conflict with gene-protein-reaction relations, it helps biological analysis of the core parts essential for growth coupling for each target metabolite. The source codes are implemented in MATLAB, CPLEX, and COBRA Toolbox. The obtained data and source codes are available on https://github.com/taketam/gDel-minRN

Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 887
Author(s):  
Xianliang Cheng ◽  
Suzhen Feng ◽  
Yanxuan Huang ◽  
Jinwen Wang

Peak-shaving is a very efficient and practical strategy for a day-ahead hydropower scheduling in power systems, usually aiming to appropriately schedule hourly (or in less time interval) power generations of individual plants so as to smooth the load curve while enforcing the energy production target of each plant. Nowadays, the power marketization and booming development of renewable energy resources are complicating the constraints and diversifying the objectives, bringing challenges for the peak-shaving method to be more flexible and efficient. Without a pre-set or fixed peak-shaving order of plants, this paper formulates a new peak-shaving model based on the mixed integer linear programming (MILP) to solve the scheduling problem in an optimization way. Compared with the traditional peak-shaving methods that need to determine the order of plants to peak-shave the load curve one by one, the present model has better flexibility as it can handle the plant-based operating zones and prioritize the constraints and objectives more easily. With application to six cascaded hydropower reservoirs on the Lancang River in China, the model is tested efficient and practical in engineering perspective.


Sign in / Sign up

Export Citation Format

Share Document