arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.03483q-bio.MN
收藏

一种基因排序框架提高了在时间限制下的基因组规模约束代谢网络设计效率

A Gene Ranking Framework Enhances the Design Efficiency of Genome-Scale Constraint-Based Metabolic Networks under Time Limits

Bioinformatics Center, Institute for Chemical Research, Kyoto University(京都大学化学研究所生物信息中心);Graduate School of Informatics, Kyoto University(京都大学情报大学院)

Yier Ma, Takeyuki Tamura

AI总结:

本文提出了一种基因排序框架,通过加速混合整数线性规划问题的求解来提高基因组规模约束代谢网络设计的效率,该方法在相同时间内提升了成功率37%至186%。

摘要:

基因组规模约束代谢网络的设计已经稳步发展,越来越多的成功案例实现了生长耦合生产,其中关键代谢物的生物合成与细胞生长相关。然而,设计失败的主要原因是无法在现实时间内找到解决方案。因此,开发在指定计算时间内实现高成功率的方法至关重要。在本研究中,我们提出了一种用于排序单个基因重要性的框架,以加速约束模型设计中原始混合整数线性规划(MILP)问题的求解。在所提出的方法中,预分配高重要性基因的值后,MILPs被并行求解为一系列互斥的子问题。发现我们的框架能够恢复原始方法所识别的大多数成功案例,并在相同的时间限制内将成功率提高了37%至186%。对MILP求解过程的分析表明,所提出的方法减小了子问题的规模并减少了分支定界树中的节点数量。这种基因重要性排序框架可以直接应用于各种基于MILP的算法中,用于约束代谢网络的设计。开发的脚本可在https://github.com/MetNetComp/Gene-Ranked-RatGene上获取。

英文摘要:

The design of genome-scale constraint-based metabolic networks has steadily advanced, with an increasing number of successful cases achieving growth-coupled production, in which the biosynthesis of key metabolites is linked to cell growth. However, a major cause of design failures is the inability to find solutions within realistic time limits. Therefore, it is essential to develop methods that achieve a high success rate within the specified computation time. In this study, we propose a framework for ranking the importance of individual genes to accelerate the solution of the original mixed-integer linear programming (MILP) problems in the design of constraint-based models. In the proposed method, after pre-assigning values to highly important genes, the MILPs are solved in parallel as a series of mutually exclusive subproblems. It is found that our framework was able to recover most of the successful cases identified by the original approach and achieved a 37% to 186% increase in success rate compared to the original method within the same time limits. Analysis of the MILP solution process revealed that the proposed method reduced the sizes of subproblems and decreased the number of nodes in the branch-and-bound tree. This framework for ranking gene importance can be directly applicable to a range of MILP-based algorithms for the design of constraint-based metabolic networks. The developed scripts are available on \href{https://github.com/MetNetComp/Gene-Ranked-RatGene}{https://github.com/MetNetComp/Gene-Ranked-RatGene}.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑