Login / Signup
On the parameterized complexity of the repetition free longest common subsequence problem.
Guillaume Blin
Paola Bonizzoni
Riccardo Dondi
Florian Sikora
Published in:
Inf. Process. Lett. (2012)
Keyphrases
</>
parameterized complexity
beam search
global constraints
fixed parameter tractable
branch and bound
search algorithm
database systems
heuristic search