Characterizing local optima for maximum parsimony
From MaRDI portal
Publication:309903
DOI10.1007/S11538-016-0174-0zbMATH Open1348.92116OpenAlexW2406979549WikidataQ36032835 ScholiaQ36032835MaRDI QIDQ309903FDOQ309903
Authors: Ellen Urheim, Katherine St. John, Eric B. Ford 
Publication date: 7 September 2016
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11538-016-0174-0
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
- Introduction to algorithms
- Title not available (Why is that?)
- Subtree transfer operations and their induced metrics on evolutionary trees
- Parsimonious phylogenetic trees in metric spaces and simulated annealing
- The Steiner problem in phylogeny is NP-complete
- The performance of neighbor-joining methods of phylogenetic reconstruction
- Reconstructing evolution of sequences subject to recombination using parsimony
- Proving phylogenetic trees minimal with l-clustering and set partitioning
- Branch and bound algorithms to determine minimal evolutionary trees
- Taxonomy with confidence
- Retractions of finite distance functions onto tree metrics
- Landscapes on spaces of trees
- Efficiency of local search with multiple local optima
- Efficient algorithms for inverting evolution
- Comparison of labeled trees with valency three
- Title not available (Why is that?)
Cited In (6)
- Heading in the right direction? Using head moves to traverse phylogenetic network space
- A tabu search algorithm for maximum parsimony phylogeny inference
- The Worst Case Complexity of Maximum Parsimony
- Landscapes on spaces of trees
- A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization
- Most parsimonious likelihood exhibits multiple optima for compatible characters
Uses Software
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)
