The agreement distance of rooted phylogenetic networks
The minimal number of rooted subtree prune and regraft (rSPR) operations needed to transform one phylogenetic tree into another one induces a metric on phylogenetic trees - the rSPR-distance. The rSPR-distance between two phylogenetic trees $T$ and $T'$ can be characterised by a maximum agreeme...
Main Author: | Jonathan Klawitter |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2019-05-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/4593/pdf |
Similar Items
-
The agreement distance of unrooted phylogenetic networks
by: Jonathan Klawitter
Published: (2020-07-01) -
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Hanna Furmańczyk, et al.
Published: (2022-11-01) -
Anti-power $j$-fixes of the Thue-Morse word
by: Marisa Gaetz
Published: (2021-02-01) -
The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial
by: Richard C Brewster, et al.
Published: (2022-11-01) -
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order
by: Ioannis Michos, et al.
Published: (2019-11-01)