Deterministic sub-linear space LCE data structures with efficient construction

Yuka Tanimura, I. Tomohiro, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda

研究成果: 著書/レポートタイプへの貢献会議での発言

5 引用 (Scopus)

抄録

Given a string S of n symbols, a longest common extension query LCE(i, j) asks for the length of the longest common prefix of the ith and jth suffixes of S. LCE queries have several important applications in string processing, perhaps most notably to suffix sorting. Recently, Bille et al. (J. Discrete Algorithms 25:42-50, 2014, Proc. CPM 2015:65-76) described several data structures for answering LCE queries that offers a trade-off between data structure size and query time. In particular, for a parameter 1 ≤ τ ≤ n, their best deterministic solution is a data structure of size O(n/τ) which allows LCE queries to be answered in O(τ) time. However, the construction time for all deterministic versions of their data structure is quadratic in n. In this paper, we propose a deterministic solution that achieves a similar space-time trade-off of O(τ min{log τ, log n/τ}) query time using O(n/τ) space, but we significantly improve the construction time to O(nτ).

元の言語英語
ホスト出版物のタイトル27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
編集者Roberto Grossi, Moshe Lewenstein
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ページ1.1-1.10
ISBN(電子版)9783959770125
DOI
出版物ステータス出版済み - 6 1 2016
イベント27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 - Tel Aviv, イスラエル
継続期間: 6 27 20166 29 2016

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
54
ISSN(印刷物)1868-8969

その他

その他27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
イスラエル
Tel Aviv
期間6/27/166/29/16

Fingerprint

Data structures
Sorting
Processing

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Tanimura, Y., Tomohiro, I., Bannai, H., Inenaga, S., Puglisi, S. J., & Takeda, M. (2016). Deterministic sub-linear space LCE data structures with efficient construction. : R. Grossi, & M. Lewenstein (版), 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 (pp. 1.1-1.10). (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 54). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2016.1

Deterministic sub-linear space LCE data structures with efficient construction. / Tanimura, Yuka; Tomohiro, I.; Bannai, Hideo; Inenaga, Shunsuke; Puglisi, Simon J.; Takeda, Masayuki.

27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. 版 / Roberto Grossi; Moshe Lewenstein. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. p. 1.1-1.10 (Leibniz International Proceedings in Informatics, LIPIcs; 巻 54).

研究成果: 著書/レポートタイプへの貢献会議での発言

Tanimura, Y, Tomohiro, I, Bannai, H, Inenaga, S, Puglisi, SJ & Takeda, M 2016, Deterministic sub-linear space LCE data structures with efficient construction. : R Grossi & M Lewenstein (版), 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Leibniz International Proceedings in Informatics, LIPIcs, 巻. 54, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 1.1-1.10, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, イスラエル, 6/27/16. https://doi.org/10.4230/LIPIcs.CPM.2016.1
Tanimura Y, Tomohiro I, Bannai H, Inenaga S, Puglisi SJ, Takeda M. Deterministic sub-linear space LCE data structures with efficient construction. : Grossi R, Lewenstein M, 編集者, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. p. 1.1-1.10. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.CPM.2016.1
Tanimura, Yuka ; Tomohiro, I. ; Bannai, Hideo ; Inenaga, Shunsuke ; Puglisi, Simon J. ; Takeda, Masayuki. / Deterministic sub-linear space LCE data structures with efficient construction. 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. 編集者 / Roberto Grossi ; Moshe Lewenstein. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. pp. 1.1-1.10 (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{c52c62ec63e74e07aabf1cdb6b8bc8cb,
title = "Deterministic sub-linear space LCE data structures with efficient construction",
abstract = "Given a string S of n symbols, a longest common extension query LCE(i, j) asks for the length of the longest common prefix of the ith and jth suffixes of S. LCE queries have several important applications in string processing, perhaps most notably to suffix sorting. Recently, Bille et al. (J. Discrete Algorithms 25:42-50, 2014, Proc. CPM 2015:65-76) described several data structures for answering LCE queries that offers a trade-off between data structure size and query time. In particular, for a parameter 1 ≤ τ ≤ n, their best deterministic solution is a data structure of size O(n/τ) which allows LCE queries to be answered in O(τ) time. However, the construction time for all deterministic versions of their data structure is quadratic in n. In this paper, we propose a deterministic solution that achieves a similar space-time trade-off of O(τ min{log τ, log n/τ}) query time using O(n/τ) space, but we significantly improve the construction time to O(nτ).",
author = "Yuka Tanimura and I. Tomohiro and Hideo Bannai and Shunsuke Inenaga and Puglisi, {Simon J.} and Masayuki Takeda",
year = "2016",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.CPM.2016.1",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
pages = "1.1--1.10",
editor = "Roberto Grossi and Moshe Lewenstein",
booktitle = "27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016",

}

TY - GEN

T1 - Deterministic sub-linear space LCE data structures with efficient construction

AU - Tanimura, Yuka

AU - Tomohiro, I.

AU - Bannai, Hideo

AU - Inenaga, Shunsuke

AU - Puglisi, Simon J.

AU - Takeda, Masayuki

PY - 2016/6/1

Y1 - 2016/6/1

N2 - Given a string S of n symbols, a longest common extension query LCE(i, j) asks for the length of the longest common prefix of the ith and jth suffixes of S. LCE queries have several important applications in string processing, perhaps most notably to suffix sorting. Recently, Bille et al. (J. Discrete Algorithms 25:42-50, 2014, Proc. CPM 2015:65-76) described several data structures for answering LCE queries that offers a trade-off between data structure size and query time. In particular, for a parameter 1 ≤ τ ≤ n, their best deterministic solution is a data structure of size O(n/τ) which allows LCE queries to be answered in O(τ) time. However, the construction time for all deterministic versions of their data structure is quadratic in n. In this paper, we propose a deterministic solution that achieves a similar space-time trade-off of O(τ min{log τ, log n/τ}) query time using O(n/τ) space, but we significantly improve the construction time to O(nτ).

AB - Given a string S of n symbols, a longest common extension query LCE(i, j) asks for the length of the longest common prefix of the ith and jth suffixes of S. LCE queries have several important applications in string processing, perhaps most notably to suffix sorting. Recently, Bille et al. (J. Discrete Algorithms 25:42-50, 2014, Proc. CPM 2015:65-76) described several data structures for answering LCE queries that offers a trade-off between data structure size and query time. In particular, for a parameter 1 ≤ τ ≤ n, their best deterministic solution is a data structure of size O(n/τ) which allows LCE queries to be answered in O(τ) time. However, the construction time for all deterministic versions of their data structure is quadratic in n. In this paper, we propose a deterministic solution that achieves a similar space-time trade-off of O(τ min{log τ, log n/τ}) query time using O(n/τ) space, but we significantly improve the construction time to O(nτ).

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

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

U2 - 10.4230/LIPIcs.CPM.2016.1

DO - 10.4230/LIPIcs.CPM.2016.1

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 1.1-1.10

BT - 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016

A2 - Grossi, Roberto

A2 - Lewenstein, Moshe

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -