Computing the Antiperiod(s) of a String
From MaRDI portal
Publication:5088925
DOI10.4230/LIPIcs.CPM.2019.32OpenAlexW2953708110MaRDI QIDQ5088925
Golnaz Badkobeh, Hayam Alamro, Costas S. Iliopoulos, Simon J. Puglisi, Djamal Belazzougui
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/lipics.cpm.2019.32
Related Items (2)
Property Suffix Array with Applications in Indexing Weighted Sequences ⋮ Efficient representation and counting of antipower factors in words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Anti-power prefixes of the Thue-Morse word
- The ``runs conjecture
- A linear-time algorithm for a special case of disjoint set union
- \((k,\lambda)\)-anti-powers and other patterns in words
- Algorithms for anti-powers in strings
- Anti-powers in infinite words
- Functions on antipower prefix lengths of the Thue-Morse word
- Indexing weighted sequences: neat and efficient
- Weighted Ancestors in Suffix Trees
- Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
- Algorithms on Strings, Trees and Sequences
- Jewels of Stringology
- Anti-power $j$-fixes of the Thue-Morse word
- A Linear-Time Algorithm for Seeds Computation
- The “Runs” Theorem
- Efficient representation and counting of antipower factors in words
This page was built for publication: Computing the Antiperiod(s) of a String
