Sliding-window winnowing per Schleimer/Wilkerson/Aiken 2003. The previous implementation used a tumbling window (jumping the window by WindowLength k-grams each emit), which loses the paper's matching guarantee: any duplicate substring of length >= k + w - 1 is supposed to produce at least one identical fingerprint, but with tumbling windows a duplicate straddling a window boundary can be missed.
source not stored for this graph (policy: none)
nothing calls this directly
no outgoing calls
no test coverage detected