The total time (in seconds) needed for computation using FamSeq at one million positions.
收藏Figshare2015-12-02 更新2026-04-29 收录
下载链接：
https://figshare.com/articles/dataset/_The_total_time_in_seconds_needed_for_computation_using_FamSeq_at_one_million_positions_/1223076
下载链接
链接失效反馈官方服务：
资源简介：
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.aWe 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.bThe time in parentheses is the GPU computing time.The total time (in seconds) needed for computation using FamSeq at one million positions.
创建时间：
2015-12-02
