期刊文献+

一种基于最少片段删除模型重建单体型的粒子群优化算法 被引量:1

A particle swarm optimization algorithm for haplotype reconstruction based on minimum fragment removal model
下载PDF
导出
摘要 利用最少片段删除(MFR)模型研究了个体单体型重建的算法。利用单核苷酸多态性(SNP)位点杂合率低的特性,引入了一种短粒子编码方式,提出了一种重建单体型的粒子群优化算法P-MFR。利用国际人类基因组单体型图计划发布的CEPH样本(祖籍是北欧或西欧的美国犹他州人)中60个个体在1号染色体上的单体型进行实验分析,实验结果显示,与以往求解MFR模型的算法相比较,P-MFR算法能够获得更高重建率的单体型。此外,由于采用了较短的粒子位置编码方式,P-MFR算法在重建长单体型时仍具有较高的执行效率,有很好的实用价值。 The individual haplotype reconstruction problem was studied by using the minimum fragment removal (MFR)model. Owing to the NP-hardness of the MFR model, a practical algorithm based on particle swarm optimization (PSO) for haplotype reconstruction, named P-MFR, was presented. A kind of short particle code was designed for the P-MFR by taking advantage of the low heterozygous frequencies of single nucleotide polymorphisms (SNPs). The experiments were conducted by using the haplotypes on the chromosomes 1 of 60 individuals in the CEPH sample, which were released by the International HapMap Project. The results indicate that P-MFR can obtain higher reconstruction rate than previous algorithms when solving the MFR model. Moreover, this kind of short particle code makes P-MFR efficient even for reconstructing long haplotypes.
出处 《高技术通讯》 CAS CSCD 北大核心 2009年第2期194-199,共6页 Chinese High Technology Letters
基金 国家自然科学基金重点项目:生物信息学中的相关组合理论和算法研究(60433020) 新世纪优秀人才支持计划(NCET-05-0683) 长江学者和创新团队发展计划(IRT0661)资助项目
关键词 单核苷酸多态性 单体型 最少片段删除 粒子群优化 编码 single nucleotide polymorphisms (SNPs), haplotype, minimum fragment removal (MFR), particleswarm optimization (PSO) ,- code
  • 相关文献

参考文献13

  • 1Bafna V, Istrail S, Lancia G, et al. Polynomial and APX- hard cases of the individual haplotyping problem. Theoretical Computer Science, 2005, 335:109-125
  • 2Stephens J C, Schneider J A, Tanguay D A, et al. Haplotype variation and linkage disequilibrium in 313 human genes. Science, 2001, 293:489-493
  • 3Clark A G. Inference of haplotypes from PCR-amplified sampies of diploid populations. Mol Biol Evol, 1990, 7 : 111- 122
  • 4Gusfield D. Inference of haplotypes from samples of diploid populations: complexity and algorithms. J Comput Biol, 2001, 8:305-323
  • 5Lancia G, Bafna V, Istrail S, et al. SNPs problems, complexity and algorithms. In: Proceedings of the 9th Annual European Symposium on Algorithms. London: Springer-Vedag, 2001. 182-193
  • 6Rizzi R, Bafna V, Istrail S, et al. Practical algorithms and fixed parameter tractability for the single individual SNP hap- lotyping problem. In: Proceedings of the 2nd International Workshop on Algorithms in Bioinformatics. London: Springer- Verlag, 2002. 29-43
  • 7Xie M Z, Chen J E, Wang J X. Research on parameterized algorithms of the individual haplotyping problem. J Bioinform Comput Biol, 2007, 5:795-816
  • 8Panconesi A, Sozio M. Fast hare: a fast heuristic for single individual SNP haplotype reconstruction. In: Proceedings of the 4th Workshop on Algorithms in Bioinformatics. Heiderberg: Spfinger-Verlag, 2004. 266-277
  • 9Wang R S, Wu L Y, Li Z P, et al. Haplotype reconstruction from SNP fragments by minimum error correction. Bioinformatics, 2005, 21:2456-2462
  • 10Kennedy J, Eberhart R C. Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks. New Jersey: IEEE, 1995. 1942-1948

同被引文献21

  • 1Botstein D, Risch N. Discovering Genotypes Underlying Human Phenotypes: Past Successes for Mendelian Disease, Future Approaches for Complex Disease[J]. Nature Genetics, 2003, 33(S1): 228-237.
  • 2Clark A G. Inference of Haplotypes from PCR-amplified Samples of Diploid Populations[J]. Molecular Biology and Evolution, 1990, 7(2): 111-122.
  • 3O'Neil S T, Emrich S J. Haplotype and Minimum-chimerism Consensus Determination Using Short Sequence Data[J]. BMC Genomics, 2012, 13($2).
  • 4Lancia G, Bafna V, lstrail S, et al. SNPs Problems, Complexity and Algorithms[C]//Proc. of the 9th Annual European Symposium on Algorithms. Aarhus, Denmark: Springer, 2001.
  • 5Lippert R, Schwartza R, Lancia G, et al. Algorithmic Strategies for the SNPs Haplotype Assembly Problem[J]. Briefings in Bioinformatics, 2002, 3(1): 23-31.
  • 6Rizzi R, Bafna V, Istrail S, et al. Practical Algorithms and Fixed-parameter Tractability for the Single Individual SNP Haplotyping Problem[C]//Proc. of the 2nd International Workshop on Algorithms in Bioinformatics. Rome, Italy: Springer, 2002.
  • 7Xie Minzhu, Chen Jian'er, Wang Jianxin. Research on Parameterized Algorithms of the Individual Haplotyping Problem[J]. Joumal of Bioinformatics and Computational Biology, 2007, 5(3): 795-816.
  • 8Cilibrasi R, van Iersel L, Kelk S, et al. The Complexity of the Single Individual SNP Haplotyping Problem[J]. Algorithmica, 2007, 49(1): 13-36.
  • 9Wang Ruisheng, Wu Lingyun, Li Zhenping, et al. Haplotype Reconstruction from SNP Fragments by Minimum ErrorCorrection[J]. Bioinformatics, 2005, 21 (10): 2456-2462.
  • 10He Dan, Choi A, Pipatsrisawat K, et al. Optimal Algorithms for Haplotype Assembly from Whole-genome Sequence Data[J]. Bioinformatics, 2010, 26(12): 183-190.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部