On baier's sort of maximal Lyndon substrings

Franěk, F., Liut, M. and Smyth, W.F. (2018) On baier's sort of maximal Lyndon substrings. In: Prague Stringology Conference (PSC) 2018, 27 - 28 August 2018, Czech Technical University, Prague

Abstract

We describe and analyze in terms of Lyndon words an elementary sort of maximal Lyndon factors of a string and prove formally its correctness. Since the sort is based on the first phase of Baier’s algorithm for sorting of the suffixes of a string, we refer to it as Baier’s sort.

Item Type:	Conference Paper
Murdoch Affiliation(s):	School of Engineering and Information Technology
Conference Website:	http://www.stringology.org/
URI:	http://researchrepository.murdoch.edu.au/id/eprint/56409

Item Control Page

Downloads