This is an algorithm for searching for the MPHC_Maximum_Parsimony tree using the branch-and boundRH_Branch_and_Bound_algorithm search method. See Nei & Kumar (2000)Nei_and_Kumar_2000 for details.