<Table> <Tr> <Td> </Td> <Td> This article may be too long to read and navigate comfortably . Please consider splitting content into sub-articles, condensing it, or adding or removing subheadings . (July 2015) </Td> </Tr> </Table> <Tr> <Td> </Td> <Td> This article may be too long to read and navigate comfortably . Please consider splitting content into sub-articles, condensing it, or adding or removing subheadings . (July 2015) </Td> </Tr> <P> In phylogenetics, maximum parsimony is an optimality criterion under which the phylogenetic tree that minimizes the total number of character - state changes is to be preferred . Under the maximum - parsimony criterion, the optimal tree will minimize the amount of homoplasy (i.e., convergent evolution, parallel evolution, and evolutionary reversals). In other words, under this criterion, the shortest possible tree that explains the data is considered best . The principle is akin to Occam's razor, which states that--all else being equal--the simplest hypothesis that explains the data should be selected . Some of the basic ideas behind maximum parsimony were presented by James S. Farris in 1970 and Walter M. Fitch in 1971 . </P> <P> Maximum parsimony is an intuitive and simple criterion, and it is popular for this reason . However, although it is easy to score a phylogenetic tree (by counting the number of character - state changes), there is no algorithm to quickly generate the most - parsimonious tree . Instead, the most - parsimonious tree must be found in "tree space" (i.e., amongst all possible trees). For a small number of taxa (i.e., fewer than nine) it is possible to do an exhaustive search, in which every possible tree is scored, and the best one is selected . For nine to twenty taxa, it will generally be preferable to use branch - and - bound, which is also guaranteed to return the best tree . For greater numbers of taxa, a heuristic search must be performed . </P>

Based on the principle of parsimony which tree is our preferred hypothesis