DocumentCode
3509328
Title
An Ant Colony Optimization approach to solve the minimum string cover problem
Author
Ferdous, S.M. ; Das, Anindya ; Rahman, M. Sohel ; Rahman, Md Mustafizur
Author_Institution
Dept. of Comput. Sci. & Eng., Bangladesh Univ. of Eng. & Technol., Dhaka, Bangladesh
fYear
2012
fDate
18-19 May 2012
Firstpage
741
Lastpage
746
Abstract
In this paper, we consider the problem of covering a set of strings S with a set of strings C. C is said to cover S if every string in S can be written as a concatenation of a set of strings which are elements of C. We discuss here three different variants of Ant Colony Optimization (ACO) and propose how we can solve the minimum string cover problem using these techniques. Our simulation results show that ACO based approach gives better solution than the existing approximation algorithm for this problem.
Keywords
ant colony optimisation; formal languages; ant colony optimization approach; minimum string cover problem; string set concatenation; stringology; Ant Colony Optimization; Metaheuristics; String Cover; Stringology;
fLanguage
English
Publisher
ieee
Conference_Titel
Informatics, Electronics & Vision (ICIEV), 2012 International Conference on
Conference_Location
Dhaka
Print_ISBN
978-1-4673-1153-3
Type
conf
DOI
10.1109/ICIEV.2012.6317422
Filename
6317422
Link To Document