LIPIcs.CPM.2016.24.pdf
- Filesize: 0.48 MB
- 10 pages
Document
Color-Distance Oracles and Snippets
Authors
-
Part of:
Volume:
27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Annual Symposium on Combinatorial Pattern Matching (CPM) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-06-27
Cite As Get BibTex
Tsvi Kopelowitz and Robert Krauthgamer. Color-Distance Oracles and Snippets. In 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 54, pp. 24:1-24:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.CPM.2016.24
Abstract
In the snippets problem we are interested in preprocessing a text T so that given two pattern queries P_1 and P_2, one can quickly locate the occurrences of the patterns in T that are the closest to each other. A closely related problem is that of constructing a color-distance oracle, where the goal is to preprocess a set of points from some metric space, in which every point is associated with a set of colors, so that given two colors one can quickly locate two points associated with those colors, that are as close as possible to each other. We introduce efficient data structures for both color-distance oracles and the snippets problem. Moreover, we prove conditional lower bounds for these problems from both the 3SUM conjecture and the Combinatorial Boolean Matrix Multiplication conjecture.
Subject Classification
Keywords
- Snippets
- Text Indexing
- Distance Oracles
- Near Neighbor Search
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads