Abstract
Ion mobility spectrometry (IMS), as a promising analytical tool, has been widely employed in the structural characterization of biomolecules. Nevertheless, the inherent limitation in the structural resolution of IMS frequently results in peak overlap during the analysis of isomers exhibiting comparable structures. The radial basis function (RBF) neural network optimization algorithm based on dynamic inertial weight particle swarm optimization (DIWPSO) was proposed for separating overlapping peaks in IMS. The RBF network structure and parameters were optimized using the DIWPSO algorithm. By extensively training using a large dataset, an adaptive model was developed to effectively separate overlapping peaks in IMS data. This approach successfully overcomes issues related to local optima, ensuring efficient and precise separation of overlapping peaks. The method's performance was evaluated using experimental validation and analysis of overlapping peaks in the IMS spectra of two sets of isomers: 3'/6'-sialyllactose; fructose-6-phosphate, glucose-1-phosphate, and glucose-6-phosphate. A comparative analysis was conducted using other algorithms, including the sparrow search algorithm, DIWPSO algorithm, and multi-objective dynamic teaching-learning-based optimization algorithm. The comparison results show that the DIWPSO-RBF algorithm achieved remarkably low maximum relative errors of only 0.42%, 0.092%, and 0.41% for ion height, mobility, and half peak width, respectively. These error rates are significantly lower than those obtained using the other three algorithms. The experimental results convincingly demonstrate that this method can adaptively, rapidly, and accurately separate overlapping peaks of multiple components, improving the structural resolution of IMS.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.