Pages that link to "Item:Q4077102"
From MaRDI portal
The following pages link to Locating the vertices of a steiner tree in an arbitrary metric space (Q4077102):
Displaying 16 items.
- Counting and sampling SCJ small parsimony solutions (Q740977) (← links)
- A lower bound for the breakpoint phylogeny problem (Q876716) (← links)
- Minimally colored trees (Q908876) (← links)
- Worst-case minimum rectilinear Steiner trees in all dimensions (Q1192611) (← links)
- Fixed topology Steiner trees and spanning forests (Q1285596) (← links)
- A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization (Q1344859) (← links)
- The Steiner ratio for the dual normed plane (Q1363707) (← links)
- The computational complexity of calculating partition functions of optimal medians with Hamming distance (Q1631451) (← links)
- Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology (Q1709982) (← links)
- Minimum Steiner trees in normed planes (Q1802220) (← links)
- A tight lower bound for the Steiner ratio in Minkowski planes (Q1896344) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- Semimetric Properties of Sørensen-Dice and Tversky Indexes (Q2803837) (← links)
- Weber's problem and weiszfeld's algorithm in general spaces (Q3871838) (← links)
- How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree (Q4992754) (← links)
- On Computing the Maximum Parsimony Score of a Phylogenetic Network (Q5251626) (← links)
