Evidence map›Paper›PMID 37229149›Full record

ArticlePlasmonics (Norwell, Mass.)2023

Simple Method for Optical Detection and Characterization of Surface Agents on Conjugated Gold Nanoparticles.

Ehsan Koushki, Abbas Koushki

Open access · bronzeAbstract read
In one paragraph

Article in Plasmonics (Norwell, Mass.), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
0.3field-weighted citation impact, top 57% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed, 4 citations in OpenAlex.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors at 1 institution in 1 country.

Ehsan KoushkiDepartment of Physics, Faculty of Science, Hakim Sabzevari University, Sabzevar, 96179-76487 Iran.
Abbas KoushkiFaculty of Mathematics, Hakim Sabzevari University, Sabzevar, 96179-76487 Iran.
Hakim Sabzevari University · IR

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In this article, we propose a simple method to calculate electrical permittivity and refractive index of surface agents of gold nanoparticles (Au NPs), in which it is possible to find the refractive index of surface agents shell by using the absorption peak of the gold nano-colloid. One of the usual tests for detection of surface agents is colorimetric methods based on the change of color of Au NPs. The color change is mainly due to the shift of localized surface plasmon resonance which is related to electrical interactions of surface agents. Although there are many mathematical models for simulating the absorption spectrum and calculating the plasmonic peak, using them is not simple and possible for everyone due to the need for programming. Here, the necessary simulations have been performed for different values ​​of refractive index of surface agents and particle size, and absorption peaks have been obtained. Using numerical methods, a simple formula is obtained between the wavelength of plasmonic peak, the ratio of hydrodynamic diameter to Feret size of the particles, and the refractive index of the surface agents. This method can help researchers to obtain the refractive index and consequently the type or concentration of surface agents around Au NPs without the need for programming or complex mathematical operations. It can also open new horizons in analyzing colorimetric diagnosis of biological agents such as viral antibodies, antigens, and other biological agents.

Indexed as

Au NPsConjugated nanoparticlesLocalized surface plasmonNumerical curve fittingThe least-squares method

Identifiers

PMID37229149
PMCPMC10106889
OpenAlexW4366089041

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.