License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2017.4
URN: urn:nbn:de:0030-drops-73268
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7326/
Go to the corresponding LIPIcs Volume Portal

Navarro, Gonzalo

Document Listing on Repetitive Collections with Guaranteed Performance

pdf-format:
LIPIcs-CPM-2017-4.pdf (0.5 MB)

Abstract

We consider document listing on string collections, that is, finding in which strings a given pattern appears. In particular, we focus on repetitive collections: a collection of size N over alphabet [1,a] is composed of D copies of a string of size n, and s single-character edits are applied on the copies. We introduce the first document listing index with size O~(n + s), precisely O((n lg a + s lg^2 N) lg D) bits, and with useful worst-case time guarantees: Given a pattern of length m, the index reports the ndoc strings where it appears in time O(m^2 + m lg N (lg D + lg^e N) ndoc), for any constant e > 0.

BibTeX - Entry

@InProceedings{navarro:LIPIcs:2017:7326,
  author =	{Gonzalo Navarro},
  title =	{{Document Listing on Repetitive Collections with Guaranteed Performance}},
  booktitle =	{28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
  pages =	{4:1--4:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-039-2},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{78},
  editor =	{Juha K{\"a}rkk{\"a}inen and Jakub Radoszewski and Wojciech Rytter},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7326},
  URN =		{urn:nbn:de:0030-drops-73268},
  doi =		{10.4230/LIPIcs.CPM.2017.4},
  annote =	{Keywords: repetitive string collections, document listing, grammar compression, range minimum queries, succinct data structures}
}

Keywords: repetitive string collections, document listing, grammar compression, range minimum queries, succinct data structures
Collection: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
Issue Date: 2017
Date of publication: 30.06.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI