Mhaskar, Neerja; Smyth, W. F. String covering: a survey. (English) Zbl 07798898 Fundam. Inform. 190, No. 1, 17-45 (2022). MSC: 68-XX PDFBibTeX XMLCite \textit{N. Mhaskar} and \textit{W. F. Smyth}, Fundam. Inform. 190, No. 1, 17--45 (2022; Zbl 07798898) Full Text: DOI arXiv
Guth, Ondřej On approximate enhanced covers under Hamming distance. (English) Zbl 1434.68735 Discrete Appl. Math. 274, 67-80 (2020). MSC: 68W32 68R15 PDFBibTeX XMLCite \textit{O. Guth}, Discrete Appl. Math. 274, 67--80 (2020; Zbl 1434.68735) Full Text: DOI
Amir, Amihood; Iliopoulos, Costas S.; Radoszewski, Jakub Two strings at Hamming distance 1 cannot be both quasiperiodic. (English) Zbl 1420.68161 Inf. Process. Lett. 128, 54-57 (2017). MSC: 68R15 PDFBibTeX XMLCite \textit{A. Amir} et al., Inf. Process. Lett. 128, 54--57 (2017; Zbl 1420.68161) Full Text: DOI arXiv
Alatabbi, Ali; Sohel Rahman, M.; Smyth, W. F. Computing covers using prefix tables. (English) Zbl 1350.68297 Discrete Appl. Math. 212, 2-9 (2016). MSC: 68W32 PDFBibTeX XMLCite \textit{A. Alatabbi} et al., Discrete Appl. Math. 212, 2--9 (2016; Zbl 1350.68297) Full Text: DOI arXiv
Badkobeh, Golnaz; Crochemore, Maxime Computing maximal-exponent factors in an overlap-free word. (English) Zbl 1333.68303 J. Comput. Syst. Sci. 82, No. 3, 477-487 (2016). MSC: 68W32 68Q45 68R15 PDFBibTeX XMLCite \textit{G. Badkobeh} and \textit{M. Crochemore}, J. Comput. Syst. Sci. 82, No. 3, 477--487 (2016; Zbl 1333.68303) Full Text: DOI Link
Flouri, Tomáš; Iliopoulos, Costas S.; Kociumaka, Tomasz; Pissis, Solon P.; Puglisi, Simon J.; Smyth, W. F.; Tyczyński, Wojciech Enhanced string covering. (English) Zbl 1301.68211 Theor. Comput. Sci. 506, 102-114 (2013). MSC: 68R15 68W32 PDFBibTeX XMLCite \textit{T. Flouri} et al., Theor. Comput. Sci. 506, 102--114 (2013; Zbl 1301.68211) Full Text: DOI
Christou, M.; Crochemore, M.; Iliopoulos, C. S.; Kubica, M.; Pissis, S. P.; Radoszewski, J.; Rytter, W.; Szreder, B.; Waleń, T. Efficient seed computation revisited. (English) Zbl 1292.68179 Theor. Comput. Sci. 483, 171-181 (2013). MSC: 68W32 68W40 PDFBibTeX XMLCite \textit{M. Christou} et al., Theor. Comput. Sci. 483, 171--181 (2013; Zbl 1292.68179) Full Text: DOI
Smyth, W. F. Computing regularities in strings: a survey. (English) Zbl 1253.68277 Eur. J. Comb. 34, No. 1, 3-14 (2013). MSC: 68R15 PDFBibTeX XMLCite \textit{W. F. Smyth}, Eur. J. Comb. 34, No. 1, 3--14 (2013; Zbl 1253.68277) Full Text: DOI
Kociumaka, Tomasz; Kubica, Marcin; Radoszewski, Jakub; Rytter, Wojciech; Waleń, Tomasz A linear time algorithm for seeds computation. (English) Zbl 1423.68619 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1095-1112 (2012). MSC: 68W32 68R15 PDFBibTeX XMLCite \textit{T. Kociumaka} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1095--1112 (2012; Zbl 1423.68619) Full Text: arXiv Link
Christou, Michalis; Crochemore, Maxime; Iliopoulos, Costas S. Identifying all abelian periods of a string in quadratic time and relevant problems. (English) Zbl 1266.68147 Int. J. Found. Comput. Sci. 23, No. 6, 1371-1384 (2012). MSC: 68R15 68W05 PDFBibTeX XMLCite \textit{M. Christou} et al., Int. J. Found. Comput. Sci. 23, No. 6, 1371--1384 (2012; Zbl 1266.68147) Full Text: DOI arXiv