Minimum Unique Substrings and Maximum Repeats

DOI10.3233/FI-2011-536zbMath1252.68360OpenAlexW1542422837MaRDI QIDQ3100935

W. F. Smyth, Lucian Ilie

Publication date: 22 November 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2011-536

zbMATH Keywords

string algorithmsmaximum repeatsminimum unique substrings

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items

A simple yet time-optimal and linear-space algorithm for shortest unique substring queries, Palindromic trees for a sliding window and its applications, Computing regularities in strings: a survey, Alignment-free sequence comparison using absent words, Computing minimal unique substrings for a sliding window