These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


PUBMED FOR HANDHELDS

Search MEDLINE/PubMed


  • Title: Retention time prediction in temperature-programmed, comprehensive two-dimensional gas chromatography: modeling and error assessment.
    Author: Barcaru A, Anroedh-Sampat A, Janssen HG, Vivó-Truyols G.
    Journal: J Chromatogr A; 2014 Nov 14; 1368():190-8. PubMed ID: 25441353.
    Abstract:
    In this paper we present a model relating experimental factors (column lengths, diameters and thickness, modulation times, pressures and temperature programs) with retention times. Unfortunately, an analytical solution to calculate the retention in temperature programmed GC × GC is impossible, making thus necessary to perform a numerical integration. In this paper we present a computational physical model of GC × GC, capable of predicting with a high accuracy retention times in both dimensions. Once fitted (e.g., calibrated), the model is used to make predictions, which are always subject to error. In this way, the prediction can result rather in a probability distribution of (predicted) retention times than in a fixed (most likely) value. One of the most common problems that can occur when fitting unknown parameters using experimental data is overfitting. In order to detect overfitting situations and assess the error, the K-fold cross-validation technique was applied. Another technique of error assessment proposed in this article is the use of error propagation using Jacobians. This method is based on estimation of the accuracy of the model by the partial derivatives of the retention time prediction with respect to the fitted parameters (in this case entropy and enthalpy for each component) in a set of given conditions. By treating the predictions of the model in terms of intervals rather than as precise values, it is possible to considerably increase the robustness of any optimization algorithm.
    [Abstract] [Full Text] [Related] [New Search]