Constructing tree-child networks from distance matrices

DOI10.1007/S00453-017-0320-6MaRDI QIDQ724232zbMATH OpenOpenAlexFDO

Authors Magnus Bordewich, Charles Semple, N. Tokac

Publication date 25 July 2018

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL http://dro.dur.ac.uk/21622/1/21622.pdf

zbMATH Keywords

distance matrixtree-child networkstack-free network

Mathematics Subject Classification ID

Problems related to evolution (92D15) Analysis of algorithms (68W40) Distance in graphs (05C12)

Recommendations

• Distance matrix and Laplacian of a tree with attached graphs
• An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
• Algorithms and Computation
• Combinatorial network abstraction by trees and distances
• A fast algorithm for constructing trees from distance matrices
• Distance approximating trees in graphs
• scientific article; zbMATH DE number 1107549
• Tree-child cluster networks
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
• scientific article; zbMATH DE number 5005342

Cites work

• An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
• Determining phylogenetic networks from inter-taxa distances
• Mathematical Foundations of Computer Science 2005
• Reconstruction of certain phylogenetic networks from their tree-average distances

Cited in

(18)

• Phylogenetic networks that are their own fold-ups
• Identifiability of local and global features of phylogenetic networks from average distances
• scientific article; zbMATH DE number 1107549 (Why is no real title available?)
• Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
• Level-\(2\) networks from shortest and longest distances
• Unique reconstruction of tree-like phylogenetic networks from distances between leaves
• Determining triangulations and quadrangulations by boundary distances
• Classes of explicit phylogenetic networks and their biological and mathematical significance
• Determining phylogenetic networks from inter-taxa distances
• Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
• An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
• Orchard networks are trees with additional horizontal arcs
• Tree-child cluster networks
• The SNPR neighbourhood of tree-child networks
• Mathematical Foundations of Computer Science 2005
• Algorithms and Computation
• Recovering normal networks from shortest inter-taxa distance information

This page was built for publication: Constructing tree-child networks from distance matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724232)