LDhat is a package written in the C and C++ languages for the analysis of recombination rates from population genetic data. The package is available either as C/C++ source code. The following programs are included:
Other programs in the package can be used to generate lookup tables and summarise the output of analyses. Programs are run from the command line. A pdf manual containing information about installing, running and interpreting results from the package should be read before proceeding. An example data set - LPL sequences from a Finnish population (Nickerson et al., 1998) - is included in the package.
The latest stable releast of the C/C++ source code can be downloaded as a single tarball file.
Alternatively, LDhat is hosted on Sourceforge, and the latest development code can be downloaded via SVN using the following command:
svn checkout http://svn.code.sf.net/p/ldhat/code/ ldhat
A makefile is included, so it should be possible to compile LDhat by just typing 'make'. The resulting executables are run from the command line.
Example input data input files (LPL data, from Nickerson et al., 1998) can be found here:
A number of precomputed likelihood lookup tables are available for download.
Using these tables in conjunction with lkgen will speed up analyses considerably, as the calculation of 2-locus coalescent likelihoods is the most computationally intesive aspect of the core LDhat algorithms.
These tables all use the same grid for 4Ner (rho), 101 points evenly spaced between 0 and 100. They differ only in the number of sequences (n) and the value of population mutation rate parameter (theta).
Note that lkgen can be used to generated lookup tables from these for smaller numbers of chromosomes, and that minor differences in theta do not appear to strongly influence the results.
All of the likelihood lookup files are gzip compressed, and should be decompressed before use.
Most of the functionality of earlier versions of LDhat is maintained in the current version, with a few exceptions. Those wanting the previous version can find it on the archived web-site
Send questions, comments, or suggestions to email@example.com