Finding the cyclic covers of a string
From MaRDI portal
Cites work
- A linear time algorithm for seeds computation
- Algorithms on Strings, Trees and Sequences
- An Algorithm for a Minimum Cover of a Graph
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Approximate cover of strings
- Computing the cover array in linear time
- Efficient detection of quasiperiodicities in strings
- Factorizing words over an ordered alphabet
- Fast algorithm for partial covers in words
- Fast canonization of circular strings
- Fast parallel Lyndon factorization with applications
- Finding the Anticover of a String
- scientific article; zbMATH DE number 1740998 (Why is no real title available?)
- scientific article; zbMATH DE number 2038766 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- Internal pattern matching queries in a text and applications
- Large-scale clique cover of real-world networks
- Lexicographically least circular substrings
- Linear-time computation of cyclic roots and cyclic covers of a string
- Lyndon factorization of infinite words
- Lyndon factorization of Sturmian words
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Online algorithms on antipowers and antiperiods
- Optimal parallel algorithms for string matching
- Optimal superprimitivity testing for strings
- Real-time streaming string-matching
- Shortest covers of all cyclic shifts of a string
- Some Estimates for σ(n)
- Uniqueness Theorems for Periodic Functions
This page was built for publication: Finding the cyclic covers of a string
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912021)
