Skip to content

Author

Lena Collienne

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#edge computing Open access Oct 2026

Tree Rearrangement Graphs Admit Paths of Decreasing Robinson-Foulds Distance

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 them, however, is often intractable, so the efficiently computable Robinson-Foulds (RF) distance is used in practice. We investigate how th...

Lena Collienne, F. Matsen · 0 citations
Open access Aug 2026

Unifying Phylogenetic Traversal and Deep Learning to Guide Tree Exploration.

Deep learning offers hope for more efficient phylogenetic inference methods. However, it has yet to have the transformative effect on phylogenetics that it has had in other fields. Here we present a novel approach that combines deep learning with concepts behind current successful phylogenetic algorithms. Specifically,...

Lena Collienne, Harry Richman, David H. Rich et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.