Login / Signup
A branch-and-cut approach to the repetition-free longest common subsequence problem.
Carlos Eduardo Ferreira
Christian Tjandraatmadja
Published in:
Electron. Notes Discret. Math. (2010)
Keyphrases
</>
beam search
branch and bound
search algorithm
heuristic search
search problems
computer vision
training data
semi supervised
orders of magnitude
metadata
information retrieval
feature selection
multimedia
genetic algorithm ga
planning problems