Skip to main content
SpringerLink
Log in

Faster Range LCP Queries

  • Conference paper
String Processing and Information Retrieval (SPIRE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8214))

Included in the following conference series:

Abstract

Range LCP (longest common prefix) is an extension of the classical LCP problem and is defined as follows: Preprocess a string S[1...n] so that max a,b ∈ {i...j }LCP(S a , S b ) can be computed efficiently for the input i, j ∈ [1, n], where LCP(S a , S b ) is the length of the longest common prefix of the suffixes of S starting at locations a and b. In this paper, we describe a linear space data structure with O((j − i)1/2logε(j − i)) query time, where ε > 0 is any constant. This improves the linear space and O((j − i)loglogn) query time solution by Amir et. al. [ISAAC, 2011].

Work supported by National Science Foundation (NSF) Grants CCF–1017623 (R. Shah and J. S. Vitter) and CCF–1218904 (R. Shah).

The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-02432-5_33

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amir, A., Apostolico, A., Landau, G.M., Levy, A., Lewenstein, M., Porat, E.: Range LCP. In: Asano, T., Nakano, S.-i., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 683–692. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  2. Chan, T.M., Larsen, K.G., Patrascu, M.: Orthogonal range searching on the ram, revisited. In: Symposium on Computational Geometry, pp. 1–10 (2011)

    Google Scholar 

  3. Cormode, G., Muthukrishnan, S.: Substring compression problems. In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, pp. 321–330 (2005)

    Google Scholar 

  4. Crochemore, M., Iliopoulos, C.S., Kubica, M., Rahman, M.S., Tischler, G., Walen, T.: Improved algorithms for the range next value problem and applications. Theor. Comput. Sci. 434, 23–34 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Keller, O., Kopelowitz, T., Landau, S., Lewenstein, M.: Generalized substring compression. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol. 5577, pp. 26–38. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. Journal of algorithms 10(2), 157–169 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Transactions on Information Theory 22(1), 75–81 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lenhof, H.-P., Smid, M.H.M.: Using persistent data structures for adding range restrictions to searching problems. ITA 28(1), 25–49 (1994)

    MathSciNet  MATH  Google Scholar 

  9. Nekrich, Y., Navarro, G.: Sorted range reporting. In: SWAT, pp. 271–282 (2012)

    Google Scholar 

  10. Patrascu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: STOC, pp. 232–240 (2006)

    Google Scholar 

  11. Weiner, P.: Linear Pattern Matching Algorithms. In: SWAT, pp. 1–11 (1973)

    Google Scholar 

  12. Yu, C.-C., Hon, W.-K., Wang, B.-F.: Improved data structures for the orthogonal range successor problem. Comput. Geom. 44(3), 148–159 (2011)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Louisiana State University, USA

    Manish Patil, Rahul Shah & Sharma V. Thankachan

Authors
  1. Manish Patil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rahul Shah
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sharma V. Thankachan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Industrial Engineering and Management Technion, Technion Institute of Technology, Bloomfield Hall 308, 32000, Haifa, Israel

    Oren Kurland

  2. Bar-Ilan University, Israel

    Moshe Lewenstein

  3. Department of Computer Science, Bar-Ilan University, 52900, Ramat-Gan, Israel

    Ely Porat

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Patil, M., Shah, R., Thankachan, S.V. (2013). Faster Range LCP Queries. In: Kurland, O., Lewenstein, M., Porat, E. (eds) String Processing and Information Retrieval. SPIRE 2013. Lecture Notes in Computer Science, vol 8214. Springer, Cham. https://doi.org/10.1007/978-3-319-02432-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02432-5_29

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02431-8

  • Online ISBN: 978-3-319-02432-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation