Skip to content

Weekly reading: Character types and coding methods

Second chapter in the “let’s get some practice” series. In this week’s reading practice we will explore the interaction of alternative coding schemes and tree/optimization outcomes, both “by hand” and with WinClada and NONA. In particular, we will apply and compare simple binary, non-additive multi-state, and complex additive character coding schemes. We will assess their effects on cladogram length and on the character state optimizations along the internal cladogram nodes. We will start by learning how to code complex character state hierarchies as additive binary as well as additive multi-state characters. Please do some reading of the handout beforehand.

Leave a Reply

You may use basic HTML in your comments. Your email address will not be published.

Subscribe to this comment feed via RSS