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

DOI10.1016/j.jda.2012.11.004zbMath1267.68319OpenAlexW2093750732MaRDI QIDQ2376791

Muhammad Rashed Alam, M. Sohel Rahman

Publication date: 24 June 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.11.004

zbMATH Keywords

dynamic programminglongest common subsequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Dynamic programming (90C39) Algorithms on strings (68W32)

Cites Work

• Quadratic-time algorithm for a string constrained LCS problem
• On the generalized constrained longest common subsequence problems
• New efficient algorithms for the LCS and constrained LCS problems
• The constrained longest common subsequence problem
• A simple algorithm for the constrained sequence problems
• ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS

This page was built for publication: The substring inclusion constraint longest common subsequence problem can be solved in quadratic time