| Papers | |
 |
Location:Home >Papers |
| Paper Code | |
| Title | A fast haplotype inference method for large population genotype data |
| Authors | Wu Lingyue |
| Corresponding Author | |
| Year | 2008 |
| Title of Journal | |
| Volume | 52 |
| Number | 11 |
| Page | 4891-4902 |
| Abstract | 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 | |
| Full Text Link | http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V8V-4S92TGC-2&_user=1999482&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=982148190&_rerunOrigin=google&_acct=C000050602&_version=1&_urlVersion=0&_userid=1999482&md5=78c2e2b9ab2d3a182668629c688c3859 |
| Others: | 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. |
| Classification: | |
| Source: |