Linear computation of unbordered conjugate on unordered alphabet
From MaRDI portal
(Redirected from Publication:393901)
Recommendations
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1306893 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- Algorithms on Strings
- Factorizing words over an ordered alphabet
- Fast canonization of circular strings
- Lexicographically least circular substrings
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Optimal canonization of all substrings of a string
- Periodicity and unbordered segments of words
- Periodicity and unbordered words
- Relationship between the period of a finite word and the length of its unbordered segments
- Rotations of Periodic Strings and Short Superstrings
- STACS 2004
- Uniqueness Theorems for Periodic Functions
Cited in
(6)
This page was built for publication: Linear computation of unbordered conjugate on unordered alphabet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393901)