Locating the vertices of a steiner tree in an arbitrary metric space

DOI10.1007/BF01681346zbMath0315.90073OpenAlexW1972390207MaRDI QIDQ4077102

Pascale Rousseau, David Sankoff

Publication date: 1975

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01681346

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) General biology and biomathematics (92B05) Mathematical programming (90C99) Hamilton-Jacobi theories (49L99)

Related Items (16)

The computational complexity of calculating partition functions of optimal medians with Hamming distance ⋮ A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization ⋮ A tight lower bound for the Steiner ratio in Minkowski planes ⋮ The Steiner ratio for the dual normed plane ⋮ A lower bound for the breakpoint phylogeny problem ⋮ Approximation algorithms for tree alignment with a given phylogeny ⋮ Minimally colored trees ⋮ Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology ⋮ Worst-case minimum rectilinear Steiner trees in all dimensions ⋮ Weber's problem and weiszfeld's algorithm in general spaces ⋮ Semimetric Properties of Sørensen-Dice and Tversky Indexes ⋮ Minimum Steiner trees in normed planes ⋮ Counting and sampling SCJ small parsimony solutions ⋮ Fixed topology Steiner trees and spanning forests ⋮ How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree ⋮ On Computing the Maximum Parsimony Score of a Phylogenetic Network

Cites Work

• Unnamed Item
• An algorithm for the distance between two finite sequences
• On the Problem of Steiner
• Minimal Mutation Trees of Sequences
• On Steiner Minimal Trees with Rectilinear Distance
• The String-to-String Correction Problem
• On Steiner’s Problem with Rectilinear Distance
• Steiner Minimal Trees
• A note on Fermat's problem

This page was built for publication: Locating the vertices of a steiner tree in an arbitrary metric space