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.
Jiang, Haitao, Guohui Lin, Weitian Tong, Daming Zhu, Binhai Zhu.
"Isomorphism and Similarity for 2-Generation Pedigrees."
BMC Bioinformatics, 16 (5): 1-8.
doi: https://doi.org/10.1186/1471-2105-16-S5-S7 source: https://bmcbioinformatics.biomedcentral.com/articles/10.1186/1471-2105-16-S5-S7