Fast Quantitation of Target Analytes in Small Volumes of Complex Samples by Matrix-Compatible Solid-Phase Microextraction Devices

Download

Date

2016-06-20

Author

Piri-Moghadam, Hamed
Ahmadi, Fardin
Gomez-Rios, German Augusto
Boyacı, Ezel
Reyes-Garces, Nathaly
Aghakhani, Ali
Bojko, Barbara
Pawliszyn, Janusz

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

31
views

0
downloads

Herein we report the development of solid-phase microextraction (SPME) devices designed to perform fast extraction/enrichment of target analytes present in small volumes of complex matrices (i.e. V <= 10 mu L). Micro-sampling was performed with the use of etched metal tips coated with a thin layer of biocompatible nano-structured polypyrrole (PPy), or by using coated blade spray (CBS) devices. These devices can be coupled either to liquid chromatography (LC), or directly to mass spectrometry (MS) via dedicated interfaces. The reported results demonstrated that the whole analytical procedure can be carried out within a few minutes with high sensitivity and quantitation precision, and can be used to sample from various biological matrices such as blood, urine, or Allium cepa L single-cells.

Subject Keywords

Coated blade spray, Mass spectrometry, Small volumes, Solid-phase microextraction (SPME), Trace analysis

URI

https://hdl.handle.net/11511/39444

Journal

ANGEWANDTE CHEMIE-INTERNATIONAL EDITION

DOI

https://doi.org/10.1002/anie.201601476

Collections

Department of Chemistry, Article

Suggestions

OpenMETU
Core

FAST CONSTRAINT GRAPH GENERATION ALGORITHMS FOR VLSI LAYOUT COMPACTION TORUNOGLU, IH; ASKAR, M (1994-04-14) Three new fast constraint graph generation algorithms, PPSS-1D, PPSS-1Dk and PPSS-2D, are presented for VLSI layout compaction. The algorithms are based on parallel plane sweep shadowing (PPSS). The PPSS-1D algorithm improves the time spent on searching processes from O(N/spl circ/1.5) to O(G*N) with extra O(G) memory where G is independent of N. PPSS-1Dk, the successor to PPSS-1D, eliminates the possibility of generation of unnecessary constraints using extra O(k*G) memory. PPSS-2D improves the O(NlogN) so...
Efficient interleaved Montgomery modular multiplication for lattice-based cryptography AKLEYLEK, SEDAT; Tok, Zaliha Yuce (2014-01-01) In this paper, we give modified version of interleaved Montgomery modular multiplication method for lattice-based cryptography. With the proposed algorithms, we improve the multiplication complexity and embed the conversion operation into the algorithm with almost free cost. We implement the proposed methods for the quotient ring (Z/qZ)[x]/(x(n) - 1) and (Z/pZ)[x]/(x(n) + 1) on the GPU (NVIDIA Quadro 600) using the CUDA platform. NTRUEncrypt is accelerated approximately 35% on the GPU by using the proposed ...
Fast and Accurate Analysis of Complicated Metamaterial Structures Using a Low-Frequency Multilevel Fast Multipole Algorithm Ergül, Özgür Salih (2009-09-18) We present efficient solutions of electromagnetics problems involving realistic metamaterial structures using a low-frequency multilevel fast multipole algorithm (LF-MLFMA). Ordinary implementations of MLFMA based on the diagonalization of the Green's function suffer from the low-frequency breakdown, and they become inefficient for the solution of metamaterial problems discretized with very small elements compared to the wavelength. We show that LF-MLFMA, which employs multipoles explicitly without diagonal...
Fast and accurate analysis of optical metamaterials using surface integral equations and the parallel multilevel fast multipole algorithm Ergül, Özgür Salih (2013-09-13) We present fast and accurate simulations of optical metamaterials using surface integral equations and the multilevel fast multipole algorithm (MLFMA). Problems are formulated with the electric and magnetic current combined-field integral equation and solved iteratively with MLFMA, which is parallelized using the hierarchical strategy on distributed-memory architectures. Realistic metamaterials involving dielectric, perfectly conducting, and plasmonic regions of finite extents are solved rigorously with the...
Fast Algorithms for Digital Computation of Linear Canonical Transforms Koc, Aykut; Öktem, Sevinç Figen; Ozaktas, Haldun M.; Kutay, M. Alper (2016-01-01) Fast and accurate algorithms for digital computation of linear canonical transforms (LCTs) are discussed. Direct numerical integration takes O.N-2/time, where N is the number of samples. Designing fast and accurate algorithms that take O. N logN/time is of importance for practical utilization of LCTs. There are several approaches to designing fast algorithms. One approach is to decompose an arbitrary LCT into blocks, all of which have fast implementations, thus obtaining an overall fast algorithm. Another a...

Citation Formats

H. Piri-Moghadam et al., “Fast Quantitation of Target Analytes in Small Volumes of Complex Samples by Matrix-Compatible Solid-Phase Microextraction Devices,” ANGEWANDTE CHEMIE-INTERNATIONAL EDITION, pp. 7510–7514, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39444.