Conference paper
On baier's sort of maximal Lyndon substrings
Prague Stringology Conference (PSC) 2018 (Czech Technical University, Prague, 27/08/2018–28/08/2018)
2018
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.
Details
- Title
- On baier's sort of maximal Lyndon substrings
- Authors/Creators
- F. Franěk (Author/Creator)M. Liut (Author/Creator)W.F. Smyth (Author/Creator)
- Conference
- Prague Stringology Conference (PSC) 2018 (Czech Technical University, Prague, 27/08/2018–28/08/2018)
- Identifiers
- 991005541468207891
- Murdoch Affiliation
- School of Engineering and Information Technology
- Language
- English
- Resource Type
- Conference paper
Metrics
79 File views/ downloads
44 Record Views