The full Steiner tree problem in phylogeny
From MaRDI portal
(Redirected from The full Steiner tree problem in phylogeny)
Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Problems related to evolution (92D15)
Recommendations
Cited in
(8)- On the approximability of the Steiner tree problem in phylogeny
- Binary Steiner trees: structural results and an exact solution approach
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
- The Steiner Tree Problem and Its Application to the Modelling of Biomolecular Structures
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- On the approximability of the Steiner tree problem in phylogeny
- The full Steiner tree problem
This page was built for publication: The full Steiner tree problem in phylogeny
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4808628)