Algorithm complexity :
Here the independence assumption between recombinations across successive intervals makes possible a sequential computation across loci using the forward-backward algorithm. We will see that the probability of the data given an inheritance vector can be computed using an algorithm scaling linearly with the number of founders. However, we have to sum over all possible inheritance vectors at each locus, and their number grows exponentially with the number of non-founders. (Lander and Green, [4])