Constructing tree-child networks from distance matrices
From MaRDI portal
Publication:724232
DOI10.1007/S00453-017-0320-6zbMATH Open1391.92028OpenAlexW2610964622MaRDI QIDQ724232FDOQ724232
N. Tokac, Charles Semple, Magnus Bordewich
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
Cites Work
Cited In (13)
- Phylogenetic networks that are their own fold-ups
- Identifiability of local and global features of phylogenetic networks from average distances
- Title not available (Why is that?)
- Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
- Determining triangulations and quadrangulations by boundary distances
- Level-\(2\) networks from shortest and longest distances
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
- Orchard networks are trees with additional horizontal arcs
- The SNPR neighbourhood of tree-child networks
- Algorithms and Computation
- Recovering normal networks from shortest inter-taxa distance information
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 π π
- Title not available (Why is that?) π π
- Tree-Child Cluster Networks π π
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees π π
- Title not available (Why is that?) π π
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)