A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Geometry of Ranked Nearest Neighbour Interchange Space of Phylogenetic Trees
In this paper we study the graph of ranked phylogenetic trees where the adjacency relation is given by a local rearrangement of the tree structure. Our work is motivated by tree inference algorithms, such as maximum likelihood and Markov Chain Monte Carlo methods, where the geometry of the search space plays a central role for efficiency and practicality of the optimisation. We hence focus on understanding the geometry of the space (graph) of ranked trees, the so-called ranked nearest neighbourdoi:10.1101/2019.12.19.883603 fatcat:kgopa4jff5gt7owhcn4qjlx7qy