Dynamic programming, 1965. ,
Beam-aco for the longest common subsequence problem, pp.1-8, 2010. ,
Beam search for the longest common subsequence problem, Computers & Operations Research, vol.36, pp.3178-3186, 2009. ,
Experimenting an approximation algorithm for the lcs, Discrete Applied Mathematics, vol.110, pp.13-24, 2001. ,
A hybrid genetic algorithm for the repetition free longest common subsequence problem, Operations Research Letters, vol.41, pp.644-649, 2013. ,
Automatic icd-10 coding algorithm using an improved longest common subsequence based on semantic similarity, PloS one, p.12, 2017. ,
Performance analysis of some simple heuristics for computing longest common subsequences, Algorithmica, vol.12, pp.293-311, 1994. ,
Finding longest common subsequences: New a anytime results, 2019. ,
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. ,
A specialized branching and fathoming technique for the longest common subsequence problem, 2006. ,
A large neighborhood search heuristic for the longest common subsequence problem, Journal of Heuristics, vol.14, pp.271-283, 2008. ,
PackingSolver: a solver for Packing Problems, 2020. ,
Iterative beam search for car sequencing, Annals of Operations Research, vol.226, pp.239-254, 2015. ,
Supersequences of masks for oligo-chips, Journal of bioinformatics and computational biology, vol.2, pp.459-470, 2004. ,
Algorithms on stings, trees, and sequences: Computer science and computational biology, Acm Sigact News, vol.28, pp.41-60, 1997. ,
A model of planning for plan efficiency: Taking advantage of operator overlap, IJCAI, pp.949-953, 1989. ,
A genetic algorithm for the longest common subsequence problem, Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp.609-610, 2006. ,
Computing a longest common subsequence for a set of strings, BIT Numerical Mathematics, vol.24, pp.45-59, 1984. ,
Fast algorithms for finding the common subsequence of multiple sequences, Proceedings of the International Computer Symposium, pp.1006-1011, 2004. ,
An algorithm for differential file comparison, 1976. ,
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. ,
On the approximation of shortest common supersequences and longest common subsequences, SIAM Journal on Computing, vol.24, pp.1122-1139, 1995. ,
A general edit distance between rna structures, Journal of computational biology, vol.9, pp.371-388, 2002. ,
An efficient heuristic for the lcs problem, Third South American workshop on string processing, pp.126-140, 1996. ,
Starting from scratch: Growing longest common subsequences with evolution, in: Parallel Problem Solving from Nature-PPSN IX, pp.930-938, 2006. ,
Tree searches for the Sequential Ordering Problem, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02374896
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02531037
A sentence-to-sentence clustering procedure for pattern analysis, IEEE Transactions on Systems, Man, and Cybernetics, vol.8, pp.381-389, 1978. ,
An improved algorithm for the longest common subsequence problem, Computers & Operations Research, vol.39, pp.512-520, 2012. ,
Speech understanding systems: A summary of results of the five-year research effort. department of computer science, 1977. ,
Multiple-query optimization, ACM Transactions on Database Systems (TODS), vol.13, pp.23-52, 1988. ,
Finding the longest common subsequence for multiple biological sequences by ant colony optimization, Computers & Operations Research, vol.36, pp.73-91, 2009. ,
Solving the longest common subsequence problem in bioinformatics, 2003. ,
A hyper-heuristic for the longest common subsequence problem, Computational biology and chemistry, vol.36, pp.42-54, 2012. ,
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. ,
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. ,
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. ,
Complete anytime beam search, pp.425-430, 1998. ,