Skip to main content
SpringerLink
Log in

An Approach for LPF Table Computation

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1062))

Included in the following conference series:

Abstract

In this article, we introduce a new solution for the Longest Previous Factor (LPF) table computation. The LPF table is the table that stores the maximal length of factors re-occurring at each position of a string and this table is useful for text compression. The LPF table has the important role for computational biology, data compression and string algorithms. In this paper, we present an approach to compute the LPF table of a string from its suffix heap. The algorithm runs 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., Upper Saddle River (1990)

    Google Scholar 

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

    Book  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. 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 

  5. 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  MATH  Google Scholar 

  6. Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Wale, T.: Computing the longest previous factor. Eur. J. Comb. 34(1), 15–26 (2013)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  9. 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 

  10. Kongsen, J., Chairungsee, S.: Using suffix tray and longest previous factor for pattern searching. In: International Conference on Information Technology, Singapore, Singapore (2017)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Walailak University, Nakhonsithammarat, Thailand

    Supaporn Chairungsee

  2. Suratthani Rajabhat University, Suratthani, Thailand

    Thana Charuphanthuset

Authors
  1. Supaporn Chairungsee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thana Charuphanthuset
    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. Institute of Telecooperation, Johannes Kepler University of Linz, Linz, Oberösterreich, Austria

    Gabriele Anderst-Kotsis

  2. Software Competence Center Hagenberg, Hagenberg, Austria

    A Min Tjoa

  3. Institute of Telecooperation, Johannes Kepler University of Linz, Linz, Oberösterreich, Austria

    Ismail Khalil

  4. ENSIT, LaTICE, University of Tunis, Tunis, Tunisia

    Mourad Elloumi

  5. Software Competence Center, Hagenberg, Austria

    Atif Mashkoor

  6. Steyregg, Oberösterreich, Austria

    Johannes Sametinger

  7. Edificio 204, ICT Division,TECNALIA, Derio, Vizcaya, Spain

    Xabier Larrucea

  8. Top 74, Innsbruck, Tirol, Austria

    Anna Fensel

  9. Hagenberg Gmbh, Software Competence Center, Hagenberg im Mühlkreis, Oberösterreich, Austria

    Jorge Martinez-Gil

  10. Software Competence Center Hagenberg, SC, Hagenberg im Mühlkreis, Oberösterreich, Austria

    Bernhard Moser

  11. University of Twente, ENSCHEDE, Overijssel, The Netherlands

    Christin Seifert

  12. Bauhaus Universität Weimar, Weimar, Thüringen, Germany

    Benno Stein

  13. MiCS, Media Computer Science, University of Passau, Passau, Bayern, Germany

    Michael Granitzer

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chairungsee, S., Charuphanthuset, T. (2019). An Approach for LPF Table Computation. In: Anderst-Kotsis, G., et al. Database and Expert Systems Applications. DEXA 2019. Communications in Computer and Information Science, vol 1062. Springer, Cham. https://doi.org/10.1007/978-3-030-27684-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-27684-3_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-27683-6

  • Online ISBN: 978-3-030-27684-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation