Algorithms for jumbled indexing, Jumbled Border and Jumbled Square on run-length encoded strings

Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Jumbled Indexing, the problem of indexing a text for histogram queries, has been of much interest lately. In this paper we consider jumbled indexing for run-length encoded texts. We refute a former conjecture and show an algorithm for general sized alphabets. We also consider Jumbled Borders, the extension of borders to jumbled strings. Borders are the basis for various algorithms. Finally, we consider Jumbled Squares, strings which are of the form xx, where x is a jumbling of x. We show efficient algorithms for these problems.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Proceedings
EditorsEdleno Moura, Maxime Crochemore
PublisherSpringer Verlag
Pages45-51
Number of pages7
ISBN (Electronic)9783319119175
DOIs
StatePublished - 2014
Event21st International Symposium on String Processing and Information Retrieval, SPIRE 2014 - Ouro Preto, Brazil
Duration: 20 Oct 201422 Oct 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8799
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Symposium on String Processing and Information Retrieval, SPIRE 2014
Country/TerritoryBrazil
CityOuro Preto
Period20/10/1422/10/14

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2014.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Algorithms for jumbled indexing, Jumbled Border and Jumbled Square on run-length encoded strings'. Together they form a unique fingerprint.

Cite this