Longest Common Subsequence using Chemical Reaction Optimization

Longest Common Subsequence (LCS) is a well-known optimization problem. It is the problem to find out a longest subsequence of each member of a given set of sequences. It is an NP-hard problem and has applications in data compression, FPGA circuit minimization and bioinformatics. Chemical Reaction Optimization (CRO) is a new meta-heuristic method that is being widely used in solving optimization problem. In this paper we have proposed an efficient Chemical Reaction Optimization technique to solve Longest Common Subsequence problem. The design strategies of elementary operators and correction method are shown to solve the problem. The proposed method is compared with two other methods and the experimental results show that it takes less execution time than that of others.