Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.

Anders Dessmark Jesper Jansson Andrzej Lingas Eva-Marta Lundell

Published in: Algorithmica (2007)

Keyphrases

computational complexity
orders of magnitude
learning algorithm
special case
worst case
optimization problems
data structure
computational cost
benchmark datasets
data sets
data mining
machine learning
decision trees
significant improvement
theoretical analysis
computationally expensive