Parsimonious phylogenetic trees in metric spaces and simulated annealing

DOI10.1016/0196-8858(87)90003-0zbMath0637.92024MaRDI 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

zbMATH Keywords

simulated annealing; Steiner trees; stochastic search algorithm; tree topology; hierarchical kinship relations; interpretation algorithm; spin glass Hamiltonians of k- meshed graphs; Steiner interpretations; subsets of metric spaces

Mathematics Subject Classification ID

05C05: Trees

92D15: Problems related to evolution

92F05: Other natural sciences (mathematical treatment)

Related Items

Reconstructing the shape of a tree from observed dissimilarity data, Characterizing local optima for maximum parsimony, Was Euclid an unnecessarily sophisticated psychologist?, Two applications of the divide \(\&\) conquer principle in the molecular sciences, Hyperconvexity and tight-span theory for diversities, A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure, Matchings and phylogenetic trees

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