, Tight hardness results for LCS and other sequence similarity measures, IEEE 56th Annual Symposium on Foundations of Computer Science, pp.59-78, 2015.
, Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings, Information Processing Letters, vol.23, issue.2, pp.63-69, 1986.
, A survey of longest common subsequence algorithms, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, pp.39-48, 2000.
, Sparse dynamic programming I: linear cost functions, J. ACM, vol.39, issue.3, pp.519-545, 1992.
, Maximal common subsequences and minimal common supersequences. Information and Computation, vol.124, pp.145-153, 1996.
, Algorithms for the longest common subsequence problem, J. ACM, vol.24, issue.4, pp.664-675, 1977.
, A fast algorithm for computing longest common subsequences, Commun. ACM, vol.20, issue.5, pp.350-353, 1977.
, On the enumeration of minimal dominating sets and related notions, SIAM Journal on Discrete Mathematics, vol.28, issue.4, pp.1916-1929, 2014.
, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM Journal on Computing, vol.9, issue.3, pp.558-565, 1980.
, A faster algorithm computing string edit distances, Journal of Computer and System Sciences, vol.20, issue.1, pp.18-31, 1980.
, Maximal common subsequence algorithms, Annual Symposium on Combinatorial Pattern Matching (CPM 2018), volume 105 of Leibniz International Proceedings in Informatics (LIPIcs), vol.1, pp.1-1, 2018.
, The string-to-string correction problem, J. ACM, vol.21, issue.1, pp.168-173, 1974.