Table 3. Local matching prediction.

	Input: Sequence s, RME prme, and collection of references REF = {ref 1,…, ref m}
	Output: RME candidate
1:	Let candidate = (0,0,0,0)
2:	for −δ max ≤ δ ≤ −δ max do
3:	Let p = prme.pos+prme.l+1+delta
4:	Let l be the length of the longest prefix of ref prme.id(p,∣ref prme.id∣ − p) matching with the prefix of s
5:	if l ≥ candidate.l∧l ≥ l min then
6:	Set candidate = (prme.id, p, l, s(l))
7:	end if
8:	end for