6 citations · 7 across the 4 of their papers we have counts for
4 papers
MinJoin: Efficient Edit Similarity Joins via Local Hash Minima
Haoyu Zhang, Qin Zhang
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 bioinformat…
Smooth -Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads
Haoyu Zhang, Qin Zhang, Haixu Tang
We propose smooth -gram, the first variant of -gram that captures -gram pair within a small edit distance. We apply smooth -gram to the problem of detecting overlapping…
EmbedJoin: Efficient Edit Similarity Joins via Embeddings
Haoyu Zhang, Qin Zhang
We study the problem of edit similarity joins, where given a set of strings and a threshold value , we want to output all pairs of strings whose edit distances are at most .…
Computing Skylines on Distributed Data
Haoyu Zhang, Qin Zhang
In this paper we study skyline queries in the distributed computational model, where we have remote sites and a central coordinator (the query node); each site holds a piece of…