Document Open Access Logo

Faster Range LCP Queries in Linear Space

Authors Yakov Nekirch, Sharma V. Thankachan

PDF HTML 5

Files

Thumbnail PDF
PDF
OASIcs.Grossi.16.pdf
  • Filesize: 0.55 MB
  • 6 pages
HTML5 Logo HTML (experimental)
OASIcs.Grossi.16.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Pattern matching
Keywords
  • Data Structures
  • String Algorithms
  • Longest Common Prefix

Metrics

Abstract

A range LCP query rlcp(α,β) on a text T[1 .. n] asks to return the length of the longest common prefix of any two suffixes of T with starting positions in a range [α,β]. In this paper we describe a data structure that uses O(n) space and supports range LCP queries in time O(log^ε n) for any constant ε > 0. Our result is the fastest currently known linear-space solution for this problem.

Cite As Get BibTex

Yakov Nekirch and Sharma V. Thankachan. Faster Range LCP Queries in Linear Space. In From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday. Open Access Series in Informatics (OASIcs), Volume 132, pp. 16:1-16:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.Grossi.16

Author Details

Yakov Nekirch
  • Michigan Technological University, Houghton, MI, USA
Sharma V. Thankachan
  • North Carolina State University, Raleigh, NC, USA

Funding

  • Nekirch, Yakov: Supported by the National Science Foundation under NSF grant 2203278.
  • Thankachan, Sharma V.: Supported by the National Science Foundation under NSF grant 2315822.

References

  1. Paniz Abedin, Arnab Ganguly, Wing-Kai Hon, Kotaro Matsuda, Yakov Nekrich, Kunihiko Sadakane, Rahul Shah, and Sharma V. Thankachan. A linear-space data structure for range-lcp queries in poly-logarithmic time. Theor. Comput. Sci., 822:15-22, 2020. URL: https://doi.org/10.1016/J.TCS.2020.04.009.
  2. Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, and Ely Porat. Range LCP. J. Comput. Syst. Sci., 80(7):1245-1253, 2014. URL: https://doi.org/10.1016/J.JCSS.2014.02.010.
  3. Amihood Amir, Moshe Lewenstein, and Sharma V. Thankachan. Range LCP queries revisited. In 22nd International Symposium String Processing and Information Retrieval (SPIRE), pages 350-361, 2015. URL: https://doi.org/10.1007/978-3-319-23826-5_33.
  4. Timothy M. Chan, Yakov Nekrich, Saladi Rahul, and Konstantinos Tsakalidis. Orthogonal point location and rectangle stabbing queries in 3-d. J. Comput. Geom., 13(1):399-428, 2022. URL: https://doi.org/10.20382/JOCG.V13I1A15.
  5. Graham Cormode and S. Muthukrishnan. Substring compression problems. In 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 321-330, 2005. URL: http://dl.acm.org/citation.cfm?id=1070432.1070478.
  6. Johannes Fischer and Volker Heun. Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput., 40(2):465-492, 2011. URL: https://doi.org/10.1137/090779759.
  7. Arnab Ganguly, Manish Patil, Rahul Shah, and Sharma V. Thankachan. A linear space data structure for range LCP queries. Fundam. Informaticae, 163(3):245-251, 2018. URL: https://doi.org/10.3233/FI-2018-1741.
  8. Roberto Grossi, Alessio Orlandi, Rajeev Raman, and S. Srinivasa Rao. More haste, less waste: Lowering the redundancy in fully indexable dictionaries. In 26th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 517-528, 2009. URL: https://doi.org/10.4230/LIPICS.STACS.2009.1847.
  9. Orgad Keller, Tsvi Kopelowitz, Shir Landau Feibish, and Moshe Lewenstein. Generalized substring compression. Theor. Comput. Sci., 525:42-54, 2014. URL: https://doi.org/10.1016/j.tcs.2013.10.010.
  10. Kotaro Matsuda, Kunihiko Sadakane, Tatiana Starikovskaya, and Masakazu Tateshita. Compressed orthogonal search on suffix arrays with applications to range LCP. In 31st Annual Symposium on Combinatorial Pattern Matching (CPM), pages 23:1-23:13, 2020. URL: https://doi.org/10.4230/LIPICS.CPM.2020.23.
  11. Daniel Dominic Sleator and Robert Endre Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362-391, 1983. URL: https://doi.org/10.1016/0022-0000(83)90006-5.
  12. Peter van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett., 6(3):80-82, 1977. URL: https://doi.org/10.1016/0020-0190(77)90031-X.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact