Enhanced covers of regular and indeterminate strings using prefix tables

DOI10.25596/JALC-2016-131MaRDI QIDQ5267518zbMATH OpenFDO

Authors Ali Alatabbi, A. S. M. Sohidull Islam, M. Sohel Rahman, W. F. Smyth, Jamie Simpson

Publication date 13 June 2017

Full work available at URL https://arxiv.org/abs/1506.06793

zbMATH Keywords

algorithmstringcoverwordborder arrayindeterminate stringprefix tableenhanced cover

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Recommendations

• Computing covers using prefix tables
• On approximate enhanced covers under Hamming distance
• Enhanced string covering
• Verifying an enhanced cover array in linear time
• Computing the cover array in linear time

Cited in

(6)

• Verifying an enhanced cover array in linear time
• String Covering: A Survey
• String covering with optimal covers
• Quasi-Periodicity in Streams
• Computing covers using prefix tables
• On approximate enhanced covers under Hamming distance

This page was built for publication: Enhanced covers of regular and indeterminate strings using prefix tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267518)