z-logo
Premium
On‐line kinetic model discrimination for optimized surface plasmon resonance experiments
Author(s) -
Mehand Massinissa Si,
Crescenzo Gregory De,
Srinivasan Bala
Publication year - 2014
Publication title -
journal of molecular recognition
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 79
eISSN - 1099-1352
pISSN - 0952-3499
DOI - 10.1002/jmr.2358
Subject(s) - surface plasmon resonance , kinetic energy , resonance (particle physics) , throughput , line (geometry) , surface plasmon , biological system , kinetics , plasmon , simple (philosophy) , chemistry , computer science , physics , materials science , nanotechnology , optics , mathematics , atomic physics , nanoparticle , classical mechanics , telecommunications , geometry , philosophy , epistemology , wireless , biology
In order to improve the throughput of surface plasmon resonance‐based biosensors, an on‐line iterative optimization algorithm has been presented aiming at reducing experimental time and material consumption without any loss of confidence on kinetic parameters [De Crescenzo (2008) J. Mol Recognit., 21, 256‐66.]. This algorithm was based on a simple Langmuirian model to compute the confidence and predict optimal injections. However, this kinetic model is not suitable for all interactions, as it does not include mass transfer limitation that may occur for fast interaction kinetics. If a simple model was to be used when this phenomenon influenced the interactions, kinetic parameters would be biased. On the other hand, we show in this paper that data analysis with a kinetic model including a mass transfer limitation step would lead to longer experiments and poorer confidence if the interactions were simple. So, in this manuscript, we present an on‐line model discrimination and optimization approach to increase the throughput of surface plasmon resonance biosensors. Copyright © 2014 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here