Abstract
AbstractMass 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 (MS2), 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.Keywordsmetabolomicscomputational mass spectrometrymultiple-stage mass spectrometryfragmentation treesInteger Linear Programming
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
