Hacker News

Thinnings: Sublist Witnesses and de Bruijn Index Shift Clumping

16 points by matt_d ago | 2 comments

skybrian [-]

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.

philzook |root |parent [-]

Interesting. I think there is even more similarity if you are trying to find a "best" list from which two other lists are thinned.