Level-\(2\) networks from shortest and longest distances

DOI10.1016/j.dam.2021.09.026zbMath1475.92118arXiv2101.08580OpenAlexW3207903341MaRDI QIDQ2243145

Yanyan Li

Publication date: 11 November 2021

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

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

zbMATH Keywords

reconstructibilitydistance matrixphylogenetic networkslevel-k network

Mathematics Subject Classification ID

Problems related to evolution (92D15) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Taxonomy, cladistics, statistics in mathematical biology (92B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

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
• Free trees and bidirectional trees as representations of psychological distance
• Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
• Diagonal tree codes
• Distance matrix of a graph and its realizability

This page was built for publication: Level-\(2\) networks from shortest and longest distances