摘要
为了对一组连锁的分子标记位点获得正确的排序进而构建生物遗传连锁图谱,提出了并行算法PMMASLH,针对F2作图群体,通过基于消息传递接口并行最大最小蚂蚁系统求解连锁的多个分子标记位点排序,使用隐马尔可夫模型计算一列有序标记位点所获得的极大似然值作为排序的目标函数。计算机模拟结果表明,该算法执行效率高、计算稳定,排序的功效优于著名的连锁作图软件Mapmaker。
In order to sort the linkage group of molecular markers for constructing the genetic linkage map, this paper presen- ted a parallel algorithm named PMMASLH. It was based on max-min ant system, proposed for ordering a large number of linked molecular markers in an F2 population. It chose the object function of ordering as the likelihood of an orderd markers with hid- den Markov model method. The simulation experiments show that the algorithm is of high efficiency and stability, and its power is much higher than that of the famous linkage mapping software, Mapmaker.
出处
《计算机应用研究》
CSCD
北大核心
2015年第1期75-79,84,共6页
Application Research of Computers
