Publisher
Springer Nature Switzerland
Reference23 articles.
1. Akeb, H., Hifi, M., M’Hallah, R.: A beam search algorithm for the circular packing problem. Comput. Oper. Res. 36(5), 1513–1528 (2009)
2. Ann, H.Y., Yang, C.B., Tseng, C.T.: Efficient polynomial-time algorithms for the constrained lcs problem with strings exclusion. J. Comb. Optim. 28(4), 800–813 (2014)
3. Apostolico, A., Guerra, C.: The longest common subsequence problem revisited. Algorithmica 2, 315–336 (1987)
4. Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, pp. 39–48. IEEE (2000)
5. Blum, C., Blesa, M.J.: A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 129–136. IEEE (2017)