Abstract
This paper describes algorithms for optimizing two- or three-dimensional landmark data onto trees directly. The method is based on a first approximation using grids, and subsequent iterative refinement of the initial point estimates. Details of the implementation are discussed, as well as an empirical example. © The Willi Hennig Society 2010.
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 callMore From: Cladistics : the international journal of the Willi Hennig Society
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.
