Islands of Tractability for Parsimony Haplotyping
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
The minimum-entropy set cover problem
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Islands of Tractability for Parsimony Haplotyping
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Family trio phasing and missing data recovery
International Journal of Bioinformatics Research and Applications
Highly Scalable Genotype Phasing by Entropy Minimization
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
2SNP: Scalable Phasing Method for Trios and Unrelated Individuals
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A fast haplotype inference method for large population genotype data
Computational Statistics & Data Analysis
Fast Bayesian Haplotype Inference Via Context Tree Weighting
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Haplotype Inference Constrained by Plausible Haplotype Data
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Identification of deletion polymorphisms from haplotypes
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
SplittingHeirs: inferring haplotypes by optimizing resultant dense graphs
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
Haplotype Inference Constrained by Plausible Haplotype Data
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A hidden markov technique for haplotype reconstruction
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Algorithms for imperfect phylogeny haplotyping (IPPH) with a single homoplasy or recombination event
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
On the genealogy of asexual diploids
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
HAPLOFREQ: estimating haplotype frequencies efficiently
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Improved recombination lower bounds for haplotype data
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Phasing and missing data recovery in family trios
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Phasing of 2-SNP genotypes based on non-random mating model
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Hap-seq: an optimal algorithm for haplotype phasing with imputation using sequencing data
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Semi-supervised clustering algorithm for haplotype assembly problem based on MEC model
International Journal of Data Mining and Bioinformatics
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
A heuristic algorithm for haplotype reconstruction from aligned weighted SNP fragments
International Journal of Bioinformatics Research and Applications
Hi-index | 3.84 |
Critical to the understanding of the genetic basis for complex diseases is the modeling of human variation. Most of this variation can be characterized by single nucleotide polymorphisms (SNPs) which are mutations at a single nucleotide position. To characterize the genetic variation between different people, we must determine an individual's haplotype or which nucleotide base occurs at each position of these common SNPs for each chromosome. In this paper, we present results for a highly accurate method for haplotype resolution from genotype data. Our method leverages a new insight into the underlying structure of haplotypes that shows that SNPs are organized in highly correlated 'blocks'. In a few recent studies, considerable parts of the human genome were partitioned into blocks, such that the majority of the sequenced genotypes have one of about four common haplotypes in each block. Our method partitions the SNPs into blocks, and for each block, we predict the common haplotypes and each individual's haplotype. We evaluate our method over biological data. Our method predicts the common haplotypes perfectly and has a very low error rate ( Availability: The algorithm is available via a Web server at http://www.calit2.net/compbio/hap/