Parsimonious phylogenetic trees in metric spaces and simulated annealing
DOI10.1016/0196-8858(87)90003-0zbMath0637.92024OpenAlexW2034145232MaRDI QIDQ1099115
Andreas W. M. Dress, Michael Krüger
Publication date: 1987
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-8858(87)90003-0
simulated annealingSteiner treesstochastic search algorithmtree topologyhierarchical kinship relationsinterpretation algorithmspin glass Hamiltonians of k- meshed graphsSteiner interpretationssubsets of metric spaces
Trees (05C05) Problems related to evolution (92D15) Other natural sciences (mathematical treatment) (92F05)
Related Items (8)
Cites Work
- Optimization by Simulated Annealing
- Reconstructing the shape of a tree from observed dissimilarity data
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Proving phylogenetic trees minimal with l-clustering and set partitioning
- Rewarding maps: On greedy optimization of set functions
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Equation of State Calculations by Fast Computing Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Parsimonious phylogenetic trees in metric spaces and simulated annealing