z-logo
Premium
Retention prediction of a set of amino acids under gradient elution conditions in hydrophilic interaction liquid chromatography
Author(s) -
Gika Helen,
Theodoridis Georgios,
Mattivi Fulvio,
Vrhovsek Urska,
PappaLouisi Adriani
Publication year - 2012
Publication title -
journal of separation science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.72
H-Index - 102
eISSN - 1615-9314
pISSN - 1615-9306
DOI - 10.1002/jssc.201100795
Subject(s) - multilinear map , chemistry , elution , chromatography , acetonitrile , gradient elution , ternary operation , aqueous solution , hydrophilic interaction chromatography , high performance liquid chromatography , analytical chemistry (journal) , organic chemistry , mathematics , computer science , pure mathematics , programming language
The analysis of amino acids presents significant challenges to contemporary analytical separations. The present paper investigates the possibility of retention prediction in hydrophilic interaction chromatography (HILIC) gradient elution based on the analytical solution of the fundamental equation of the multilinear gradient elution derived for reversed‐phase systems. A simple linear dependence of the logarithm of the solute retention (ln  k ) upon the volume fraction of organic modifier (φ) in a binary aqueous‐organic mobile is adopted. Utility of the developed methodology was tested on the separation of a mixture of 21 amino acids carried out with 14 different gradient elution programs (from simple linear to multilinear and curved shaped) using ternary eluents in which a mixture of methanol and water (1:1, v/v) was the strong eluting member and acetonitrile was the weak solvent. Starting from at least two gradient runs, the prediction of solute retention obtained under all the rest gradients was excellent, even when curved gradient profiles were used. Development of such methodologies can be of great interest for a wide range of applications.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here