Finding the cyclic covers of a string
From MaRDI portal
Publication:6091155
DOI10.1007/978-3-031-27051-2_13MaRDI QIDQ6091155
Wing-Kin Sung, Roberto Grossi, Wiktor Zuba, Costas S. Iliopoulos, Jesper Jansson, Zara Lim
Publication date: 24 November 2023
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast algorithm for partial covers in words
- Efficient detection of quasiperiodicities in strings
- Optimal superprimitivity testing for strings
- Grandes valeurs de la fonction somme des diviseurs et hypothèse de Riemann
- Lexicographically least circular substrings
- An on-line string superprimitivity test
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Lyndon factorization of Sturmian words
- Large-scale clique cover of real-world networks
- Approximate cover of strings
- An Algorithm for a Minimum Cover of a Graph
- Factorizing words over an ordered alphabet
- Optimal parallel algorithms for string matching
- Fast canonization of circular strings
- Algorithms on Strings, Trees and Sequences
- Fast parallel Lyndon factorization with applications
- Jewels of Stringology
- Lyndon factorization of infinite words
- Real-Time Streaming String-Matching
- A Linear-Time Algorithm for Seeds Computation
- Uniqueness Theorems for Periodic Functions
- Internal Pattern Matching Queries in a Text and Applications
- Finding the Anticover of a String
- Shortest covers of all cyclic shifts of a string
- Computing the cover array in linear time
