String covering with optimal covers
From MaRDI portal
Publication:1757464
DOI10.1016/j.jda.2018.09.003zbMath1409.68357OpenAlexW2898462080MaRDI QIDQ1757464
Publication date: 4 January 2019
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://researchrepository.murdoch.edu.au/id/eprint/42430/
Related Items
Cites Work
- Enhanced string covering
- Fast algorithm for partial covers in words
- Fast, practical algorithms for computing all the repeats in a string
- Efficient detection of quasiperiodicities in strings
- Optimal superprimitivity testing for strings
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Frequency Covers for Strings
- The “Runs” Theorem
- Computing the cover array in linear time
- Unnamed Item
- Unnamed Item
- Unnamed Item