Login / Signup

Efficient algorithms for the longest common subsequence problem with sequential substring constraints.

Chiou-Ting TsengChang-Biau YangHsing-Yen Ann
Published in: J. Complex. (2013)
Keyphrases
  • beam search
  • constraint satisfaction
  • constrained optimization
  • data structure
  • heuristic search
  • global constraints
  • search engine
  • co occurrence
  • domain specific
  • hamming distance
  • linear constraints