Skip to content

Clustering a set of haplotypes by successive splitting and merging steps.

Notifications You must be signed in to change notification settings

scicompuu/HaploCluster

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

HaploCluster

Clustering a set of haplotypes by successive splitting and merging steps.

Prerequisites

  • a Python3 installation,
  • Jupyter Notebook,
  • (optional) a specific virtual environment, activated

Motivations

This notebook intended to be a case study of the algorithm implemented in the BEAGLE software, which is used in my research project. The purpose was to get insights into the clustering mechanisms, and to get hands on with graph library (NetworkX chosen here).

Further information

Additional references and explanations are provided in the notebook itself. In particular, these two articles feature the primary implentation of the haplotypes clustering algorithm:

  • Browning, S.R.: Multilocus association mapping using variable-length markov chains. Am. J. Hum. Genet. 78, 903–913 (2006)
  • Browning, S.R., Browning, B.L.: Rapid and accurate haplotype phasing and missing data inference for whole genome association studies by use of localized haplotype clustering. The American Journal of Human Genetics 81, 1084–1097 (2007)

About

Clustering a set of haplotypes by successive splitting and merging steps.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Jupyter Notebook 100.0%