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 language | English |
---|---|
Title of host publication | String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Proceedings |
Editors | Edleno Moura, Maxime Crochemore |
Publisher | Springer Verlag |
Pages | 45-51 |
Number of pages | 7 |
ISBN (Electronic) | 9783319119175 |
DOIs | |
State | Published - 2014 |
Event | 21st International Symposium on String Processing and Information Retrieval, SPIRE 2014 - Ouro Preto, Brazil Duration: 20 Oct 2014 → 22 Oct 2014 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 8799 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 21st International Symposium on String Processing and Information Retrieval, SPIRE 2014 |
---|---|
Country/Territory | Brazil |
City | Ouro Preto |
Period | 20/10/14 → 22/10/14 |
Bibliographical note
Publisher Copyright:© Springer International Publishing Switzerland 2014.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science