𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tag SNP selection using particle swarm optimization

✍ Scribed by Li-Yeh Chuang; Cheng-San Yang; Chang-Hsuan Ho; Cheng-Hong Yang


Publisher
American Institute of Chemical Engineers
Year
2009
Tongue
English
Weight
762 KB
Volume
26
Category
Article
ISSN
8756-7938

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Single nucleotide polymorphisms (SNPs) are the most abundant form of genetic variations amongst species. With the genome‐wide SNP discovery, many genome‐wide association studies are likely to identify multiple genetic variants that are associated with complex diseases. However, genotyping all existing SNPs for a large number of samples is still challenging even though SNP arrays have been developed to facilitate the task. Therefore, it is essential to select only informative SNPs representing the original SNP distributions in the genome (tag SNP selection) for genome‐wide association studies. These SNPs are usually chosen from haplotypes and called haplotype tag SNPs (htSNPs). Accordingly, the scale and cost of genotyping are expected to be largely reduced. We introduce binary particle swarm optimization (BPSO) with local search capability to improve the prediction accuracy of STAMPA. The proposed method does not rely on block partitioning of the genomic region, and consistently identified tag SNPs with higher prediction accuracy than either STAMPA or SVM/STSA. We compared the prediction accuracy and time complexity of BPSO to STAMPA and an SVM‐based (SVM/STSA) method using publicly available data sets. For STAMPA and SVM/STSA, BPSO effective improved prediction accuracy for smaller and larger scale data sets. These results demonstrate that the BPSO method selects tag SNP with higher accuracy no matter the scale of data sets is used. Β© 2009 American Institute of Chemical Engineers Biotechnol. Prog., 2010


πŸ“œ SIMILAR VOLUMES


Particle swarm optimization with tournam
✍ J. R. PΓ©rez; J. Basterrechea πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 260 KB

## Abstract The modern heuristic particle swarm optimization technique (PSO) has received great attention in many applications and research areas over the last few years, and novel PSO‐based algorithms are continuously emerging to improve its overall performance. In this article, classical PSO sche

Improved particle swarm optimization tec
✍ Said Mikki; Ahmed Kishk πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 344 KB

The terminology of hard and soft boundary conditions is suggested in this paper to describe the way in which particles are enforced to stay inside the desired domain of interest. Specifically, hard boundary conditions use position-clipping criterion, while soft boundary conditions do not use this cr

Adaptive particle swarm optimization usi
✍ Teruyoshi Yamaguchi; Nobuhiro Iwasaki; Keiichiro Yasuda πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 516 KB

## Abstract The Particle Swarm Optimization method is one of the most powerful optimization methods available for solving global optimization problems. However, knowledge of adaptive strategies for tuning the parameters of the method for application to large‐scale nonlinear nonconvex optimization p

A multi-objective optimal power flow usi
✍ J. Hazra; A. K. Sinha πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 301 KB πŸ‘ 1 views

This paper presents a multi-objective optimal power flow technique using particle swarm optimization. Two conflicting objectives, generation cost, and environmental pollution are minimized simultaneously. A multiobjective particle swarm optimization method is used to solve this highly nonlinear and

Slope-stability-constrained design of ir
✍ M. JANGA REDDY; S. ADARSH πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 225 KB

This paper presents a practical methodology for optimal design of open channels considering the slope-stability aspects and other requirements, and propounds the solution of particle swarm optimization (PSO) for solving nonlinear optimization problems. The proposed methodology handles site-specific