Like the previous example, but with the option to provide a custom string. The application relies on a server-side computation that uses Oliver Mader’s code to compute the essential matching pairs.
The example shows the first 93 digits of PI.
A translucent white stroke has also been introduced to avoid mistaking palindrome repetition of matching subsequences with large subsequences (e.g. 793238 and 383279 on the left side of the visualization).