标题：Isomorphism and similarity for 2-generation pedigrees
作者：Jiang, Haitao; Lin, Guohui; Tong, Weitian; Zhu, Daming; Zhu, Binhai
作者机构：[Jiang, Haitao; Zhu, Daming] Shandong Univ, Sch Comp Sci & Technol, Jinan 250101, Shandong, Peoples R China.; [Lin, Guohui; Tong, Weitian] Univ Albe 更多
会议名称：10th International Symposium on Bioinformatics Research and Applications (ISBRA) - Bioinformatics
会议日期：JUN 28-30, 2014
摘要：We consider the emerging problem of comparing the similarity between (unlabeled) pedigrees. More specifically, we focus on the simplest pedigrees, namely, the 2-generation pedigrees. We show that the isomorphism testing for two 2-generation pedigrees is GI-hard. If the 2-generation pedigrees are monogamous (i.e., each individual at level-1 can mate with exactly one partner) then the isomorphism testing problem can be solved in polynomial time. We then consider the problem by relaxing it into an NP-complete decomposition problem which can be formulated as the Minimum Common Integer Pair Partition (MCIPP) problem, which we show to be FPT by exploiting a property of the optimal solution. While there is still some difficulty to overcome, this lays down a solid foundation for this research.