Skip to main content
SpringerLink
Log in

Most Recent Match Queries in On-Line Suffix Trees

  • Conference paper
Combinatorial Pattern Matching (CPM 2014)

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

Included in the following conference series:

Abstract

A suffix tree is able to efficiently locate a pattern in an indexed string, but not in general the most recent copy of the pattern in an online stream, which is desirable in some applications. We study the most general version of the problem of locating a most recent match: supporting queries for arbitrary patterns, at each step of processing an online stream. We present augmentations to Ukkonen’s suffix tree construction algorithm for optimal-time queries, maintaining indexing time within a logarithmic factor in the size of the indexed string. We show that the algorithm is applicable to sliding-window indexing, and sketch a possible optimization for use in the special case of Lempel-Ziv compression.

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. Apostolico, A.: The myriad virtues of subword trees. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. nato asi series, vol. F12, pp. 85–96. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  2. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997)

    Google Scholar 

  3. Larsson, N.J.: Structures of String Matching and Data Compression. Ph.D. thesis, Department of Computer Science, Lund University, Sweden (September 1999)

    Google Scholar 

  4. Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th Ann. ieee Symp. Switching and Automata Theory, pp. 1–11 (1973)

    Google Scholar 

  5. McCreight, E.M.: A space-economical suffix tree construction algorithm. J. acm 23(2), 262–272 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14(3), 249–260 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  7. Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th Ann. ieee Symp. Foundations of Comput. Sci. pp. 137–143 (October 1997)

    Google Scholar 

  8. Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. siam J. Comput. 22(5), 935–948 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. acm Computing Surveys (CSUR) 39(2), 4 (2007)

    Article  Google Scholar 

  10. Amir, A., Landau, G.M., Ukkonen, E.: Online timestamped text indexing. Information processing letters 82(5), 253–259 (2002)

    Article  MathSciNet  Google Scholar 

  11. Ferragina, P., Nitto, I., Venturini, R.: On the bit-complexity of Lempel-Ziv compression. In: Proc. Twentieth Ann. acm – siam Symp. Discr. Alg. pp. 768–777 (2009)

    Google Scholar 

  12. Crochemore, M., Langiu, A., Mignosi, F.: The rightmost equal-cost position problem. In: Proc. ieee Data Compression Conf. pp. 421–430 (March 2013)

    Google Scholar 

  13. Breslauer, D., Italiano, G.F.: On suffix extensions in suffix trees. Theoretical Computer Science 457, 27–34 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. ieee Trans. Inf. Theory IT 23(3), 337–343 (1977)

    Article  MathSciNet  Google Scholar 

  15. Larsson, N.J., Fuglsang, K., Karlsson, K.: Efficient representation for online suffix tree construction. Preprint, arXiv:1403.0457 [cs.DS], http://arxiv.org/abs/1403.0457

  16. Larsson, N.J.: Most recent match queries in on-line suffix trees (with appendix), arXiv:1403.0800 [cs.DS], http://arxiv.org/abs/1403.0800

  17. Cole, R., Hariharan, R.: Dynamic lca queries on trees. SIAM Journal on Computing 34(4), 894–923 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Fiala, E.R., Greene, D.H.: Data compression with finite windows. Commun. acm 32(4), 490–505 (1989)

    Article  Google Scholar 

  19. Larsson, N.J.: Extended application of suffix trees to data compression. In: Proc. acm Data Compression Conf. pp. 190–199 (March-April 1996)

    Google Scholar 

  20. Dietz, P., Sleator, D.: Two algorithms for maintaining order in a list. In: Proc. 19th Ann. acm Symp. Theory of Computing, pp. 365–372. ACM (1987)

    Google Scholar 

  21. Westbrook, J.: Fast incremental planarity testing. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 342–353. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IT University of Copenhagen, Denmark

    N. Jesper Larsson

Authors
  1. N. Jesper Larsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. St. Petersburg Department of Steklov Institute of Mathematics, 27 Fontanka, 191023, St. Petersburg, Russia

    Alexander S. Kulikov

  2. National Research University Higher School of Economics, Bldg 3, Bolshoy Trekhsvyatitelskiy pereulok, 109028, Moscow, Russia

    Sergei O. Kuznetsov

  3. University of California at San Diego, 9500 Gilman Drive, EBU3b 4236, 92093-0404, La Jolla, CA, USA

    Pavel Pevzner

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Larsson, N.J. (2014). Most Recent Match Queries in On-Line Suffix Trees. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds) Combinatorial Pattern Matching. CPM 2014. Lecture Notes in Computer Science, vol 8486. Springer, Cham. https://doi.org/10.1007/978-3-319-07566-2_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07566-2_26

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07565-5

  • Online ISBN: 978-3-319-07566-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation