The substring inclusion constraint longest common subsequence problem can be solved in quadratic time

Muhammad Rashed Alam, M. Sohel Rahman. The substring inclusion constraint longest common subsequence problem can be solved in quadratic time. J. Discrete Algorithms, 17:67-73, 2012. [doi]

Abstract

Abstract is missing.