The Worst Case Complexity of Maximum Parsimony

DOI10.1007/978-3-319-07566-2_9MaRDI QIDQ5165594zbMATH OpenOpenAlexFDO

Authors Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson

Publication date 30 June 2014

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07566-2_9

Mathematics Subject Classification ID

Algorithms on strings (68W32) Problems related to evolution (92D15)

Recommendations

• The computational complexity of inferring rooted phylogenies by parsimony
• The Parameterized Complexity of Maximality and Minimality Problems
• The parameterized complexity of maximality and minimality problems
• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
• Characterizing local optima for maximum parsimony
• On computing the maximum parsimony score of a phylogenetic network
• The complexity of phylogeny constraint satisfaction
• Complexity and approximability of parameterized MAX-CSPs
• Complexity and Approximability of Parameterized MAX-CSPs

Cited in

(7)

• A more efficient algorithm for MPR problems in phylogeny
• Lattice-theoretic properties of MPR-posets in phylogeny
• On the complexity of computing MP distance between binary phylogenetic trees
• On the complexity of MMSNP
• Characterizing local optima for maximum parsimony
• Adaptive memory programming: local search parallel algorithms for phylogenetic tree construc\-tion
• A subdivision approach to maximum parsimony

This page was built for publication: The Worst Case Complexity of Maximum Parsimony

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5165594)