Compact Data Structures for Shortest Unique Substring Queries

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Given a string T of length n, a substring of T is called a shortest unique substring (SUS) for an interval [s, t] if (a) u occurs exactly once in T, (b) u contains the interval [s, t] (i.e.), and (c) every substring v of T with containing [s, t] occurs at least twice in T. Given a query interval, the interval SUS problem is to output all the SUSs for the interval [s, t]. In this article, we propose a bits data structure answering an interval SUS query in output-sensitive time, where is the number of returned SUSs. Additionally, we focus on the point SUS problem, which is the interval SUS problem for. Here, we propose a bits data structure answering a point SUS query in the same output-sensitive time.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings
EditorsNieves R. Brisaboa, Simon J. Puglisi
PublisherSpringer
Pages107-123
Number of pages17
ISBN (Print)9783030326852
DOIs
Publication statusPublished - Jan 1 2019
Event26th International Symposium on String Processing and Information Retrieval, SPIRE 2019 - Segovia, Spain
Duration: Oct 7 2019Oct 9 2019

Publication series

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

Conference

Conference26th International Symposium on String Processing and Information Retrieval, SPIRE 2019
CountrySpain
CitySegovia
Period10/7/1910/9/19

Fingerprint

Data structures
Data Structures
Query
Short Intervals
Interval
Output
Strings

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Mieno, T., Köppl, D., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2019). Compact Data Structures for Shortest Unique Substring Queries. In N. R. Brisaboa, & S. J. Puglisi (Eds.), String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings (pp. 107-123). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11811 LNCS). Springer. https://doi.org/10.1007/978-3-030-32686-9_8

Compact Data Structures for Shortest Unique Substring Queries. / Mieno, Takuya; Köppl, Dominik; Nakashima, Yuto; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. ed. / Nieves R. Brisaboa; Simon J. Puglisi. Springer, 2019. p. 107-123 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11811 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mieno, T, Köppl, D, Nakashima, Y, Inenaga, S, Bannai, H & Takeda, M 2019, Compact Data Structures for Shortest Unique Substring Queries. in NR Brisaboa & SJ Puglisi (eds), String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11811 LNCS, Springer, pp. 107-123, 26th International Symposium on String Processing and Information Retrieval, SPIRE 2019, Segovia, Spain, 10/7/19. https://doi.org/10.1007/978-3-030-32686-9_8
Mieno T, Köppl D, Nakashima Y, Inenaga S, Bannai H, Takeda M. Compact Data Structures for Shortest Unique Substring Queries. In Brisaboa NR, Puglisi SJ, editors, String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. Springer. 2019. p. 107-123. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-32686-9_8
Mieno, Takuya ; Köppl, Dominik ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Compact Data Structures for Shortest Unique Substring Queries. String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings. editor / Nieves R. Brisaboa ; Simon J. Puglisi. Springer, 2019. pp. 107-123 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{08ffe1767833424d9dd49f7fc0192128,
title = "Compact Data Structures for Shortest Unique Substring Queries",
abstract = "Given a string T of length n, a substring of T is called a shortest unique substring (SUS) for an interval [s, t] if (a) u occurs exactly once in T, (b) u contains the interval [s, t] (i.e.), and (c) every substring v of T with containing [s, t] occurs at least twice in T. Given a query interval, the interval SUS problem is to output all the SUSs for the interval [s, t]. In this article, we propose a bits data structure answering an interval SUS query in output-sensitive time, where is the number of returned SUSs. Additionally, we focus on the point SUS problem, which is the interval SUS problem for. Here, we propose a bits data structure answering a point SUS query in the same output-sensitive time.",
author = "Takuya Mieno and Dominik K{\"o}ppl and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-32686-9_8",
language = "English",
isbn = "9783030326852",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "107--123",
editor = "Brisaboa, {Nieves R.} and Puglisi, {Simon J.}",
booktitle = "String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings",

}

TY - GEN

T1 - Compact Data Structures for Shortest Unique Substring Queries

AU - Mieno, Takuya

AU - Köppl, Dominik

AU - Nakashima, Yuto

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Given a string T of length n, a substring of T is called a shortest unique substring (SUS) for an interval [s, t] if (a) u occurs exactly once in T, (b) u contains the interval [s, t] (i.e.), and (c) every substring v of T with containing [s, t] occurs at least twice in T. Given a query interval, the interval SUS problem is to output all the SUSs for the interval [s, t]. In this article, we propose a bits data structure answering an interval SUS query in output-sensitive time, where is the number of returned SUSs. Additionally, we focus on the point SUS problem, which is the interval SUS problem for. Here, we propose a bits data structure answering a point SUS query in the same output-sensitive time.

AB - Given a string T of length n, a substring of T is called a shortest unique substring (SUS) for an interval [s, t] if (a) u occurs exactly once in T, (b) u contains the interval [s, t] (i.e.), and (c) every substring v of T with containing [s, t] occurs at least twice in T. Given a query interval, the interval SUS problem is to output all the SUSs for the interval [s, t]. In this article, we propose a bits data structure answering an interval SUS query in output-sensitive time, where is the number of returned SUSs. Additionally, we focus on the point SUS problem, which is the interval SUS problem for. Here, we propose a bits data structure answering a point SUS query in the same output-sensitive time.

UR - http://www.scopus.com/inward/record.url?scp=85075648001&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85075648001&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-32686-9_8

DO - 10.1007/978-3-030-32686-9_8

M3 - Conference contribution

AN - SCOPUS:85075648001

SN - 9783030326852

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 107

EP - 123

BT - String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Proceedings

A2 - Brisaboa, Nieves R.

A2 - Puglisi, Simon J.

PB - Springer

ER -