An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations

Large neighbourhood search algorithms for the founder sequence reconstruction problem

“…Song et al further elaborate on Meyers and Griffiths bound and propose improved lower and upper bounds [13]. In another work, Wu [14] developed an analytical upper bound which corresponds to an estimation of the minimum number of breakpoints independent of the particular recombinant set. This estimation is a function of only n and m.…”