CAJ | 학술논문

单体型组装问题就是根据个体基因组测序获得的DNA序列数据重构出该个体的一对单体型.目前单体型组装问题的各种优化计算模型已有相关的启发式算法和参数化精确算法,但是这些算法只能得出一个最优解,即一对单体型.可是生物问题的最优解往往不是唯一的,或者真实解可能只是接近最优的.该文设计了一个新的能枚举出最优的多个解的遗传算法.实验结果表明该算法具有较高的单体型重建精度,并为生物学家根据领域知识在算法获得的多个解的基础进一步选择提供了可能.
단체형조장문제취시근거개체기인조측서획득적DNA서렬수거중구출해개체적일대단체형.목전단체형조장문제적각충우화계산모형이유상관적계발식산법화삼수화정학산법,단시저사산법지능득출일개최우해,즉일대단체형.가시생물문제적최우해왕왕불시유일적,혹자진실해가능지시접근최우적.해문설계료일개신적능매거출최우적다개해적유전산법.실험결과표명해산법구유교고적단체형중건정도,병위생물학가근거영역지식재산법획득적다개해적기출진일보선택제공료가능.
The haplotype assembly problem aims to reconstruct a pair of haplotype of an individual from its DNA sequencing fragment data.There are some heuristic algorithms and parameterized algorithms for the various computational optimal models.How-ever,these algorithms work out with only one optimal solution, i.e.a pair of haplotypes.However.the optimal solution to a biological problem is usually not unique,or the real solution may be suboptimal.The paper proposes a new genetic algorithm to enumerate multiple optimal solutions to the haplotype assembly problem.Experimental results show that this algorithm is more accurate in haplotype reconstruction and provides the chance for the biologists to choose one from these multiple solutions based on some biological knowledge.