Background Info... This example applies cladistics methods to compare trees and determine the shortest tree among them. Figure 3 lists five taxa with a variety of characteristics. In this example, taxon A has been designated as the outgroup. Character Actual changes Minimum changes A B C Number of sides Character Character State Outline Color Number of sides 30 Color _Number of sides 4 = 1 Equal angles 5 = 2 Outline Equal angles Outline 2 Color Blue = 0 0 0 Orange = 1 Equal angles Number of sides Total Yes = 0 0 Equal angles No = 1 Outline 0 Consistency index 5/7 = Single = 0 Double = 1 .71 1. For 4 taxa, there are 15 possible trees. One tree is presented in Data Table 2. Create the other 14 permutations in the space provided in Data Table 2. 1A. Create a list of potential characters. You will need at least four character traits. Write the name of your outgroup next to "A" in Data Table 1. For each character, record whether it is the same as the outgroup (value of 0) or different (value of 1). Use the trees created in step 1 to map your characters onto each of these trees to determine the most parsimonious tree. Tree 1 Character Actual changes Minimum changes A B C D Total Consistency index Tree 2 Character Actual changes Minimum changes Total Consistency index Tree 3 Character Actual changes Minimum changes Data Table 1. Character Character states Background Info... This example applies cladistics methods to compare trees and determine the shortest tree among them. Figure 3 lists five taxa with a variety of characteristics. In this example, taxon A has been designated as the outgroup. Character Actual changes Minimum changes A B C Number of sides Character Character State Outline Color Number of sides 30 Color _Number of sides 4 = 1 Equal angles 5 = 2 Outline Equal angles Outline 2 Color Blue = 0 0 0 Orange = 1 Equal angles Number of sides Total Yes = 0 0 Equal angles No = 1 Outline 0 Consistency index 5/7 = Single = 0 Double = 1 .71 1. For 4 taxa, there are 15 possible trees. One tree is presented in Data Table 2. Create the other 14 permutations in the space provided in Data Table 2. 1A. Create a list of potential characters. You will need at least four character traits. Write the name of your outgroup next to "A" in Data Table 1. For each character, record whether it is the same as the outgroup (value of 0) or different (value of 1). Use the trees created in step 1 to map your characters onto each of these trees to determine the most parsimonious tree. Tree 1 Character Actual changes Minimum changes A B C D Total Consistency index Tree 2 Character Actual changes Minimum changes Total Consistency index Tree 3 Character Actual changes Minimum changes Data Table 1. Character Character states
