The agreement distance of unrooted phylogenetic networks
A rearrangement operation makes a small graph-theoretical change to a phylogenetic network to transform it into another one. For unrooted phylogenetic trees and networks, popular rearrangement operations are tree bisection and reconnection (TBR) and prune and regraft (PR) (called subtree prune and r...
Main Author: | Jonathan Klawitter |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2020-07-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/5709/pdf |
Similar Items
-
The agreement distance of rooted phylogenetic networks
by: Jonathan Klawitter
Published: (2019-05-01) -
Nonrepetitive edge-colorings of trees
by: A. Kündgen, et al.
Published: (2017-06-01) -
Span of a Graph: Keeping the Safety Distance
by: Iztok Banič, et al.
Published: (2023-03-01) -
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Hanna Furmańczyk, et al.
Published: (2022-11-01) -
The structure and the list 3-dynamic coloring of outer-1-planar graphs
by: Yan Li, et al.
Published: (2021-08-01)