Midford Peter E, Latendresse Mario, O'Maille Paul E, Karp Peter D
Bioinformatics Research Group, SRI, International, Menlo Park, CA 94025, USA.
Biocomplexity Sciences, SRI International, Menlo Park, CA 94025, USA.
Metabolites. 2019 May 2;9(5):88. doi: 10.3390/metabo9050088.
Interpreting changes in metabolite abundance in response to experimental treatments or disease states remains a major challenge in metabolomics. Pathway Covering is a new algorithm that takes a list of metabolites (compounds) and determines a minimum-cost set of metabolic pathways in an organism that includes (covers) all the metabolites in the list. We used five functions for assigning costs to pathways, including assigning a constant for all pathways, which yields a solution with the smallest pathway count; two methods that penalize large pathways; one that prefers pathways based on the pathway's assigned function, and one that loosely corresponds to metabolic flux. The pathway covering set computed by the algorithm can be displayed as a multi-pathway diagram ("pathway collage") that highlights the covered metabolites. We investigated the pathway covering algorithm by using several datasets from the Metabolomics Workbench. The algorithm is best applied to a list of metabolites with significant statistics and fold-changes with a specified direction of change for each metabolite. The pathway covering algorithm is now available within the Pathway Tools software and BioCyc website.
解读代谢物丰度随实验处理或疾病状态的变化仍是代谢组学中的一项重大挑战。通路覆盖是一种新算法,它接收一份代谢物(化合物)列表,并确定生物体中包含(覆盖)该列表中所有代谢物的最小成本代谢通路集。我们使用了五种为通路分配成本的函数,包括为所有通路分配一个常数,这会产生通路数量最少的解决方案;两种惩罚大型通路的方法;一种基于通路指定功能来选择通路的方法,以及一种大致对应于代谢通量的方法。通过该算法计算出的通路覆盖集可以显示为突出显示所覆盖代谢物的多通路图(“通路拼贴画”)。我们使用来自代谢组学工作台的几个数据集研究了通路覆盖算法。该算法最适用于具有显著统计学意义和倍数变化且每个代谢物具有指定变化方向的代谢物列表。通路覆盖算法现在可在通路工具软件和BioCyc网站上获取。