:: DESCRIPTION
MixSIH is a probabilistic model for solving the single individual haplotyping (SIH) or haplotype assembly problem.
::DEVELOPER
hirotaka MATSUMOTO , Kiryu Laboratory
:: SCREENSHOTS
N/A
:: REQUIREMENTS
:: DOWNLOAD
:: MORE INFORMATION
Citation
BMC Genomics. 2013;14 Suppl 2:S5. doi: 10.1186/1471-2164-14-S2-S5.
MixSIH: a mixture model for single individual haplotyping.
Matsumoto H, Kiryu H.
:: DESCRIPTION
hapAssembly beats the previous best for the important Haplotype Assembly Problem. It is an approach to finding optimal solutions for the haplotype assembly problem under the minimum-error-correction (MEC) model.
::DEVELOPER
:: SCREENSHOTS
N/A
:: REQUIREMENTS
:: DOWNLOAD
:: MORE INFORMATION
Citation
Bioinformatics. 2013 Aug 15;29(16):1938-45. doi: 10.1093/bioinformatics/btt349.
Exact algorithms for haplotype assembly from whole-genome sequence data.
Chen ZZ, Deng F, Wang L.
:: DESCRIPTION
HapCUT is a max-cut based algorithm for haplotype assembly using sequence reads from the two chromosomes of an individual. It can be applied to sequence data generated from next-generation sequencing platforms. HapCUT takes as input the aligned SAM/BAM files for an individual diploid genome and the list of variants (VCF file), and outputs the phased haplotype blocks that can be assembled from the sequence reads.
::DEVELOPER
:: SCREENSHOTS
N/A
:: REQUIREMENTS
:: DOWNLOAD
:: MORE INFORMATION
Citation
Bioinformatics. 2008 Aug 15;24(16):i153-9. doi: 10.1093/bioinformatics/btn298.
HapCUT: an efficient and accurate algorithm for the haplotype assembly problem.
Bansal V, Bafna V.
