Login / Signup
Dynamic programming algorithms for the mosaic longest common subsequence problem.
Kuo-Si Huang
Chang-Biau Yang
Kuo-Tsung Tseng
Yung-Hsing Peng
Hsing-Yen Ann
Published in:
Inf. Process. Lett. (2007)
Keyphrases
</>
dynamic programming algorithms
beam search
dynamic programming
branch and bound
heuristic search
search algorithm
optimal policy
search methods
hill climbing
search problems
np complete
upper bound
ranking functions
markov decision processes
state space
np complete problems
neural network