MinJoin: Efficient Edit Similarity Joins via Local Hash Minima thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

MinJoin: Efficient Edit Similarity Joins via Local Hash Minima

Published on Feb 18, 20247 Views

We study the problem of computing similarity joins under edit distance on a set of strings. Edit similarity joins is a fundamental problem in databases, data mining and bioinformatics. It finds import

Related categories