A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization

DOI10.1007/BF01195680zbMath0809.92011OpenAlexW2053612111MaRDI QIDQ1344859

Yvon Abel, David Sankoff, Jotun J. Hein

Publication date: 22 February 1995

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01195680

zbMATH Keywords

heuristicsmolecular evolutionlocal optimizationstopping rulesbacktrackingphylogenetic inferencehill-climbing strategytree optimization\(k\)-subtreesnearest-neighbor interchangeparsimony analysis

Mathematics Subject Classification ID

Problems related to evolution (92D15) Differential games and control (49N70) Pursuit and evasion games (49N75) Mathematical programming (90C99)

Uses Software

• PAUP*

Cites Work

• Locating the vertices of a steiner tree in an arbitrary metric space

This page was built for publication: A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization