A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree

Abstract

BackgroundWhen studying genetic diseases in which genetic variations are passed on to offspring, the ability to distinguish between paternal and maternal alleles is essential. Determining haplotypes from genotype data is called haplotype inference. Most existing computational algorithms for haplotype inference have been designed to use genotype data collected from individuals in the form of a pedigree. A haplotype is regarded as a hereditary unit and therefore input pedigrees are preferred that are free of mutational events and have a minimum number of genetic recombinational events. These ideas motivated the zero-recombinant haplotype configuration (ZRHC) problem, which strictly follows the Mendelian law of inheritance, namely that one haplotype of each child is inherited from the father and the other haplotype is inherited from the mother, both without any mutation. So far no linear-time algorithm for ZRHC has been proposed for general pedigrees, even though the number of mating loops in a human pedigree is usually very small and can be regarded as constant.ResultsGiven a pedigree with n individuals, m marker loci, and k mating loops, we proposed an algorithm that can provide a general solution to the zero-recombinant haplotype configuration problem in O(kmn + k2m) time. In addition, this algorithm can be modified to detect inconsistencies within the genotype data without loss of efficiency. The proposed algorithm was subject to 12000 experiments to verify its performance using different (n, m) combinations. The value of k was uniformly distributed between zero and six throughout all experiments. The experimental results show a great linearity in terms of execution time in relation to input size when both n and m are larger than 100. For those experiments where n or m are less than 100, the proposed algorithm runs very fast, in thousandth to hundredth of a second, on a personal desktop computer.ConclusionsWe have developed the first deterministic linear-time algorithm for the zero-recombinant haplotype configuration problem. Our experimental results demonstrated the linearity of its execution time in relation to the input size. The proposed algorithm can be modified to detect inconsistency within the genotype data without loss of efficiency and is expected to be able to handle recombinant and missing data with further extension.

p39-associated Cdk5 activity regulates dendritic morphogenesis

“…The transcriptome profile of each sample was generated by Novogene on the Illumina HiSeq X platform. In brief, quality control was performed for the RNA sequencing dataset using FastQC 58 and RSeQC 59 . Read mapping, counting, and differential gene expression analysis were performed using HISAT2, StringTie 60 , and DESeq2 61 , respectively.…”

Haplotype phasing after joint estimation of recombination and linkage disequilibrium in breeding populations

“…Williams et al [12] proposed a new haplotype inference method for nuclear families based on maximum likelihood and minimum recombination using linear programming (implemented in software Hapi). More recently, Lai et al [13] proposed an algorithm for reconstructing haplotypes in a pedigree by assuming zero recombinants. Their method can be applied to general pedigrees but it is not designed to make use of nuclear families with one single parent.…”

InCoB2012 Conference: from biological data to knowledge to technological breakthroughs

“…The prototype version can assist clinicians in diagnosing malaria. Lai and co-workers developed and implemented a deterministic algorithm that solves problem of zero-recombinant haplotype configuration for a general pedigree in linear time [42]. Prediction of discontinuous B-cell epitopes is a long-standing problem.…”