Characterizing local optima for maximum parsimony
From MaRDI portal
Publication:309903
DOI10.1007/s11538-016-0174-0zbMath1348.92116OpenAlexW2406979549WikidataQ36032835 ScholiaQ36032835MaRDI QIDQ309903
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
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing evolution of sequences subject to recombination using parsimony
- Parsimonious phylogenetic trees in metric spaces and simulated annealing
- The performance of neighbor-joining methods of phylogenetic reconstruction
- Proving phylogenetic trees minimal with l-clustering and set partitioning
- Branch and bound algorithms to determine minimal evolutionary trees
- The Steiner problem in phylogeny is NP-complete
- 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
- Subtree transfer operations and their induced metrics on evolutionary trees
This page was built for publication: Characterizing local optima for maximum parsimony