2019/01/01 by Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini +2
Computer Science · #Algorithms and Data Compression #Alphabet #Compressed suffix array #Computation #Generalized suffix tree #Handwritten Text Recognition Techniques #Natural Language Processing Techniques #Preprocessor #Sorting #Suffix #Suffix array #cs.DS
paper · pdf · doi:10.1007/978-3-030-32686-9_10
Accepted to SPIRE'19
openalex publication_date 2019/01/01 · openalex created_date 2019/06/07 · arxiv created 2019/07/26 · arxiv updated 2020/09/10 · openalex updated_date 2026/08/05
In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in O(n) time using σ+ O(1) words of working space, where n is the length of the text and σ is the alphabet size. Our result improves the previous best space requirement for linear time computation of the Lyndon array. In fact, all the known linear algorithms for Lyndon array computation use suffix sorting as a preprocessing step and use O(n) words of working space in addition to the Lyndon array and suffix array. Experimental results with real and synthetic datasets show that our algorithm is not only space-efficient but also fast in practice.