Algorithm complexities.
收藏NIAID Data Ecosystem2026-03-07 收录
官方服务：
资源简介：
This table shows the time and space complexities of PairMotif and that of other famous exact algorithms. Note that, t is the number of sequences; n is the sequence length; pk is the probability that the Hamming distance between two random l-mers is not more than k; L represents the time to load the ILP table of PMS5, which is about 50 seconds [22].
创建时间：
2012-10-31
