Name
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 $i$th and $j$th 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 space-time trade-off between data structure size and query time. In particular, for a parameter 1 u003c= tau u003c= n, their best deterministic solution is a data structure of size O(n/tau) which allows LCE queries to be answered in O(tau) 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(tau * min(log(tau),log(n/tau)) query time using O(n/tau) space, but significantly improve the construction time to O(n*tau). |
Year | DOI | Venue |
|---|---|---|
2016 | 10.4230/LIPIcs.CPM.2016.1 | combinatorial pattern matching |
DocType | Volume | Citations |
Conference | abs/1601.07670 | 2 |
PageRank | References | Authors |
0.39 | 1 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuka Tanimura | 1 | 7 | 1.55 |
| Tomohiro I | 2 | 148 | 22.06 |
| Hideo Bannai | 3 | 620 | 79.87 |
| Shunsuke Inenaga | 4 | 595 | 79.02 |
| Simon J. Puglisi | 5 | 1132 | 75.14 |
| Masayuki Takeda | 6 | 902 | 79.24 |