Abstract

With the rapid progress of genotyping techniques, many large-scale, genome-wide disease studies are now under way. One of the challenges of large disease-association studies is developing a fast and accurate computing method for haplotype inference from genotype data. In this paper, a new computing method for population-based haplotype inference problem is proposed. The designed method does not assume haplotype blocks in the population and allows each individual haplotype to have its own structure, and thus is able to accommodate recombination and obtain higher adaptivity to the genotype data, specifically in the case of long marker maps. This method develops a dynamic programming algorithm, which is theoretically guaranteed to find exact maximum likelihood solutions of the variable order Markov chain model for haplotype inference problem within linear running time. Hence, it is fast and, as a result, practicable for large genotype datasets. Through extensive computational experiments on large-scale real genotype data, the proposed method is shown to be fast and efficient.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.