An Optimal Algorithm for Computing All Subtree Repeats in Trees.
Tomás FlouriKassian KobertSolon P. PissisAlexandros StamatakisPublished in: IWOCA (2013)
Keyphrases
- dynamic programming
- tree structure
- optimal solution
- experimental evaluation
- computational complexity
- learning algorithm
- worst case
- matching algorithm
- times faster
- detection algorithm
- globally optimal
- search space
- np hard
- cost function
- expectation maximization
- computational cost
- high accuracy
- classification trees
- segmentation algorithm
- optimization algorithm
- convergence rate
- exhaustive search
- search tree
- linear programming
- locally optimal
- binary search trees
- path planning
- particle swarm optimization
- scheduling problem
- probabilistic model
- lower bound
- search algorithm
- decision trees