%0 Journal Article
%T Solving Shortest Common Supersequence Problem Using Artificial Bee Colony Algorithm
%A Mustafa M. Noaman
%A Ameera S. Jaradat
%J International Journal of ACM Jordan
%D 2011
%I ACM Jordan ISWSA Professional Chapter
%X The idea behind this work is to solve the Shortest Common Supersequence by using Artificial Bee Colony (ABC) Algorithm. This algorithm is considered as one of the newest nature-inspired swarm-based optimization algorithms and has a promising performance [6]. Shortest Common Supersequence is a classical problem in the field of strings and it is classified as NP-Hard problem [12]. Many algorithms were used to solve this problem, Such as Genetic algorithms [14], Majority Merge algorithm and Ant Colony algorithm [17]. The project uses Artificial Bee Colony Algorithm to provide a scalable solution to the Shortest Common Supersequence problem. The algorithm evaluation showed promising results.
%U http://ijj.acm.org/volumes/volume2/no3/ijjvol2no3p8.pdf