Skip to main content
SpringerLink
Log in

A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes

  • Conference paper
  • First Online:
Combinatorial Pattern Matching (CPM 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1645))

Included in the following conference series:

Abstract

This paper proposes a simple data structure, called a prefix list, which maintains all prefixes of a string in reverse lexicographic order. It can be on-line incrementally constructed in time and space linear in the string length. It is strongly related to sufix trees and sufix arrays, and may share applications with these existing structures. A sufix array can be built via the corresponding prefix list in linear time. Particular applications of the prefix list lie in source-coding problems that require on-line right-to-left string matching. We apply the prefix list to on-line estimation of source entropy and to context-based symbol-ranking text compression algorithms.

Partially supported by the Kayamori foundation of informational science advance- ment and by the Okawa foundation for information and telecommunications.

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. Arnold, R. and Bell, T.: A corpus for the evaluation of lossless compression algorithms. DCC’97, Proc. Data Compression Conf., Snowbird, Utah (1997) 201–210

    Google Scholar 

  2. Bell, T.C., Cleary, J.G., and Witten, I.H.: Text Compression. Prentice Hall, Englewood Cliffs (1990)

    Google Scholar 

  3. Burrows, M. and Wheeler, D.J.: A block-sorting lossless data compression algorithm. SRC Research Report, 124 (1994)

    Google Scholar 

  4. Chen, M.T. and Seiferas, J.: Efficient and elegant subword-tree construction. In Apostolico, A. and Galil, Z. (eds.): Combinatorial Algorithms on Words, NATO ASI Series, Springer, Berlin (1984)

    Google Scholar 

  5. Fenwick, P.M.: Symbol ranking text compression with Shannon recodings. J. Universal Computer Science 3 (1997) 70–85. http://www.iicm.edu/jucs_3_2

    MATH  Google Scholar 

  6. Gonnet, G.H., Baeza-Yates, R.A., and Snider, T.: New indices for text: Pat trees and pat arrays. In Frakes, W.B. and Baeza-Yates, R.A. (eds.): Information Retrieval: Data Structures and Algorithms, Chap. 5. Prentice Hall, Englewood Cliffs (1992) 66–82

    Google Scholar 

  7. Kontoyiannis, I., Algoet, P.H., Suhov, Yu. M., and Wyner, A.J.: Nonparametric entropy estimation for stationary processes and random fields, with applications to English text. IEEE Trans. Inform. Theory 44 (1998) 1319–1327

    Article  MathSciNet  MATH  Google Scholar 

  8. Manber, U. and Myers, G.: Sufix arrays: A new method for on-line string searches. Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms (1990) 319–327. Appeared also in SIAM J. Comput. 22 (1993) 935-948

    MATH  Google Scholar 

  9. Matias, Y., Muthukrishnan, S., Sahinalp, S.C., and Ziv, J.: Augmenting sufix trees with applications. Proc. ESA’98 European Symposium on Algorithms, Venice, Italy (1998)

    Google Scholar 

  10. McCreight, E.M.: A space-economical sufix tree construction algorithm. J. ACM 23 (1976) 262–272

    Article  MathSciNet  MATH  Google Scholar 

  11. Salomon, D.: Data Compression: The Complete Reference. Springer, New York (1998)

    Book  MATH  Google Scholar 

  12. Ukkonen, E.: On-line construction of sufix trees. Algorithmica 14 (1995) 249–260

    Article  MathSciNet  MATH  Google Scholar 

  13. Wyner, A.D., Ziv, J., and Wyner, A. J.: On the role of pattern matching in information theory. IEEE Trans. Inform. Theory 44 (1998) 2045–2056

    Article  MathSciNet  MATH  Google Scholar 

  14. Yokoo, H.: Data compression using a sort-based context similarity measure. Computer Journal 40 (1997) 94–102

    Article  Google Scholar 

  15. Yokoo, H.: Context tables: A tool for describing text compression algorithms. DCC’98, Proc. Data Compression Conf., Snowbird, Utah (1998) 299–308

    Google Scholar 

  16. Ziv, J. and Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory IT-23 (1977) 337–343

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Gunma University, Kiryu, 376-8515, Japan

    Hidetoshi Yokoo

Authors
  1. Hidetoshi Yokoo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute Gaspard-Monge, University of Marne-la-Vallée, F 77454, Marne-la-Vallée Cedex 2, France

    Maxime Crochemore

  2. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, England

    Mike Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yokoo, H. (1999). A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes. In: Crochemore, M., Paterson, M. (eds) Combinatorial Pattern Matching. CPM 1999. Lecture Notes in Computer Science, vol 1645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48452-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-48452-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66278-5

  • Online ISBN: 978-3-540-48452-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation