Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks

Péter L. Erdős; Andrew Francis; Tamás Róbert Mezei

doi:10.1016/j.dam.2021.02.016

Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks

Péter L. Erdős
, Andrew Francis
, Tamás Róbert Mezei

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

We show that any two tree-based rooted binary phylogenetic networks (with the same number of reticulation nodes and identical degrees at the root) are connected by at most [Formula presented] rooted nearest-neighbour interchange (rNNI) moves. As a corollary of the proof we obtain that the diameter is at most a 2k additive term larger for distance-1 tail moves.

Original language	English
Pages (from-to)	205-213
Number of pages	9
Journal	Discrete Applied Mathematics
Volume	294
DOIs	https://doi.org/10.1016/j.dam.2021.02.016
Publication status	Published - 15 May 2021

Bibliographical note

Publisher Copyright:
© 2021 The Author(s)

Access to Document

10.1016/j.dam.2021.02.016

Cite this

@article{fa12d229ae1f460c8317ea7d09bfa47d,

title = "Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks",

abstract = "We show that any two tree-based rooted binary phylogenetic networks (with the same number of reticulation nodes and identical degrees at the root) are connected by at most [Formula presented] rooted nearest-neighbour interchange (rNNI) moves. As a corollary of the proof we obtain that the diameter is at most a 2k additive term larger for distance-1 tail moves.",

author = "Erd{\H o}s, \{P{\'e}ter L.\} and Andrew Francis and Mezei, \{Tam{\'a}s R{\'o}bert\}",

note = "Publisher Copyright: {\textcopyright} 2021 The Author(s)",

year = "2021",

month = may,

day = "15",

doi = "10.1016/j.dam.2021.02.016",

language = "English",

volume = "294",

pages = "205--213",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier North-Holland",

}

TY - JOUR

T1 - Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks

AU - Erdős, Péter L.

AU - Francis, Andrew

AU - Mezei, Tamás Róbert

PY - 2021/5/15

Y1 - 2021/5/15

N2 - We show that any two tree-based rooted binary phylogenetic networks (with the same number of reticulation nodes and identical degrees at the root) are connected by at most [Formula presented] rooted nearest-neighbour interchange (rNNI) moves. As a corollary of the proof we obtain that the diameter is at most a 2k additive term larger for distance-1 tail moves.

AB - We show that any two tree-based rooted binary phylogenetic networks (with the same number of reticulation nodes and identical degrees at the root) are connected by at most [Formula presented] rooted nearest-neighbour interchange (rNNI) moves. As a corollary of the proof we obtain that the diameter is at most a 2k additive term larger for distance-1 tail moves.

UR - http://hdl.handle.net/1959.7/uws:62779

U2 - 10.1016/j.dam.2021.02.016

DO - 10.1016/j.dam.2021.02.016

M3 - Article

SN - 0166-218X

VL - 294

SP - 205

EP - 213

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

ER -

Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this