Solving the Minimum Common String Partition Problem with the Help of Ants

摘要：

　　In this paper, we consider the problem of finding minimum common partition of two strings (MCSP).The problem has its application in genome com parison.As it is an NP-hard, discrete combinatorial optimization problem, we employ a metaheuristic technique, namely, MAX-MIN ant system to solve this.The preliminary experimental results are found to be promising.

关键词： Ant Colony Optimization Stringology Genome sequencing Combinatorial Optimization Swarm Intelligence String partition

作者: S.M.Ferdous M.Sohel Rahman

作者单位: AeEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh

会议类型: 国际会议

会议名称: 4th international Conference,ICSI2013(第4届群体智能国际会议)

会议地点: 哈尔滨

会议语种:英文

页码: 306-313

在线出版日期: 2013-06-12（万方平台首次上网日期，不代表论文的发表时间）