The total time (in seconds) needed for computation using FamSeq at one million positions.

Abstract

<p>PU: processing unit; E-S: Elston-Stewart algorithm; MCMC: Markov chain Monte Carlo algorithm; BN: Bayesian network algorithm; N: No, inbreeding loops are not considered; Y: Yes, inbreeding loops are considered.</p>a<p>We called only 100,000 variants due to excessive running time for the MCMC algorithm. The time shown here is 10× the time required to call 100,000 variants.</p>b<p>The time in parentheses is the GPU computing time.</p><p>The total time (in seconds) needed for computation using FamSeq at one million positions.</p