3 papers
q-bio.PE2025
Tree rearrangement graphs admit paths of decreasing Robinson-Foulds distance
Lena Collienne, Frederick A Matsen
Tree rearrangements such as Nearest Neighbor Interchange (NNI) and Subtree Prune and Regraft (SPR) are commonly used to explore phylogenetic treespace. Computing distances based on…
q-bio.PE2021
The Geometry of the space of Discrete Coalescent Trees
Lena Collienne, Kieran Elmes, Mareike Fischer +2
Computational inference of dated evolutionary histories relies upon various hypotheses about RNA, DNA, and protein sequence mutation rates. Using mutation rates to infer these date…
cs.DS2020
Computing nearest neighbour interchange distances between ranked phylogenetic trees
Lena Collienne, Alex Gavryushkin
Many popular algorithms for searching the space of leaf-labelled trees are based on tree rearrangement operations. Under any such operation, the problem is reduced to searching a g…