@article{4cdedfd53fba4935bdc6028a4a44468d, title = "Algorithms for Pedigree Comparison", abstract = "Reconstruction of ancestral relationships among genera, species, and populations is a core task in evolutionary biology. At the population level, pedigrees have been commonly used. Reconstruction of pedigree is required in practice due to legal or medical reasons. Pedigrees are very important to geneticists for inferring haplotype segments, recombination, and allele sharing status with which disease loci can be identified. Evaluating reconstruction methods requires comparing the inferred pedigree and the known pedigrees. Moreover, comparison of pedigrees is required in studying relationships among crops such as maize, wheat and barley, etc. In this paper, we discuss three models for comparison of pedigrees, the maximum pedigree isomorphism problem, the maximum paternal-path-preserved mapping problem, and the minimum edge-cutting mapping problem. For the maximum pedigree isomorphism problem, we prove that the problem is NP-hard and give a fixed-parameter algorithm for the problem. For the maximum paternal-path-preserved mapping problem, we give a dynamic-programming algorithm to find the mapping that preserves the maximum number of paternal paths between the two input pedigrees. For the minimum edge-cutting mapping problem, we prove that the problem is NP-hard and give a fixed-parameter algorithm with running time O(n(1 + √2)k), where n is the number of vertices in the two input pedigrees and k is the number of edges to be cut. This algorithm is useful in practice when comparing two similar pedigrees.", keywords = "fixed-parameter algorithm, NP-hardness, Pedigree", author = "Zhi-Zhong Chen and Qilong Feng and Chao Shen and Jianxin Wang and Lusheng Wang", year = "2018", month = mar, doi = "10.1109/TCBB.2016.2550434", language = "English", volume = "15", pages = "422--431", journal = "IEEE/ACM Transactions on Computational Biology and Bioinformatics", issn = "1545-5963", publisher = "IEEE COMPUTER SOC", number = "2", }