Abstract

The chemometric resolution and quantification of overlapped peaks from comprehensive two-dimensional (2D) liquid chromatography (LC × LC) data are demonstrated. The LC × LC data is produced from an in-house LC × LC analyzer that couples an anion-exchange column via a multi-port valve with a reversed-phase column connected to a UV absorbance detector. Three test mixtures, each containing a target analyte, are subjected to partial LC × LC separations to simulate likely cases of signal overlap. The resulting unresolved target-analyte signals are then analyzed by the standard-addition method and two chemometric methods. The LC × LC analyses of a test mixture and its corresponding standard-addition mixture results in two data matrices, one for each mixture. The stacking of these two data matrices produces a data structure that can then be analyzed by trilinear chemometric methods. One method, the generalized rank annihilation method (GRAM), uses a non-iterative eigenvalue-based approach to mathematically resolve overlapped trilinear signals. The other method, parallel factor analysis (PARAFAC), uses an iterative approach to resolve trilinear signals by the optimization of initial estimates using alternating least squares and signal constraints. In this paper, GRAM followed by PARAFAC analysis is shown to produce better qualitative and quantitative results than using each method separately. For instance, for all three test mixtures, the GRAM-PARAFAC approach improved quantitative accuracy by at least a factor of 4 and quantitative precision by more than 2 when compared to GRAM alone. This paper also introduces a new means of correcting run-to-run retention time shifts in comprehensive 2D chromatographic data.

Full Text
Paper version not known

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 call

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.