Advertisement

Journal of Heuristics

, Volume 24, Issue 3, pp 551–579 | Cite as

A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem

  • Christian Blum
  • Maria J. Blesa
Article

Abstract

This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has been shown that general purpose integer linear programming solvers are very efficient for solving many of the problem instances that were used so far in the literature. Therefore, in this work we extend the available benchmark set, adding larger instances to which integer linear programming solvers cannot be applied anymore. Moreover, we provide a comprehensive comparison of the approaches found in the literature. Based on the results we propose a hybrid between two of the best methods which turns out to inherit the complementary strengths of both methods.

Keywords

Repetition-free longest common subsequence Hybrid metaheuristics Matheuristic 

Notes

Acknowledgements

This work was supported by Project TIN2012-37930-c02-02 (Spanish Ministry for Economy and Competitiveness, feder funds from the European Union). Maria J. Blesa acknowledges support by funds from the agaur of the Government of Catalonia under Project Ref. SGR 2014:1034 (albcom). Our experiments have been executed in the High Performance Computing environment managed by the rdlab at the Technical University of Barcelona (http://rdlab.cs.upc.edu) and we would like to thank them for their support.

References

  1. Adi, S.S., Braga, M.D.V., Fernandes, C.G., Ferreira, C.E., Martinez, F.V., Sagot, M.F., Stefanes, M.A., Tjandraatmadja, C., Wakabayashi, Y.: Repetition-free longest common subsequence. Electron. In: Proceedings of The IV Latin-American Algorithms, Graphs, and Optimization Symposium. Notes Discret. Math. 30, 243–248 (2008)Google Scholar
  2. Adi, S.S., Braga, M.D.V., Fernandes, C.G., Ferreira, C.E., Martinez, F.V., Sagot, M.F., Stefanes, M.A., Tjandraatmadja, C., Wakabayashi, Y.: Repetition-free longest common subsquence. Discret. Appl. Math. 158, 1315–1324 (2010)CrossRefzbMATHGoogle Scholar
  3. Aho, A., Hopcroft, J., Ullman, J.: Data Structures and Algorithms. Addison-Wesley, Reading, MA (1983)zbMATHGoogle Scholar
  4. Blum, C., Blesa, M.J.: Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem. In: Chicano, F., Hu, B. (eds.) Proceedings of EvoCOP 2016—16th European Conference on Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science, vol. 9595, pp. 46–57. Springer, Berlin (2016)Google Scholar
  5. Blum, C., Blesa, M.J., Calvo, B.: Beam-ACO for the repetition-free longest common subsequence problem. In: Legrand, P., Corsini, M.M., Hao, J.K., Monmarché, N., Lutton, E., Schoenauer, M. (eds.) Proceedings of EA 2013—11th Conference on Artificial Evolution, Lecture Notes in Computer Science, vol. 8752, pp. 79–90. Springer, Berlin (2014)Google Scholar
  6. Blum, C., Blesa, M.J., López-Ibáñez, M.: Beam search for the longest common subsequence problem. Comput. Oper. Res. 36(12), 3178–3186 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  7. Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Trans. Man Syst. Cybern. B 34(2), 1161–1172 (2004)CrossRefGoogle Scholar
  8. Bonizzoni, P., Della Vedova, G., Dondi, R., Fertin, G., Rizzi, R., Vialette, S.: Exemplar longest common subsequence. IEEE/ACM Trans. Comput. Biol. Bioinf. 4(4), 535–543 (2007)CrossRefzbMATHGoogle Scholar
  9. Castelli, M., Beretta, S., Vanneschi, L.: A hybrid genetic algorithm for the repetition free longest common subsequence problem. Oper. Res. Lett. 41(6), 644–649 (2013)CrossRefzbMATHGoogle Scholar
  10. Easton, T., Singireddy, A.: A large neighborhood search heuristic for the longest common subsequence problem. J. Heuristics 14(3), 271–283 (2008)CrossRefzbMATHGoogle Scholar
  11. García, S., Fernández, A., Luengo, J., Herrera, F.: Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf. Sci. 180(10), 2044–2064 (2010)CrossRefGoogle Scholar
  12. García, S., Herrera, F.: An extension on “statistical comparisons of classifiers over multiple data sets” for all pairwise comparisons. J. Mach. Learn. Res. 9, 2677–2694 (2008)zbMATHGoogle Scholar
  13. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)CrossRefzbMATHGoogle Scholar
  14. Jiang, T., Lin, G., Ma, B., Zhang, K.: A general edit distance between RNA structures. J. Comput. Biol. 9(2), 371–388 (2002)CrossRefGoogle Scholar
  15. López-Ibáñez, M., Dubois-Lacoste, J., Stützle, T., Birattari, M.: The irace package, iterated race for automatic algorithm configuration. Technical report TR/IRIDIA/2011-004, IRIDIA, Université libre de Bruxelles, Belgium (2011)Google Scholar
  16. Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM 25, 322–336 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  17. Ning, K.: Deposition and extension approach to find longest common subsequence for thousands of long sequences. Comput. Biol. Chem. 34(3), 149–157 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  18. Smith, T., Waterman, M.: Identification of common molecular subsequences. J. Mol. Biol. 147(1), 195–197 (1981)CrossRefGoogle Scholar
  19. Smith, T.F., Waterman, M.S.: Identification of common molecular subsequences. J. Mol. Biol. 147(1), 195–197 (1981)CrossRefGoogle Scholar
  20. Storer, J.: Data Compression: Methods and Theory. Computer Science Press, Rockville, MD (1988)Google Scholar
  21. Tabataba, F.S., Mousavi, S.R.: A hyper-heuristic for the longest common subsequence problem. Comput. Biol. Chem. 36, 42–54 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  22. Wang, Q., Korkin, D., Shang, Y.: A fast multiple longest common subsequence (MLCS) algorithm. IEEE Trans. Knowl. Data Eng. 23(3), 321–334 (2011)CrossRefGoogle Scholar
  23. Wang, Q., Pan, M., Shang, Y., Korkin, D.: A fast heuristic search algorithm for finding the longest common subsequence of multiple strings. In: Proceedings of AAAI—Conference on Artificial Intelligence, pp. 1287–1292 (2010)Google Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Artificial Intelligence Research Institute (IIIA-CSIC)BellaterraSpain
  2. 2.Technical University of Barcelona – BarcelonaTechBarcelonaSpain

Personalised recommendations