Quasi-median hulls in Hamming space are Steiner hulls

DOI10.1016/j.dam.2006.09.015zbMath1191.05036OpenAlexW2031687195MaRDI QIDQ1003664

Arne Röhl, Hans-Jürgen Bandelt

Publication date: 4 March 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2006.09.015

zbMATH Keywords

Hamming distanceSteiner minimal treeHamming spacemaximum parsimonyquasi-median operationSteiner hull

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (4)

On the \(P_3\)-hull number of Hamming graphs ⋮ Representing and extending ensembles of parsimonious evolutionary histories with a directed acyclic graph ⋮ Visualization of quasi-median networks ⋮ Computing the blocks of a quasi-median graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner problem in phylogeny is NP-complete
• The Steiner tree problem
• On the existence of subalgebras of direct products with prescribed d-fold projections
• Steiner minimal trees
• Quasi-median graphs from sets of partitions
• Sufficient Conditions for Two Tree Reconstruction Techniques to Succeed on Sufficiently Long Sequences
• Median Algebra
• Minimal Mutation Trees of Sequences
• Algorithms on Strings, Trees and Sequences
• Quasi‐median graphs and algebras

This page was built for publication: Quasi-median hulls in Hamming space are Steiner hulls