Name
Abstract | ||
|---|---|---|
Haplotype inference is an important step for many types of analyses of genetic variation in the human genome. Traditional approaches for obtaining haplotypes involve collecting genotype information from a population of individuals and then applying a haplotype inference algorithm. The development of high-throughput sequencing technologies allows for an alternative strategy to obtain haplotypes by combining sequence fragments. The problem of 'haplotype assembly' is the problem of assembling the two haplotypes for a chromosome given the collection of such fragments, or reads, and their locations in the haplotypes, which are pre-determined by mapping the reads to a reference genome. Errors in reads significantly increase the difficulty of the problem and it has been shown that the problem is NP-hard even for reads of length 2. Existing greedy and stochastic algorithms are not guaranteed to find the optimal solutions for the haplotype assembly problem.In this article, we proposed a dynamic programming algorithm that is able to assemble the haplotypes optimally with time complexity O(m x 2(k) x n), where m is the number of reads, k is the length of the longest read and n is the total number of SNPs in the haplotypes. We also reduce the haplotype assembly problem into the maximum satisfiability problem that can often be solved optimally even when k is large. Taking advantage of the efficiency of our algorithm, we perform simulation experiments demonstrating that the assembly of haplotypes using reads of length typical of the current sequencing technologies is not practical. However, we demonstrate that the combination of this approach and the traditional haplotype phasing approaches allow us to practically construct haplotypes containing both common and rare variants. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1093/bioinformatics/btq215 | Bioinformatics [ISMB] |
Keywords | Field | DocType |
stochastic algorithm,haplotype inference,haplotype assembly,haplotype inference algorithm,whole-genome sequence data,haplotype assembly problem,dynamic programming algorithm,haplotypes optimally,current sequencing technology,optimal algorithm,traditional haplotype,maximum satisfiability problem,genomics,genome,algorithms,genome sequence,haplotypes | Maximum satisfiability problem,Dynamic programming,Population,Computer science,Haplotype,Algorithm,Genomics,Whole genome sequencing,Bioinformatics,Time complexity,Reference genome | Journal |
Volume | Issue | ISSN |
26 | 12 | 1367-4811 |
Citations | PageRank | References |
43 | 2.13 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan He | 1 | 133 | 12.54 |
| Arthur Choi | 2 | 299 | 27.05 |
| Knot Pipatsrisawat | 3 | 358 | 20.44 |
| Adnan Darwiche | 4 | 2934 | 255.11 |
| Eleazar Eskin | 5 | 1790 | 170.53 |