Abstract
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. © 2013 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Ferdous, S. M., & Rahman, M. S. (2013). Solving the minimum common string partition problem with the help of ants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7928 LNCS, pp. 306–313). https://doi.org/10.1007/978-3-642-38703-6_36
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
