Loading...
Please wait, while we are loading the content...
Similar Documents
Solving Shortest Common Supersequence Problem Using Artificial Bee Colony Algorithm
| Content Provider | Semantic Scholar |
|---|---|
| Author | Noaman, Mustafa M. Jaradat, Ameera Saleh |
| Copyright Year | 2011 |
| Abstract | 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. Categories and Subject Descriptors I.2.8 Problem Solving, Control Methods, and Search (Heuristic methods) |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://ijj.acm.org/volumes/volume2/no3/ijjvol2no3p8.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
