License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2017.19
URN: urn:nbn:de:0030-drops-73418
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7341/
Go to the corresponding LIPIcs Volume Portal


Cunha, Luís ; Dantas, Simone ; Gagie, Travis ; Wittler, Roland ; Kowada, Luis ; Stoye, Jens

Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings

pdf-format:
LIPIcs-CPM-2017-19.pdf (0.4 MB)


Abstract

Important papers have appeared recently on the problem of indexing binary strings for jumbled pattern matching, and further lowering the time bounds in terms of the input size would now be a breakthrough with broad implications. We can still make progress on the problem, however, by considering other natural parameters. Badkobeh et al. (IPL, 2013) and Amir et al. (TCS, 2016) gave algorithms that index a binary string in O(n + r^2 log r) time, where n is the length and r is the number of runs, and Giaquinta and Grabowski (IPL, 2013) gave one that runs in O(n + r^2) time. In this paper we propose a new and very simple algorithm that also runs in O(n + r^2) time and can be extended either so that the index returns the position of a match (if there is one), or so that the algorithm uses only O(n) bits of space instead of O(n) words.

BibTeX - Entry

@InProceedings{cunha_et_al:LIPIcs:2017:7341,
  author =	{Lu{\'i}s Cunha and Simone Dantas and Travis Gagie and Roland Wittler and Luis Kowada and Jens Stoye},
  title =	{{Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings}},
  booktitle =	{28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)},
  pages =	{19:1--19:9},
  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/7341},
  URN =		{urn:nbn:de:0030-drops-73418},
  doi =		{10.4230/LIPIcs.CPM.2017.19},
  annote =	{Keywords: string algorithms, indexing, jumbled pattern matching, run-length encoding}
}

Keywords: string algorithms, indexing, jumbled pattern matching, run-length encoding
Seminar: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
Issue Date: 2017
Date of publication: 28.06.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI