Abstract
In this paper we are interested in the study of the combinatorial aspects connecting three important constructions in the field of string algorithms: the suffix array, the Burrows-Wheeler transform (BWT) and the extended Burrows-Wheeler transform (EBWT). Such constructions involve the notions of suffixes and conjugates of words and are based on two different order relations, denoted by
Author supplied keywords
Cite
CITATION STYLE
Bonomo, S., Mantaci, S., Restivo, A., Rosone, G., & Sciortino, M. (2013). Suffixes, conjugates and Lyndon words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7907 LNCS, pp. 131–142). https://doi.org/10.1007/978-3-642-38771-5_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
