Download algorithm implementation
hapcompass v0.8.2 [zip] [tgz]
Download documentation [pdf] [html]
Note: HapCompass requires Java 1.8 or higher.
We are currently investigating an issue where HapCompass could produce better results for k>2 ploidy.
New in version 0.8.2 - July 29, 2016
Fixed a bug with processing complex variation.
New in version 0.8.1 - March 21, 2016
Fixed a bug with casting variants. Now requires Java 1.8+.
New in version 0.8 - March 3, 2016
Support for small InDels. Better support for PacBio reads. Now requires Java 1.7+.
New in version 0.7.7 - June 14, 2014
HapCompass will now compute 2 SNP haplotypes instead of outputting "Phasing not computed for this block"
A new option now allows users to input Fragment files instead of BAM/SAM. See manual for documentation.
New in version 0.7.6 - June 4, 2014
Changed default number of iterations for diploid to 10. Change with -z (see manual)
New in version 0.7.5 - March 10, 2014
Faster polyploid algorithm
Related HapCompass utilities
hc2vcf.jar v0.3: converts a phased haplotype output file from HapCompass to VCF file format.
Input: the output phased haplotype file from HapCompass, the input VCF file, and a ploidy
java -jar hc2vcf.jar [solution_file] [input_vcf_file] [ploidy] [sort_order]
Example usage: java -jar hc2vcf.jar hc_MWER_solution.txt input.vcf 2 false
Output: The program will produce a file named [solution_file].vcf that is alphabetically sorted by reference name (default) or in the same order as the input VCF reference if [sort_order] is true.
HapCompass for polyploid genomes can currently be used to create accurate pairwise SNP phasings. However, it currently only produces an entire haplotype assembly that is consistent with the data. We are currently working on modifying the algorithm to produce the best haplotype assembly given the resolved compass graph. File formats for representing polyploid sequences are not standardized so if you wish to run HapCompass on polyploid genomes please contact us (derek_aguiar at brown dot edu).
Genome assembly methods produce haplotype phase ambiguous assemblies due to limitations in current sequencing technologies. Determining the haplotype phase of an individual is computationally challenging and experimentally expensive. But haplotype phase information is crucial in many bioinformatics workflows such as genetic association studies and genomic imputation. Current methods of determining haplotype phase from sequence data – known as haplotype assembly – have difficulties producing accurate results for large (1000 genomes-type) data or operate on restricted optimizations that are unrealistic using highthroughput sequencing technologies.
We present a novel algorithm, HAPCOMPASS, for haplotype assembly of densely sequenced human genome data. The HAPCOMPASS algorithm operates on a graph where SNPs are nodes and edges are defined by the sequencing reads and viewed as supporting evidence of co-occuring SNP alleles in a haplotype. In our graph model, haplotype phasings correspond to spanning trees and each spanning tree uniquely defines a cycle basis. We define a global optimization on this graph and translate it into local optimization moves of the cycle basis using rules for resolving conflicting evidence. We estimate the amount of sequencing required to produce a complete haplotype assembly of a chromosome. Using metrics borrowed from genome assembly and haplotype phasing, we compare the accuracy of HAPCOMPASS, the Genome Analysis ToolKit, and HapCut for 1000 genomes and simulated data. We show that HAPCOMPASS performs significantly better for a variety of data and metrics.
This material is based upon work supported by the National Science Foundation under Grant Number 1048831 and 1321000. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation.
