MinJoin++: a fast algorithm for string similarity joins under edit distance

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 many applications in data cleaning and integration, collaborative filtering, genome sequence assembly, etc...

Celý popis

Podrobná bibliografia

Vydané v:	The VLDB journal Ročník 33; číslo 2; s. 281 - 299
Hlavní autori:	Karpov, Nikolai, Zhang, Haoyu, Zhang, Qin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2024 Springer Nature B.V
Predmet:	Accuracy Algorithms Bioinformatics Computer Science Data mining Database Management Datasets Genomes Regular Paper Run time (computers) Similarity Strings String similarity joins Edit distance Local hash minima
ISSN:	1066-8888, 0949-877X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!