Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances

DOI10.1016/j.aam.2020.102075zbMath1447.05190arXiv1910.13853OpenAlexW3040650981MaRDI QIDQ2197914

Yukihiro Murakami, Leo van Iersel, Vincent L. Moulton

Publication date: 1 September 2020

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.13853

zbMATH Keywords

reconstructibilitydistance matrixphylogenetic networkslevel-\(k\) networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Population dynamics (general) (92D25)

Related Items (3)

Identifiability of species network topologies from genomic sequences using the logDet distance ⋮ Level-\(2\) networks from shortest and longest distances ⋮ The tree of blobs of a species network: identifiability under the coalescent

Uses Software

• T-REX

Cites Work

• Determining phylogenetic networks from inter-taxa distances
• An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
• Recovering normal networks from shortest inter-taxa distance information
• Constructing tree-child networks from distance matrices
• Unique reconstruction of tree-like phylogenetic networks from distances between leaves
• On optimal realizations of finite metric spaces by graphs
• Polynomial-time algorithms for phylogenetic inference problems
• Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
• Recognizing and realizing cactus metrics
• Reconstructing Cactus Graphs from Shortest Path Information
• Distance matrix of a graph and its realizability
• Reconstruction of Cacti

This page was built for publication: Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances