Deterministic sub-linear space LCE data structures with efficient construction

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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

7 被引用数 (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
国/地域イスラエル
CityTel Aviv
Period6/27/166/29/16

All Science Journal Classification (ASJC) codes

  • ソフトウェア

フィンガープリント

「Deterministic sub-linear space LCE data structures with efficient construction」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル