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

DOI10.1007/BF01681346MaRDI QIDQ4077102zbMATH OpenOpenAlexFDO

Authors David Sankoff, Pascale Rousseau

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

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

Cites work

• A note on Fermat's problem
• An algorithm for the distance between two finite sequences
• scientific article; zbMATH DE number 3401212 (Why is no real title available?)
• Minimal Mutation Trees of Sequences
• On Steiner Minimal Trees with Rectilinear Distance
• On Steiner’s Problem with Rectilinear Distance
• On the Problem of Steiner
• Steiner Minimal Trees
• The String-to-String Correction Problem

Cited in

(20)

• Worst-case minimum rectilinear Steiner trees in all dimensions
• Fixed topology Steiner trees and spanning forests
• A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization
• The Steiner ratio for the dual normed plane
• The computational complexity of calculating partition functions of optimal medians with Hamming distance
• Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
• Minimum Steiner trees in normed planes
• A tight lower bound for the Steiner ratio in Minkowski planes
• Approximation algorithms for tree alignment with a given phylogeny
• Semimetric properties of Sørensen-Dice and Tversky indexes
• Weber's problem and weiszfeld's algorithm in general spaces
• How to infer ancestral genome features by parsimony: dynamic programming over an evolutionary tree
• On computing the maximum parsimony score of a phylogenetic network
• A Sankoff-Rousseau-like algorithm for minimizing lateral gene transfers and losses on single origin characters
• The tree labeling polytope: a unified approach to ancestral reconstruction problems
• Dynamic programming algorithms for fast and accurate cell lineage tree reconstruction from CRISPR-based lineage tracing data
• Node coincidence in metric minimum weighted length graph embeddings
• Counting and sampling SCJ small parsimony solutions
• A lower bound for the breakpoint phylogeny problem
• Minimally colored trees

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

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