首页 | 本学科首页   官方微博 | 高级检索  
     检索      

利用改进的罚函数集合覆盖蚁群算法识别tagSNPs
引用本文:王丽美,王龙香,彭富强.利用改进的罚函数集合覆盖蚁群算法识别tagSNPs[J].河池学院学报,2014,34(5):59-65.
作者姓名:王丽美  王龙香  彭富强
作者单位:1. 临沧师范高等专科学校数理系,云南临沧,677000
2. 福建农林大学计算机与信息学院,福建福州,350002
3. 临沧师范高等专科学校外语系,云南临沧,677000
摘    要:序列中的标签SNPs—tagSNPs携带了SNPs数据集的绝大部分遗传信息,因此寻找tagSNPs意义重大。但从SNPs数据集中找出tagSNPs需要耗费巨大的计算量,传统的方法效率低且费用昂贵,对于复杂的集合覆盖问题,现有算法难以得到优化解。鉴于蚁群算法有较强的近优解搜索能力,因此,将改进的罚函数集合覆盖蚁群算法(RCACO)用于tagSNPs搜索。模拟数据集上进行的算法实验结果表明,与近两年的PSO、GA两类算法相比,所提出的算法运行时间较短,且搜索结果精确度更高。

关 键 词:tagSNPs  集合覆盖  蚁群算法  罚函数

A Collection of Penalty Function Covered ant Colony Algorithm to Identify tagSNPs
WANG Li-mei,WANG Long-xiang,PENG Fu-qiang.A Collection of Penalty Function Covered ant Colony Algorithm to Identify tagSNPs[J].Journal of Hechi University,2014,34(5):59-65.
Authors:WANG Li-mei  WANG Long-xiang  PENG Fu-qiang
Institution:WANG Li-mei, WANG Long-xiang, PENG Fu-qiang ( 1. Department of Mathematics and Physics, Lincang Teachers' College, Lincang, Yunnan 677000 ; 2. College of Computer and Information Technology, Fujian Agriculture and Forestry University, Fuzhou, Fujian 350002; 3. Department of Foreign Languages, Lincang Teachers' College, Lincang, Yunnan 677000, China)
Abstract:Studies show that tagSNPs carries the most genetic information of SNPs data set, which marks significance of locating tagSNPs. However, identifying tagSNPs from SNPs data set takes a huge amount of computation, and traditional methods are inefficiency and expensive, hence it is rather difficult to obtain optimal solutions in case of complicated set cover problems. Since ant colony algorithms (ACO) work well on searching near - optimal solution,a new algorithm is proposed in search of tagSNPs,which combines setcovering with ACO based on penalty function . Experimental results on simulated data sets show that the proposed algorithm achieves higher accuracy with less time consumption than PSO and GA algorithms in recent years.
Keywords:tagSNPs  set cover  ant colony algorithm  penalty function
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号