Global maximum parsimony recovery conjecture for low-score characters
Let be a binary phylogenetic -tree with . For a character alignment consisting of the binary characters of parsimony score on , let . Global maximum parsimony recovery conjecture. Then is the unique maximum parsimony tree for . This is presented as slightly stronger than the preceding conjecture because it asserts unique recovery under a broader bound on ; the paper proves a corresponding result within the NNI neighborhood for a smaller range, while global recovery remains open beyond the cases noted in the discussion.
References
- 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
Never refreshed
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.