Computing the blocks of a quasi-median graph

DOI10.1016/j.dam.2014.07.013zbMath1303.05029arXiv1206.6135OpenAlexW2151358997MaRDI QIDQ477343

Sven Herrmann, Vincent L. Moulton

Publication date: 3 December 2014

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

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

zbMATH Keywords

Steiner treesmedian graphmitochondrial evolutionmost parsimonious treesquasi-median graph

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Cell biology (92C37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for computing cutpoints in finite metric spaces
• Visualization of quasi-median networks
• Quasi-median hulls in Hamming space are Steiner hulls
• Axiomatic characterization of the interval function of a graph
• The Steiner problem in phylogeny is NP-complete
• Trees, taxonomy, and strongly compatible multi-state characters
• Quasi-median graphs from sets of partitions
• Blocks and Cut Vertices of the Buneman Graph
• Statistical Inference of Phylogenies
• Quasi‐median graphs and algebras

This page was built for publication: Computing the blocks of a quasi-median graph