Minimum unique substrings and maximum repeats

DOI10.3233/FI-2011-536MaRDI QIDQ3100935zbMATH OpenOpenAlexFDO

Authors Lucian Ilie, W. F. Smyth

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)

Recommendations

• Computing minimal unique substrings for a sliding window
• Space-time trade-offs for finding shortest unique substrings and maximal unique matches
• Space-efficient algorithms for computing minimal/shortest unique substrings
• Shortest unique substrings queries in optimal time
• Space-time trade-offs for the shortest unique substring problem

Cited in

(9)

• Computing minimal unique substrings for a sliding window
• Computing regularities in strings: a survey
• Computing minimal absent words and extended bispecial factors with CDAWG space
• Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
• A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
• Double-ended palindromic trees in linear time
• Palindromic trees for a sliding window and its applications
• Alignment-free sequence comparison using absent words
• Minimizing positive integer sequences without duplicate substrings

This page was built for publication: Minimum unique substrings and maximum repeats

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