Figure 4
From: Explaining human mobility predictions through a pattern matching algorithm
Visualisation of three variants of the longest common subsequence problem. Three score matrices represent scoring for the same pair of sequences. The longest common subsequence is chosen differently in each variant. Picture (a) shows the dense repeatability metric, picture (b) represents the sparse repeatability metric, and picture (c) shows the equally sparse repeatability metric, where the blue line indicates the diagonal with the highest score