Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem