Characterizing local optima for maximum parsimony
From MaRDI portal
Recommendations
- A subdivision approach to maximum parsimony
- The Worst Case Complexity of Maximum Parsimony
- A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization
- scientific article; zbMATH DE number 1303534
- Minimizing phylogenetic number to find good evolutionary trees
Cites work
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 3366301 (Why is no real title available?)
- Branch and bound algorithms to determine minimal evolutionary trees
- Comparison of labeled trees with valency three
- Efficiency of local search with multiple local optima
- Efficient algorithms for inverting evolution
- Introduction to algorithms
- Landscapes on spaces of trees
- Parsimonious phylogenetic trees in metric spaces and simulated annealing
- Proving phylogenetic trees minimal with l-clustering and set partitioning
- Reconstructing evolution of sequences subject to recombination using parsimony
- Retractions of finite distance functions onto tree metrics
- Subtree transfer operations and their induced metrics on evolutionary trees
- Taxonomy with confidence
- The Steiner problem in phylogeny is NP-complete
- The performance of neighbor-joining methods of phylogenetic reconstruction
Cited in
(6)- The Worst Case Complexity of Maximum Parsimony
- A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization
- A tabu search algorithm for maximum parsimony phylogeny inference
- Most parsimonious likelihood exhibits multiple optima for compatible characters
- Heading in the right direction? Using head moves to traverse phylogenetic network space
- Landscapes on spaces of trees
This page was built for publication: Characterizing local optima for maximum parsimony
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309903)
