Abstract
Unordered binary trees, or dendrograms, have applications in numerical taxonomy in classifying relations among various species. The “crossover” or “nearest neighbor interchange” metric has been proposed to measure the similarity of alternative classification schemes. This paper resolves a conjecture concerning a proposed algorithm for computing this metric and presents new results on distance statistics for dendrograms having a small number of leaves.
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.
