.png){kind=icon}
返回
A practical algorithm based on particle swarm optimization for haplotype reconstruction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2008.12.040.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The minimum error correction (MEC) model is an important computational model for haplotype reconstruction problem. Owing to the NP-hardness of the MEC model, Qian et al. presented a particle swarm optimization (PSO) algorithm to solve the model, and the length of a particle code is equal to the number of SNP fragments. However, there are hundreds and thousands of SNP fragments in practical applications, the PSO algorithm based on this kind of long particle code cannot obtain high reconstruction rate efficiently. In this paper, a kind of short particle code is proposed by taking advantage of the low heterozygous frequencies of single nucleotide polymorphisms (SNPs), and a practical particle swarm optimization algorithm P-MEC based on this kind of particle code is presented. Experimental results indicate that P-MEC algorithm can get higher reconstruction rate than the particle swarm optimization algorithm designed by Qian et al. to the MEC model. Moreover, this kind of short particle code makes P-MEC algorithm efficient even for reconstructing long haplotypes. (C) 2008 Elsevier Inc. All rights reserved.
Keyword:
Algorithm
Single nucleotide polymorphisms
Haplotype
The minimum error correction
Particle swarm optimization
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Isotopic fractionation of dissolved organic carbon in shallow forest soils as affected by sorption.png)
IF0
PREAI
分享收藏分享收藏
查看更多内容