Evidence map›Paper›PMID 35756402›Full record

ArticleComputational and mathematical methods in medicine2022

Informative SNP Selection Based on a Fuzzy Clustering and Improved Binary Particle Swarm Optimization Algorithm.

Zejun Li, Li Ang, Wei Shi, Ning Xin, Min Chen, Hua Tang

Abstract read
In one paragraph

Article in Computational and mathematical methods in medicine, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

6 authors.

Zejun LiSchool of Computer and Information Science, Hunan Institute of Technology, Hengyang 412002, China.
Li AngSchool of Computer and Information Science, Hunan Institute of Technology, Hengyang 412002, China.
Wei ShiCollege of Information Science and Engineering, Hunan University, Changsha, Hunan 410082, China.
Ning XinMinimally Invasive Thoracic Surgical Center, Shanghai Changzheng Hospital, Navy Military Medical University, Shanghai, China.
Min ChenSchool of Computer and Information Science, Hunan Institute of Technology, Hengyang 412002, China.
Hua TangMinimally Invasive Thoracic Surgical Center, Shanghai Changzheng Hospital, Navy Military Medical University, Shanghai, China.ORCID https://orcid.org/0000-0002-7132-960X

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Single-nucleotide polymorphism (SNP) involves the replacement of a single nucleotide in a deoxyribonucleic acid (DNA) sequence and is often linked to the development of specific diseases. Although current genotyping methods can tag SNP loci within biological samples to provide accurate genetic information for a disease associated, they have limited prediction accuracy. Furthermore, they are complex to perform and may result in the prediction of an excessive number of tag SNP loci, which may not always be associated with the disease. Therefore in this manuscript, we aimed to evaluate the impact of a newly optimized fuzzy clustering and binary particle swarm optimization algorithm (FCBPSO) on the accuracy and running time of informative SNP selection. Fuzzy clustering and FCBPSO were first applied to identify the equivalence relation and the candidate tag SNP set to reduce the redundancy between loci. The FCBPSO algorithm was then optimized and used to obtain the final tag SNP set. The prediction performance and running time of the newly developed model were compared with other traditional methods, including NMC, SPSO, and MCMR. The prediction accuracy of the FCBPSO algorithm was always higher than that of the other algorithms especially as the number of tag SNPs increased. However, when the number of tag SNPs was low, the prediction accuracy of FCBPSO was slightly lower than that of MCMR (add prediction accuracy values for each algorithm). However, the running time of the FCBPSO algorithm was always lower than that of MCMR. FCBPSO not only reduced the size and dimension of the optimization problem but also simplified the training of the prediction model. This improved the prediction accuracy of the model and reduced the running time when compared with other traditional methods.

Indexed as

AlgorithmsPolymorphism, Single NucleotideCluster AnalysisHumans

Identifiers

PMID35756402
PMCPMC9225903

What Socratic holds

Textmetadata
LicenceCC BY
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 Socratic graph.