In genetics, mapping functions are used to model the relationship between map distance (measured in map units or centimorgans) between markers and recombination frequency between markers. One utility of this is that it allows values to be obtained for genetic distances, which is typically not estimable, from recombination fractions, which typically are.[1]
The simplest mapping function is the Morgan Mapping Function, eponymously devised by Thomas Hunt Morgan. Other well-known mapping functions include the Haldane Mapping Function introduced by J. B. S. Haldane in 1919,[2] and the Kosambi Mapping Function introduced by Damodar Dharmananda Kosambi in 1944.[3] [4] Few mapping functions are used in practice other than Haldane and Kosambi. The main difference between them is in how crossover interference is incorporated.[5]
Where d is the distance in map units, the Morgan Mapping Function states that the recombination frequency r can be expressed as
r=d
Where d is the distance in map units, the recombination frequency r can be expressed as:
r=
| 1 | |
| 2 |
[1-(1-2d)]=d
The equation only holds when
| 1 | |
| 2 |
\geqd\geq0
Two properties of the Haldane Mapping Function is that it limits recombination frequency up to, but not beyond 50%, and that it represents a linear relationship between the frequency of recombination and map distance up to recombination frequencies of 10%.[6] It also assumes that crossovers occur at random positions and that they do so independent of one another. This assumption therefore also assumes no crossover interference takes place;[7] but using this assumption allows Haldane to model the mapping function using a Poisson distribution.
r=
| 1 | |
| 2 |
(1-e-2d)
d=-
| 1 | |
| 2 |
ln(1-2r)
The Kosambi mapping function was introduced to account for the impact played by crossover interference on recombination frequency. It introduces a parameter C, representing the coefficient of coincidence, and sets it equal to 2r. For loci which are strongly linked, interference is strong; otherwise, interference decreases towards zero. Interference declines according to the linear function i = 1 - 2r.[8]
r=
| 1 | |
| 2 |
\tanh(2d)=
| 1 | |
| 2 |
| e4d-1 | |
| e4d+1 |
d=
| 1 | |
| 2 |
\tanh-1(2r)=
| 1 | ln( | |
| 4 |
| 1+2r | |
| 1-2r |
)
Below 10% recombination frequency, there is little mathematical difference between different mapping functions and the relationship between map distance and recombination frequency is linear (that is, 1 map unit = 1% recombination frequency). When genome-wide SNP sampling and mapping data is present, the difference between the functions is negligible outside of regions of high recombination, such as recombination hotspots or ends of chromosomes.
While many mapping functions now exist,[9] [10] [11] in practice functions other than Haldane and Kosambi are rarely used. More specifically, the Haldane function is preferred when distance between markers is relatively small, whereas the Kosambi function is preferred when distances between markers is larger and crossovers need to be accounted for.[12]