A. Aziz, Dynamic programming, 1965.

C. Blum, Beam-aco for the longest common subsequence problem, pp.1-8, 2010.

C. Blum, M. J. Blesa, and M. López-ibáñez, Beam search for the longest common subsequence problem, Computers & Operations Research, vol.36, pp.3178-3186, 2009.

P. Bonizzoni, G. Della-vedova, and G. Mauri, Experimenting an approximation algorithm for the lcs, Discrete Applied Mathematics, vol.110, pp.13-24, 2001.

M. Castelli, S. Beretta, and L. Vanneschi, A hybrid genetic algorithm for the repetition free longest common subsequence problem, Operations Research Letters, vol.41, pp.644-649, 2013.

Y. Chen, H. Lu, and L. Li, Automatic icd-10 coding algorithm using an improved longest common subsequence based on semantic similarity, PloS one, p.12, 2017.

F. Chin and C. K. Poon, Performance analysis of some simple heuristics for computing longest common subsequences, Algorithmica, vol.12, pp.293-311, 1994.

M. Djukanovic, G. Raidl, and C. Blum, Finding longest common subsequences: New a anytime results, 2019.

M. Djukanovic, G. R. Raidl, and C. Blum, A beam search for the longest common subsequence problem guided by a novel approximate expected length calculation, International Conference on Machine Learning, Optimization, and Data Science, pp.154-167, 2019.

T. Easton and A. Singireddy, A specialized branching and fathoming technique for the longest common subsequence problem, 2006.

T. Easton and A. Singireddy, A large neighborhood search heuristic for the longest common subsequence problem, Journal of Heuristics, vol.14, pp.271-283, 2008.

F. Fontan and L. Libralesso, PackingSolver: a solver for Packing Problems, 2020.

U. Golle, F. Rothlauf, and N. Boysen, Iterative beam search for car sequencing, Annals of Operations Research, vol.226, pp.239-254, 2015.

A. Guenoche, Supersequences of masks for oligo-chips, Journal of bioinformatics and computational biology, vol.2, pp.459-470, 2004.

D. Gusfield, Algorithms on stings, trees, and sequences: Computer science and computational biology, Acm Sigact News, vol.28, pp.41-60, 1997.

C. C. Hayes, A model of planning for plan efficiency: Taking advantage of operator overlap, IJCAI, pp.949-953, 1989.

B. Hinkemeyer and B. A. Julstrom, A genetic algorithm for the longest common subsequence problem, Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp.609-610, 2006.

W. Hsu and M. Du, Computing a longest common subsequence for a set of strings, BIT Numerical Mathematics, vol.24, pp.45-59, 1984.

K. Huang, C. B. Yang, and K. T. Tseng, Fast algorithms for finding the common subsequence of multiple sequences, Proceedings of the International Computer Symposium, pp.1006-1011, 2004.

J. W. Hunt and M. D. Macilroy, An algorithm for differential file comparison, 1976.

T. Jansen and D. Weyland, Analysis of evolutionary algorithms for the longest common subsequence problem, Proceedings of the 9th annual conference on Genetic and evolutionary computation, pp.939-946, 2007.

T. Jiang and M. Li, On the approximation of shortest common supersequences and longest common subsequences, SIAM Journal on Computing, vol.24, pp.1122-1139, 1995.

T. Jiang, G. Lin, B. Ma, and K. Zhang, A general edit distance between rna structures, Journal of computational biology, vol.9, pp.371-388, 2002.

T. Johtela, J. Smed, H. Hakonen, and T. Raita, An efficient heuristic for the lcs problem, Third South American workshop on string processing, pp.126-140, 1996.

B. A. Julstrom and B. Hinkemeyer, Starting from scratch: Growing longest common subsequences with evolution, in: Parallel Problem Solving from Nature-PPSN IX, pp.930-938, 2006.

L. Libralesso, A. M. Bouhassoun, H. Cambazard, and V. Jost, Tree searches for the Sequential Ordering Problem, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02374896

L. Libralesso and F. Fontan, An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02531037

S. Y. Lu and K. S. Fu, A sentence-to-sentence clustering procedure for pattern analysis, IEEE Transactions on Systems, Man, and Cybernetics, vol.8, pp.381-389, 1978.

S. R. Mousavi and F. Tabataba, An improved algorithm for the longest common subsequence problem, Computers & Operations Research, vol.39, pp.512-520, 2012.

D. R. Reddy, Speech understanding systems: A summary of results of the five-year research effort. department of computer science, 1977.

T. K. Sellis, Multiple-query optimization, ACM Transactions on Database Systems (TODS), vol.13, pp.23-52, 1988.

S. J. Shyu and C. Y. Tsai, Finding the longest common subsequence for multiple biological sequences by ant colony optimization, Computers & Operations Research, vol.36, pp.73-91, 2009.

A. Singireddy, Solving the longest common subsequence problem in bioinformatics, 2003.

F. S. Tabataba and S. R. Mousavi, A hyper-heuristic for the longest common subsequence problem, Computational biology and chemistry, vol.36, pp.42-54, 2012.

H. Wang, J. Zhong, and D. Zhang, A duplicate code checking algorithm for the programming experiment, 2015 Second International Conference on Mathematics and Computers in Sciences and in Industry (MCSI), pp.39-42, 2015.

D. Weyland, Simulated annealing, its parameter settings and the longest common subsequence problem, Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp.803-810, 2008.

J. Yang, Y. Xu, Y. Shang, and G. Chen, A space-bounded anytime algorithm for the multiple longest common subsequence problem, IEEE transactions on knowledge and data engineering, vol.26, pp.2599-2609, 2014.

W. Zhang, Complete anytime beam search, pp.425-430, 1998.