Suffixes, conjugates and Lyndon words

DOI10.1007/978-3-642-38771-5_13zbMATH Open1381.68230OpenAlexW110724892MaRDI QIDQ5300835FDOQ5300835

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

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

zbMATH Keywords

Lyndon wordsconjugacysuffix arrayBWTLyndon factorizationcircular wordsEBWT

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (13)

• The Burrows-Wheeler transform between data compression and combinatorics on words
• String rearrangement inequalities and a total order between primitive words
• Extended suffix array construction using Lyndon factors
• 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
• Sorting conjugates and suffixes of words in a multiset
• Inverse Lyndon words and inverse Lyndon factorizations of words
• Words over an ordered alphabet and suffix permutations
• Lyndon factorization algorithms for small alphabets and run-length encoded strings

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)