Suffixes, conjugates and Lyndon words

DOI10.1007/978-3-642-38771-5_13MaRDI QIDQ5300835zbMATH OpenOpenAlexFDO

Authors Silvia Bonomo, Giovanna Rosone, M. Sciortino, Sabrina Mantaci, Antonio Restivo

Publication date 28 June 2013

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38771-5_13

zbMATH Keywords

Lyndon wordsconjugacysuffix arrayBWTLyndon factorizationcircular wordsEBWT

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Sorting conjugates and suffixes of words in a multiset
• Suffix array and Lyndon factorization of a text
• Linear construction of a left Lyndon tree
• A survey of string orderings and their application to the Burrows-Wheeler transform
• Words over an ordered alphabet and suffix permutations

Cited in

(13)

• Lyndon factorization algorithms for small alphabets and run-length encoded strings
• Words over an ordered alphabet and suffix permutations
• The Burrows-Wheeler transform between data compression and combinatorics on words
• Extended suffix array construction using Lyndon factors
• String rearrangement inequalities and a total order between primitive words
• Lyndon array construction during Burrows-Wheeler inversion
• Suffix array and Lyndon factorization of a text
• Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
• Linear construction of a left Lyndon tree
• A combinatorial view on string attractors
• 2D Lyndon words and applications
• Inverse Lyndon words and inverse Lyndon factorizations of words
• Sorting conjugates and suffixes of words in a multiset

This page was built for publication: Suffixes, conjugates and Lyndon words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300835)