Skip to main content
. 2022 Apr 5;8:e880. doi: 10.7717/peerj-cs.880

Algorithm 2. Parallel EXTEND.

1:  function PARALLEL_EXTEND(m, pz, po, pi)
2:   l = len(m)
3:   ml+1.(d, z, o, w) = (pi, pz, po, l = 0 ? 1 : 0)
4:   for i2 to l + 1 in parallel, do
5:    left_w = shuffle(mi.w, i − 1)
6:    mi.w = mi.wpz ⋅ (l + 1 − i)/(l + 1)
7:    mi.w = mi.w + poleft_wi/(l + 1)
8:   return m