Finding a thinning seems like a restricted version of a diff algorithm where you only delete things? The thinning is a diff represented as bits. This isn't very compact, but you could run-length encode it.
Interesting. I think there is even more similarity if you are trying to find a "best" list from which two other lists are thinned.