Skip to main content
. 2024 Aug 9;10:e2215. doi: 10.7717/peerj-cs.2215
Algorithm 1: Split-Range 1
1: Input:b.list    % the sequence number set of intervals
b[low/highlength(b.list)] % boundary of intervals
2: Description:
bd[low/highmK] % the boundary matrix of the sub-intervals
bp[mK] % the representative value matrix of the sub-intervals
3: diff←(b[high] − b[low])/K
4: fori←0:K − 1 do
5: bd[lowb.listi]←idiff + b[low]
6: bd[highb.listi]←(i + 1)⋅diff + b[low]
7: end for
8: bp[b.list, 0:K − 1]←round((bd[high] − bd[low])/2)
% The round function performs rounding to the nearest precision
9: Output:bp, bd