An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm

Abstract The identification of chemical structures in natural product mixtures is an important task in drug discovery but is still a challenging problem, as structural elucidation is a time-consuming process and is limited by the available mass spectra of known natural products. Computer-aided struc...

Full description

Bibliographic Details
Main Authors: Bo-Han Su, Meng-Yu Shen, Yeu-Chern Harn, San-Yuan Wang, Alioune Schurz, Chieh Lin, Olivia A. Lin, Yufeng J. Tseng
Format: Article
Language:English
Published: BMC 2017-11-01
Series:Journal of Cheminformatics
Subjects:
Online Access:http://link.springer.com/article/10.1186/s13321-017-0244-9
id doaj-4fc1c0c60efd42d588280902d661128c
record_format Article
spelling doaj-4fc1c0c60efd42d588280902d661128c2020-11-24T20:53:22ZengBMCJournal of Cheminformatics1758-29462017-11-019111510.1186/s13321-017-0244-9An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithmBo-Han Su0Meng-Yu Shen1Yeu-Chern Harn2San-Yuan Wang3Alioune Schurz4Chieh Lin5Olivia A. Lin6Yufeng J. Tseng7Department of Computer Science and Information Engineering, National Taiwan UniversityDepartment of Computer Science and Information Engineering, National Taiwan UniversityGraduate Institute of Networking and Multimedia, National Taiwan UniversityDepartment of Computer Science and Information Engineering, National Taiwan UniversityGraduate Institute of Biomedical Electronics and Bioinformatics, National Taiwan UniversityDepartment of Computer Science and Information Engineering, National Taiwan UniversityGraduate Institute of Biomedical Electronics and Bioinformatics, National Taiwan UniversityDepartment of Computer Science and Information Engineering, National Taiwan UniversityAbstract The identification of chemical structures in natural product mixtures is an important task in drug discovery but is still a challenging problem, as structural elucidation is a time-consuming process and is limited by the available mass spectra of known natural products. Computer-aided structure elucidation (CASE) strategies seek to automatically propose a list of possible chemical structures in mixtures by utilizing chromatographic and spectroscopic methods. However, current CASE tools still cannot automatically solve structures for experienced natural product chemists. Here, we formulated the structural elucidation of natural products in a mixture as a computational problem by extending a list of scaffolds using a weighted side chain list after analyzing a collection of 243,130 natural products and designed an efficient algorithm to precisely identify the chemical structures. The complexity of such a problem is NP-complete. A dynamic programming (DP) algorithm can solve this NP-complete problem in pseudo-polynomial time after converting floating point molecular weights into integers. However, the running time of the DP algorithm degrades exponentially as the precision of the mass spectrometry experiment grows. To ideally solve in polynomial time, we proposed a novel iterative DP algorithm that can quickly recognize the chemical structures of natural products. By utilizing this algorithm to elucidate the structures of four natural products that were experimentally and structurally determined, the algorithm can search the exact solutions, and the time performance was shown to be in polynomial time for average cases. The proposed method improved the speed of the structural elucidation of natural products and helped broaden the spectrum of available compounds that could be applied as new drug candidates. A web service built for structural elucidation studies is freely accessible via the following link ( http://csccp.cmdm.tw/ ).http://link.springer.com/article/10.1186/s13321-017-0244-9CASENatural productsDynamic programmingPolynomial time
collection DOAJ
language English
format Article
sources DOAJ
author Bo-Han Su
Meng-Yu Shen
Yeu-Chern Harn
San-Yuan Wang
Alioune Schurz
Chieh Lin
Olivia A. Lin
Yufeng J. Tseng
spellingShingle Bo-Han Su
Meng-Yu Shen
Yeu-Chern Harn
San-Yuan Wang
Alioune Schurz
Chieh Lin
Olivia A. Lin
Yufeng J. Tseng
An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm
Journal of Cheminformatics
CASE
Natural products
Dynamic programming
Polynomial time
author_facet Bo-Han Su
Meng-Yu Shen
Yeu-Chern Harn
San-Yuan Wang
Alioune Schurz
Chieh Lin
Olivia A. Lin
Yufeng J. Tseng
author_sort Bo-Han Su
title An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm
title_short An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm
title_full An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm
title_fullStr An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm
title_full_unstemmed An efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm
title_sort efficient computer-aided structural elucidation strategy for mixtures using an iterative dynamic programming algorithm
publisher BMC
series Journal of Cheminformatics
issn 1758-2946
publishDate 2017-11-01
description Abstract The identification of chemical structures in natural product mixtures is an important task in drug discovery but is still a challenging problem, as structural elucidation is a time-consuming process and is limited by the available mass spectra of known natural products. Computer-aided structure elucidation (CASE) strategies seek to automatically propose a list of possible chemical structures in mixtures by utilizing chromatographic and spectroscopic methods. However, current CASE tools still cannot automatically solve structures for experienced natural product chemists. Here, we formulated the structural elucidation of natural products in a mixture as a computational problem by extending a list of scaffolds using a weighted side chain list after analyzing a collection of 243,130 natural products and designed an efficient algorithm to precisely identify the chemical structures. The complexity of such a problem is NP-complete. A dynamic programming (DP) algorithm can solve this NP-complete problem in pseudo-polynomial time after converting floating point molecular weights into integers. However, the running time of the DP algorithm degrades exponentially as the precision of the mass spectrometry experiment grows. To ideally solve in polynomial time, we proposed a novel iterative DP algorithm that can quickly recognize the chemical structures of natural products. By utilizing this algorithm to elucidate the structures of four natural products that were experimentally and structurally determined, the algorithm can search the exact solutions, and the time performance was shown to be in polynomial time for average cases. The proposed method improved the speed of the structural elucidation of natural products and helped broaden the spectrum of available compounds that could be applied as new drug candidates. A web service built for structural elucidation studies is freely accessible via the following link ( http://csccp.cmdm.tw/ ).
topic CASE
Natural products
Dynamic programming
Polynomial time
url http://link.springer.com/article/10.1186/s13321-017-0244-9
work_keys_str_mv AT bohansu anefficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT mengyushen anefficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT yeuchernharn anefficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT sanyuanwang anefficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT aliouneschurz anefficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT chiehlin anefficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT oliviaalin anefficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT yufengjtseng anefficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT bohansu efficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT mengyushen efficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT yeuchernharn efficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT sanyuanwang efficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT aliouneschurz efficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT chiehlin efficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT oliviaalin efficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
AT yufengjtseng efficientcomputeraidedstructuralelucidationstrategyformixturesusinganiterativedynamicprogrammingalgorithm
_version_ 1716797238207840256