一致性简约
Parsimony via concensus
摘要：
一个字符在树上的简约得分等于将该字符放入树所需的状态更改次数。我们发现，对于无序，可逆的字符，这个分数等于树重排所需的数量，以适应树上的字符。我们讨论的影响，这种连接的辩论中使用的共识树或总的证据，并显示它如何提供了一个字符和重组之间的联系不一致。
英文摘要：
The parsimony score of a character on a tree equals the number of state changes required to fit that character onto the tree. We show that for unordered, reversible characters this score equals the number of tree rearrangements required to fit the tree onto the character. We discuss implications of this connection for the debate over the use of consensus trees or total evidence, and show how it provides a link between incongruence of characters and recombination.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
