Document Open Access Logo

A Taxonomy of LCP-Array Construction Algorithms

Authors Johannes Fischer , Enno Ohlebusch

PDF HTML 5

Files

Thumbnail PDF
PDF
OASIcs.Manzini.8.pdf
  • Filesize: 1.62 MB
  • 17 pages
HTML5 Logo HTML (experimental)
OASIcs.Manzini.8.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Data structures design and analysis
Keywords
  • longest common prefix array
  • suffix array
  • Burrows-Wheeler transform

Metrics

Abstract

The combination of the suffix array and the LCP-array can be used to solve many string processing problems efficiently. We review some of the most important sequential LCP-array construction algorithms in random access memory.

Cite As Get BibTex

Johannes Fischer and Enno Ohlebusch. A Taxonomy of LCP-Array Construction Algorithms. In The Expanding World of Compressed Data: A Festschrift for Giovanni Manzini's 60th Birthday. Open Access Series in Informatics (OASIcs), Volume 131, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.Manzini.8

Author Details

Johannes Fischer
  • TU Dortmund, Germany
Enno Ohlebusch
  • Ulm University, Germany

References

  1. Mohamed Ibrahim Abouelhoda, Stefan Kurtz, and Enno Ohlebusch. Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms, 2(1):53-86, 2004. URL: https://doi.org/10.1016/S1570-8667(03)00065-0.
  2. Jarno N. Alanko, Elena Biagi, and Simon J. Puglisi. Longest common prefix arrays for succinct k-spectra. In Franco Maria Nardini, Nadia Pisanti, and Rossano Venturini, editors, String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings, volume 14240 of Lecture Notes in Computer Science, pages 1-13. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-43980-3_1.
  3. Jarno N. Alanko, Davide Cenzato, Nicola Cotumaccio, Sung-Hwan Kim, Giovanni Manzini, and Nicola Prezza. Computing the LCP array of a labeled graph. In Shunsuke Inenaga and Simon J. Puglisi, editors, 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, June 25-27, 2024, Fukuoka, Japan, volume 296 of LIPIcs, pages 1:1-1:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.CPM.2024.1.
  4. Alberto Apostolico. The myriad virtues of subword trees. In Combinatorial Algorithms on Words, pages 85-96. Springer, 1985. Google Scholar
  5. Jérémy Barbay, Johannes Fischer, and Gonzalo Navarro. LRM-trees: Compressed indices, adaptive sorting, and compressed permutations. Theor. Comput. Sci., 459:26-41, 2012. URL: https://doi.org/10.1016/J.TCS.2012.08.010.
  6. D. Belazzougui. Linear time construction of compressed text indices in compact space. In Proc. 46th Annual ACM Symposium on Theory of Computing, pages 148-193, 2014. Google Scholar
  7. Timo Beller, Simon Gog, Enno Ohlebusch, and Thomas Schnattinger. Computing the longest common prefix array based on the Burrows-Wheeler transform. Journal of Discrete Algorithms, 18:22-31, 2013. URL: https://doi.org/10.1016/J.JDA.2012.07.007.
  8. Timo Bingmann, Johannes Fischer, and Vitaly Osipov. Inducing suffix and LCP arrays in external memory. ACM J. Exp. Algorithmics, 21(1):2.3:1-2.3:27, 2016. URL: https://doi.org/10.1145/2975593.
  9. M. Burrows and D.J. Wheeler. A block-sorting lossless data compression algorithm. Research Report 124, Digital Systems Research Center, 1994. Google Scholar
  10. Richard Cole and Ramesh Hariharan. Dynamic LCA queries on trees. SIAM J. Comput., 34(4):894-923, 2005. URL: https://doi.org/10.1137/S0097539700370539.
  11. Alessio Conte, Nicola Cotumaccio, Travis Gagie, Giovanni Manzini, Nicola Prezza, and Marinella Sciortino. Computing matching statistics on Wheeler DFAs. In Ali Bilgin, Michael W. Marcellin, Joan Serra-Sagristà, and James A. Storer, editors, Data Compression Conference, DCC 2023, Snowbird, UT, USA, March 21-24, 2023, pages 150-159. IEEE, 2023. URL: https://doi.org/10.1109/DCC55655.2023.00023.
  12. Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, and Guilherme P. Telles. External memory BWT and LCP computation for sequence collections with applications. Algorithms Mol. Biol., 14(1):6:1-6:15, 2019. URL: https://doi.org/10.1186/S13015-019-0140-0.
  13. Johannes Fischer. Wee LCP. Inf. Process. Lett., 110(8-9):317-320, 2010. URL: https://doi.org/10.1016/J.IPL.2010.02.010.
  14. Johannes Fischer. Inducing the LCP-array. In Frank Dehne, John Iacono, and Jörg-Rüdiger Sack, editors, Algorithms and Data Structures - 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings, volume 6844 of Lecture Notes in Computer Science, pages 374-385. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-22300-6_32.
  15. Johannes Fischer and Volker Heun. Finding range minima in the middle: Approximations and applications. Math. Comput. Sci., 3(1):17-30, 2010. URL: https://doi.org/10.1007/S11786-009-0007-8.
  16. Johannes Fischer and Volker Heun. Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput., 40(2):465-492, 2011. URL: https://doi.org/10.1137/090779759.
  17. Patrick Flick and Srinivas Aluru. Parallel distributed memory construction of suffix and longest common prefix arrays. In Jackie Kern and Jeffrey S. Vetter, editors, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2015, Austin, TX, USA, November 15-20, 2015, pages 16:1-16:10. ACM, 2015. URL: https://doi.org/10.1145/2807591.2807609.
  18. Simon Gog and Enno Ohlebusch. Compressed suffix trees: Efficient computation and storage of LCP-values. Journal of Experimental Algorithmics, 18:2.1, 2013. URL: https://doi.org/10.1145/2444016.2461327.
  19. Gaston H. Gonnet, Ricardo Baeza-Yates, and Tim Snider. New indices for text: PAT trees and PAT arrays. In Information Retrieval: Data Structures and Algorithms, chapter 5, pages 66-82. Prentice-Hall, Englewood Cliffs, NJ, 1992. Google Scholar
  20. Wing-Kai Hon, Kunihiko Sadakane, and Wing-Kin Sung. Breaking a time-and-space barrier in constructing full-text indices. In Proc. 44th Annual IEEE Symposium on Foundations of Computer Science, pages 251-260, 2003. URL: https://doi.org/10.1109/SFCS.2003.1238199.
  21. Juha Kärkkäinen and Dominik Kempa. Better external memory LCP array construction. ACM J. Exp. Algorithmics, 24(1):1.3:1-1.3:27, 2019. URL: https://doi.org/10.1145/3297723.
  22. Juha Kärkkäinen, Giovanni Manzini, and Simon J. Puglisi. Permuted longest-common-prefix array. In Proc. 20th Annual Symposium on Combinatorial Pattern Matching, volume 5577 of Lecture Notes in Computer Science, pages 181-192. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-02441-2_17.
  23. Juha Kärkkäinen and Peter Sanders. Simple linear work suffix array construction. In Proc. 30th International Colloquium on Automata, Languages and Programming, volume 2719 of Lecture Notes in Computer Science, pages 943-955. Springer, 2003. URL: https://doi.org/10.1007/3-540-45061-0_73.
  24. Juha Kärkkäinen, Peter Sanders, and Stefan Burkhardt. Linear work suffix array construction. J. ACM, 53(6):918-936, 2006. URL: https://doi.org/10.1145/1217856.1217858.
  25. Toru Kasai, Hiroki Arimura Gunho Lee, Setsuo Arikawa, and Kunsoo Park. Linear-time longest-common-prefix computation in suffix arrays and its applications. In Proc. 12th Annual Symposium on Combinatorial Pattern Matching, volume 2089 of Lecture Notes in Computer Science, pages 181-192. Springer, 2001. URL: https://doi.org/10.1007/3-540-48194-X_17.
  26. Dong Kyue Kim, Jeong Seop Sim, Heejin Park, and Kunsoo Park. Linear-time construction of suffix arrays. In Proc. 14th Annual Symposium on Combinatorial Pattern Matching, volume 2676 of Lecture Notes in Computer Science, pages 186-199. Springer-Verlag, 2003. URL: https://doi.org/10.1007/3-540-44888-8_14.
  27. Pang Ko and Srinivas Aluru. Space efficient linear time construction of suffix arrays. In Proc. 14th Annual Symposium on Combinatorial Pattern Matching, volume 2676 of Lecture Notes in Computer Science, pages 200-210. Springer-Verlag, 2003. URL: https://doi.org/10.1007/3-540-44888-8_15.
  28. Felipe A. Louza, Guilherme P. Telles, Steve Hoffmann, and Cristina Dutra de Aguiar Ciferri. Generalized enhanced suffix array construction in external memory. Algorithms Mol. Biol., 12(1):26:1-26:16, 2017. URL: https://doi.org/10.1186/S13015-017-0117-9.
  29. Veli Mäkinen. Compact suffix array - a space-efficient full-text index. Fundamenta Informaticae, 56(1-2):191-210, 2003. URL: http://content.iospress.com/articles/fundamenta-informaticae/fi56-1-2-12.
  30. Udi Manber and Gerne Myers. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993. URL: https://doi.org/10.1137/0222058.
  31. Giovanni Manzini. Two space saving tricks for linear time LCP array computation. In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 372-383. Springer, 2004. URL: https://doi.org/10.1007/978-3-540-27810-8_32.
  32. Giovanni Manzini. Longest common prefix with mismatches. In Costas S. Iliopoulos, Simon J. Puglisi, and Emine Yilmaz, editors, String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings, volume 9309 of Lecture Notes in Computer Science, pages 299-310. Springer, 2015. URL: https://doi.org/10.1007/978-3-319-23826-5_29.
  33. Ge Nong, Sen Zhang, and Wai Hong Chan. Two efficient algorithms for linear time suffix array construction. IEEE Trans. Computers, 60(10):1471-1484, 2011. URL: https://doi.org/10.1109/TC.2010.188.
  34. Enno Ohlebusch. Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction. Oldenbusch Verlag, 2013. Google Scholar
  35. Jannik Olbrich, Enno Ohlebusch, and Thomas Büchler. Generic non-recursive suffix array construction. ACM Transactions on Algorithms, 20(2), 2024. URL: https://doi.org/10.1145/3641854.
  36. Nicola Prezza and Giovanna Rosone. Space-efficient computation of the LCP array from the Burrows-Wheeler transform. In Proc. 30th Annual Symposium on Combinatorial Pattern Matching, volume 128 of Leibniz International Proceedings in Informatics, pages 7:1-7:18, 2019. URL: https://doi.org/10.4230/LIPICS.CPM.2019.7.
  37. Simon J. Puglisi, Bill Smyth, and Andrew Turpin. A taxonomy of suffix array construction algorithms. ACM Computing Surveys, 39(2):Article 4, 2007. Google Scholar
  38. Massimiliano Rossi, Marco Oliva, Ben Langmead, Travis Gagie, and Christina Boucher. MONI: A pangenomic index for finding maximal exact matches. J. Comput. Biol., 29(2):169-187, 2022. URL: https://doi.org/10.1089/CMB.2021.0290.
  39. Kunihiko Sadakane. Compressed suffix trees with full functionality. Theory Comput. Syst., 41(4):589-607, 2007. URL: https://doi.org/10.1007/S00224-006-1198-X.
  40. Julian Shun. Fast parallel computation of longest common prefixes. In Trish Damkroger and Jack J. Dongarra, editors, International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2014, New Orleans, LA, USA, November 16-21, 2014, pages 387-398. IEEE Computer Society, 2014. URL: https://doi.org/10.1109/SC.2014.37.
  41. Jouni Sirén. Sampled longest common prefix array. In Amihood Amir and Laxmi Parida, editors, Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings, volume 6129 of Lecture Notes in Computer Science, pages 227-237. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-13509-5_21.
  42. Jean Vuillemin. A unifying look at data structures. Commun. ACM, 23(4):229-239, 1980. URL: https://doi.org/10.1145/358841.358852.
  43. Peter Weiner. Linear pattern matching algorithms. In Proc. 14th IEEE Annual Symposium on Switching and Automata Theory, pages 1-11, 1973. URL: https://doi.org/10.1109/SWAT.1973.13.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact