用蚂蚁求解最小公共串划分问题
Solving the Minimum Common String Partition Problem with the Help of Ants
摘要：
在本文中，我们考虑的问题，找到一个最小公共划分的两个字符串。这个问题在基因组比较中有其应用。由于这是一个NP难的离散组合优化问题，我们采用了一种元启发式技术，即最大-最小蚂蚁系统来解决这个问题。为了提高效率，我们首先将问题实例映射到一种特殊的图中。随后，我们采用了最大最小蚂蚁系统，以实现高质量的解决方案的问题。实验结果表明，我们的算法相比，在文献中的最先进的算法的优越性。标准统计检验也证明了所取得的改进。
英文摘要：
In this paper, we consider the problem of finding a minimum common partition of two strings. The problem has its application in genome comparison. As it is an NP-hard, discrete combinatorial optimization problem, we employ a metaheuristic technique, namely, MAX-MIN ant system to solve this problem. To achieve better efficiency we first map the problem instance into a special kind of graph. Subsequently, we employ a MAX-MIN ant system to achieve high quality solutions for the problem. Experimental results show the superiority of our algorithm in comparison with the state of art algorithm in the literature. The improvement achieved is also justified by standard statistical test.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
