Answers are grounded in this paper and cite their sources.
There are two basic algorithms for calculating multipoint linkage likelihoods: in one the computational effort increases linearly with the number of pedigree members and exponentially with the number of markers, in the other the effort increases exponentially with the number of persons but linearly with the number of markers. We describe a faster version of the latter algorithm for which there is no penalty in making the recombination fraction meiosis specific. This can lead to faster and potentially more powerful linkage analysis whenever the number of nonfounder meioses in a pedigree is not too large.
No takes yet. Share an insight, caveat, or question.
Idury et al. (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: