Skip to main content
SpringerLink
Log in

Longest Previous Non-overlapping Factors Table Computation

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2017)

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

Abstract

We examine the computation of the Longest Previous non-overlapping Factor (LPnF) table. The LPnF table is the table that stores the maximal length of factors re-occurring at each position of a string without overlapping. The LPnF table is related to well-known techniques for data compression, such as Ziv-Lempel factorization. This table is useful both for string algorithms and for text compression. In this paper, we present two algorithms to compute the LPnF table of a string: one from its augmented position heap and the other from its suffix heap. The proposed algorithms run in linear time with linear memory space.

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 EPUB and 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

References

  1. Bell, T.C., Clearly, J.G., Witten, I.H.: Text Compression. Prentice Hall Inc., New Jersey (1990)

    Google Scholar 

  2. Böckenhauer, H.J., Bongartz, D.: Algorithmic Aspects of Bioinformatics. Springer, Berlin (2007)

    MATH  Google Scholar 

  3. Butrak, T., Chareonrak, S., Charuphanthuset, T., Chairungsee, S.: A new approach for longest previous non-overlapping factors computation. In: International Conference on Computer and Information Sciences, Hongkong, China (2015)

    Google Scholar 

  4. Chairungsee, S., Butrak, T., Chareonrak, S., Charuphanthuset, T.: Longest Previous non-overlapping Factors computation. In: 26th International Workshop on Database and Expert Systems Applications, pp. 5–8. IEEE (2015)

    Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Massachusetts (2009)

    MATH  Google Scholar 

  6. Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  7. Crochemore, C., Ilie, L.: Computing longest previous factor in linear time and applications. Inf. Process. Lett. 106(2), 75–80 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Waleń, T.: LPF computation revisited. In: Fiala, J., Kratochvíl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol. 5874, pp. 158–169. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10217-2_18

    Chapter  Google Scholar 

  9. Crochemore, M., Iliopoulos, C.S., Kubica, M., Rytter, W., Waleń, T.: Efficient algorithms for two extensions of LPF table: the power of suffix arrays. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds.) SOFSEM 2010. LNCS, vol. 5901, pp. 296–307. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-11266-9_25

    Chapter  Google Scholar 

  10. Crochemore, C., Tischler, G.: Computing longest previous nonoverlapping factors. Inf. Process. Lett. 111, 291–295 (2011)

    Article  MATH  Google Scholar 

  11. Drozdek, A.: Data Structures and Algorithms in C++. Cengage Learning, Boston (2013)

    Google Scholar 

  12. Ehrenfeucht, A., McConnell, R.M., Osheim, N., Woo, S.W.: Position heaps: a simple and dynamic text indexing data structure. J. Discret. Algorithms 9, 100–121 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gagie, T., Hon, W.-K., Ku, T.-H.: New algorithms for position heaps. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol. 7922, pp. 95–106. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-38905-4_11

    Chapter  Google Scholar 

  14. Pu, I.M.: Fundamental Data Compression. A Butterworth-Heinemann, Oxford (2006)

    Google Scholar 

  15. Storer, J.A.: Data Compression: Methods and Theory. Computer Science Press, New York (1988)

    Google Scholar 

  16. Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes. Van Nostrand Reinhold, New York (1994)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Walailak University, Nakhonsithammarat, Thailand

    Supaporn Chairungsee

  2. King’s College London, London, UK

    Maxime Crochemore

Authors
  1. Supaporn Chairungsee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maxime Crochemore
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Supaporn Chairungsee .

Editor information

Editors and Affiliations

  1. Shanghai Jiao Tong University, Shanghai, China

    Xiaofeng Gao

  2. Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

  3. Kennesaw State University, Kennesaw, Georgia, USA

    Meng Han

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chairungsee, S., Crochemore, M. (2017). Longest Previous Non-overlapping Factors Table Computation. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10628. Springer, Cham. https://doi.org/10.1007/978-3-319-71147-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71147-8_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71146-1

  • Online ISBN: 978-3-319-71147-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation