三态完美系统发育最小障碍集的一个简单刻画
A Simple Characterization of the Minimal Obstruction Sets for Three-State Perfect Phylogenies
摘要：
Lam，Gusfield，and Sridhar（2009）证明了一组三态字符具有完美的同源性，当且仅当三个字符的每个子集都具有完美的同源性。他们还对三个三态人物的集合进行了完整的刻画，这些人物并没有完美的进化史。然而，从他们的表征中不清楚如何在不测试所有三元组字符的情况下找到不具有完美同源性的三个字符的子集。在本说明中，我们在他们的结果的基础上给出了一个简单的特征，说明一组三态字符何时不具有完美的系统发育史，可以通过测试所有字符对来推断出该系统发育史。
英文摘要：
Lam, Gusfield, and Sridhar (2009) showed that a set of three-state characters has a perfect phylogeny if and only if every subset of three characters has a perfect phylogeny. They also gave a complete characterization of the sets of three three-state characters that do not have a perfect phylogeny. However, it is not clear from their characterization how to find a subset of three characters that does not have a perfect phylogeny without testing all triples of characters. In this note, we build upon their result by giving a simple characterization of when a set of three-state characters does not have a perfect phylogeny that can be inferred from testing all pairs of characters.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
