@inproceedings{744afa4427754389bd54123a3c1b713b,
title = "Color-distance oracles and snippets",
abstract = "In the snippets problem we are interested in preprocessing a text T so that given two pattern queries P1 and P2, 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.",
keywords = "Distance oracles, Near neighbor search, Snippets, Text indexing",
author = "Tsvi Kopelowitz and Robert Krauthgamer",
note = "Publisher Copyright: {\textcopyright} Tsvi Kopelowitz Robert Krauthgamer.; 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 ; Conference date: 27-06-2016 Through 29-06-2016",
year = "2016",
month = jun,
day = "1",
doi = "10.4230/LIPIcs.CPM.2016.24",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "24.1--24.10",
editor = "Roberto Grossi and Moshe Lewenstein",
booktitle = "27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016",
address = "ألمانيا",
}