Probability Steiner trees and maximum parsimony in phylogenetic analysis
From MaRDI portal
(Redirected from Publication:393567)
Recommendations
- A subdivision approach to maximum parsimony
- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- Computing Steiner points and probability Steiner points in \(\ell _{1}\) and \(\ell _{2}\) metric spaces
- Parsimonious phylogenetic trees in metric spaces and simulated annealing
- scientific article; zbMATH DE number 1303534
Cites work
- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- Computing Steiner points and probability Steiner points in \(\ell _{1}\) and \(\ell _{2}\) metric spaces
- Computing steiner minimum trees in Hamming metric
- Dynamic programming for minimum Steiner trees
- Faster Steiner Tree Computation in Polynomial-Space
- Global optimization. From theory to implementation.
- Minimal Mutation Trees of Sequences
- Statistical methods in bioinformatics. An introduction.
- The Steiner problem in phylogeny is NP-complete
Cited in
(6)- A novel approach to phylogenetic trees: d‐Dimensional geometric Steiner trees
- Computing phylogenetic trees using topologically related minimum spanning trees
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
- The number of evolutionary steps on random and minimum length trees for random evolutionary data
- A subdivision approach to maximum parsimony
- Parsimonious phylogenetic trees in metric spaces and simulated annealing
This page was built for publication: Probability Steiner trees and maximum parsimony in phylogenetic analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393567)
