Partition-distance: A problem and class of perfect graphs arising in clustering

摘要: Partitioning of a set elements into disjoint clusters is fundamental problem that arises in many applications. Different methods produce different partitions, so it useful to have measure the similarity, or distance, between two more partitions. In this paper we examine one distance used clustering application computational genetics. We show how efficiently compute and defines new class perfect graphs.