Login / Signup
The substring inclusion constraint longest common subsequence problem can be solved in quadratic time.
Muhammad Rashed Alam
M. Sohel Rahman
Published in:
J. Discrete Algorithms (2012)
Keyphrases
</>
beam search
sequential quadratic programming
constrained minimization
search algorithm
data structure
computational complexity
objective function
search methods
space efficient
orders of magnitude
search problems
soft constraints