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 comparison. 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.
KeywordsAnt Colony Optimization Stringology Genome sequencing Combinatorial Optimization Swarm Intelligence String partition
Unable to display preview. Download preview PDF.
- 2.Dorigo, M., Gambardella, M.L.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. J. of IEEE Transactions on Evolutionary Computation 1 (1996)Google Scholar
- 6.Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement (2004) (submitted)Google Scholar
- 11.Villesen, P.: FaBox: an online fasta sequence toolbox (2007), http://www.birc.au.dk/software/fabox