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]

Authors

Muhammad Rashed Alam

This author has not been identified. Look up 'Muhammad Rashed Alam' in Google

M. Sohel Rahman

This author has not been identified. Look up 'M. Sohel Rahman' in Google