Optimal Bounds for Computing \alpha α -gapped Repeats.

Maxime Crochemore Roman Kolpakov Gregory Kucherov

Published in: LATA (2016)

Keyphrases

worst case
asymptotically optimal
dynamic programming
upper bound
lower bound
optimal cost
optimal control
tight bounds
neural network
information retrieval
information systems
optimal solution
special case
state space
upper and lower bounds
efficiently computable