Abstract

A cladistic character can be viewed as a type of set-labeled tree. This representation is used to derive a recurrence equation giving the number t( n,r) of cladistic characters on n species having r states. Values for t( n,r) are given for r up to 5 and n up to 30.

Full Text
Paper version not known

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 call

Disclaimer: 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.