7 citations · 17 across the 7 of their papers we have counts for
7 papers
Fast Computation of Graph Edit Distance
Xiaoyang Chen, Hongwei Huo, Jun Huan +1
The graph edit distance (GED) is a well-established distance measure widely used in many applications. However, existing methods for the GED computation suffer from several drawbac…
MSQ-Index: A Succinct Index for Fast Graph Similarity Search
Xiaoyang Chen, Hongwei Huo, Jun Huan +1
Graph similarity search has received considerable attention in many applications, such as bioinformatics, data mining, pattern recognition, and social networks. Existing methods fo…
Dynamic Data Structures for Document Collections and Graphs
J. Ian Munro, Yakov Nekrich, Jeffrey Scott Vitter
In the dynamic indexing problem, we must maintain a changing collection of text documents so that we can efficiently support insertions, deletions, and pattern matching queries. We…
Space-Efficient String Indexing for Wildcard Pattern Matching
Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter
In this paper we describe compressed indexes that support pattern matching queries for strings with wildcards. For a constant size alphabet our data structure uses $O(n\log^{\varep…
Optimal Color Range Reporting in One Dimension
Yakov Nekrich, Jeffrey Scott Vitter
Color (or categorical) range reporting is a variant of the orthogonal range reporting problem in which every point in the input is assigned a \emph{color}. While the answer to an o…
On Optimal Top-K String Retrieval
Rahul Shah, Cheng Sheng, Sharma V. Thankachan +1
Let = be a given set of (string) documents of total length . The top- document retrieval problem is to index such that…