Maximum parsimony recovery conjecture for low-score binary characters
Let be a binary phylogenetic -tree with . For a character alignment consisting of the binary characters of parsimony score on , let . Maximum parsimony recovery conjecture. Then is the unique maximum parsimony tree for . This conjecture formalizes the expectation that maximum parsimony uniquely recovers the generating tree when the number of substitutions is sufficiently small; the paper studies this question locally in the NNI neighborhood and motivates the broader recovery claim.
References
2 papers in this index state this conjecture (2018–2024). The statement above is taken from the most recent of them; the others are arXiv:1808.07098.
Source: Mareike Fischer, “On the correctness of Maximum Parsimony for data with few substitutions in the NNI neighborhood of phylogenetic trees”, arXiv:2403.01282 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.