We find a constructive bound for the word length of a generating set for the centralizer of an element of the Mapping Class Group. As a consequence, we show that it is algorithmically decidable whether two postcritically finite branched coverings of the sphere are Thurston equivalent.