Offers an approach dedicated to leaf-labeled pedigree comparison. The method is composed of three different algorithms: (i) a fixed-parameter one dealing with maximum pedigree isomorphisms; (ii) a dynamic-programming one to calculate a maximum PPP-weight mapping between two targeted pedigrees; and (iii) a fixed-parameter one for handling the problem of minimum edge-cutting mapping.
Division of Information System Design, Tokyo Denki University, Hatoyama, Japan; School of Information Science and Engineering, Central South University, Changsha, China; Department of Computer Science, City University of Hong Kong, Hong Kong; City University of Hong Kong Shenzhen Research Institute, Shenzhen, China
ChenEtAl2016 funding source(s)
Supported by a National Science Foundation of China (NSFC 61373048, 61232001, 61472449, 61420106009) and a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China.