An algorithm for bounding extremal functions of forbidden sequences.

Published in: CoRR (2019)

Keyphrases

experimental evaluation
computationally efficient
dynamic programming
selection algorithm
k means
significant improvement
np hard
learning algorithm
optimal solution

recognition algorithm
cost function
high accuracy
classification algorithm
linear programming
matching algorithm
path planning
times faster

improved algorithm
suffix tree
sequence matching
detection algorithm
theoretical analysis
computational complexity
decision trees
ant colony optimization

tree structure
optimization algorithm
worst case
computational cost
convergence rate
search space
data structure
similarity measure