Multiple Mass Spectrometry Fragmentation Trees Revisited: Boosting Performance and Quality.

ALGORITHMS IN BIOINFORMATICS(2014)

引用 4|浏览22
暂无评分
摘要
Mass spectrometry (MS) in combination with a fragmentation technique is the method of choice for analyzing small molecules in high throughput experiments. The automated interpretation of such data is highly non-trivial. Recently, fragmentation trees have been introduced for de novo analysis of tandem fragmentation spectra (MS 2), describing the fragmentation process of the molecule. Multiple-stage MS (MSn) reveals additional information about the dependencies between fragments. Unfortunately, the computational analysis of MSn data using fragmentation trees turns out to be more challenging than for tandem mass spectra. We present an Integer Linear Program for solving the Combined Colorful Subtree problem, which is orders of magnitude faster than the currently best algorithm which is based on dynamic programming. Using the new algorithm, we show that correlation between structural similarity and fragmentation tree similarity increases when using the additional information gained from MSn. Thus, we show for the first time that using MSn data can improve the quality of fragmentation trees.
更多
查看译文
关键词
metabolomics,computational mass spectrometry,multiple-stage mass spectrometry,fragmentation trees,Integer Linear Programming
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要