TY - GEN
T1 - Inducing the Lyndon Array
AU - Mantaci, Sabrina
AU - Sciortino, Marinella
AU - Louza, Felipe A.
AU - Louza, Felipe A.
AU - Telles, Guilherme P.
AU - Manzini, Giovanni
PY - 2019
Y1 - 2019
N2 - 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(n) 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.
AB - 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(n) 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.
UR - http://hdl.handle.net/10447/396233
UR - https://link.springer.com/chapter/10.1007/978-3-030-32686-9_10
M3 - Conference contribution
SN - 978-3-030-32685-2; 978-3-030-32686-9
T3 - LECTURE NOTES IN COMPUTER SCIENCE
SP - 138
EP - 151
BT - String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7–9, 2019, Proceedings
ER -