scientific article; zbMATH DE number 2044913

zbMATH Open1042.68616MaRDI QIDQ4448740FDOQ4448740

Hans-Jürgen Bandelt

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2204/22040001.htm

Title of this publication is not available (Why is that?)

Recommendations

• Quasi-median hulls in Hamming space are Steiner hulls
• The Steiner tree problem
• Shortest trees and Steiner trees with rectilinear distances
• The role of Steiner hulls in the solution to Steiner tree problems
• Steiner hull algorithm for the uniform orientation metrics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorics on words (68R15)

Cited In (4)

• On the number of binary characters needed to recover a phylogeny using maximum parsimony
• Computing the blocks of a quasi-median graph
• Quasi-median hulls in Hamming space are Steiner hulls
• Parsimonious phylogenetic trees in metric spaces and simulated annealing

This page was built for publication:

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