Abstract
AbstractFarris (1983) stated that the rationale of the parsimony criterion was to minimize extra (i.e. non‐minimal) steps. For traditional characters, this is equivalent to minimizing total steps (i.e. length). Under dynamic homology (sensu Wheeler, 2001), this identity is broken. Here, it is shown that extra steps (but not total) can be minimized trivially (to zero) for all data sets on all trees when insertion‐deletion events are considered.© The Willi Hennig Society 2011.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
