Efficient algorithms to compute closed substrings

DOI10.1007/S00224-026-10290-XMaRDI QIDQ7397042zbMATH OpenFDO

Authors Samkith K. Jain, Neerja Mhaskar

Publication date 2026

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-026-10290-X

Mathematics Subject Classification ID

Group theory and generalizations (20-XX) Computer science (68-XX)

Cites work

• A classification of trapezoidal words
• A Fast Merging Algorithm
• An optimal algorithm for computing the repetitions in a word
• An optimal algorithm to compute all the covers of a string
• Closed factorization
• Closed Ziv-Lempel factorization of the \(m\)-bonacci words
• Enumeration and structure of trapezoidal words
• Experimental evaluation of algorithms for computing quasiperiods
• Fast algorithm for partial covers in words
• Finding maximal closed substrings
• Finite and infinite closed-rich words
• scientific article; zbMATH DE number 1615296 (Why is no real title available?)
• scientific article; zbMATH DE number 2185638 (Why is no real title available?)
• scientific article; zbMATH DE number 1390079 (Why is no real title available?)
• Maximal closed substrings
• On the number of closed factors in a word
• Open and closed factors in Arnoux-Rauzy words
• Permuted Longest-Common-Prefix Array
• Scalable Suffix Sorting on a Multicore Machine
• String Covering: A Survey
• The sequence of open and closed prefixes of a Sturmian word
• Two Efficient Algorithms for Linear Time Suffix Array Construction

This page was built for publication: Efficient algorithms to compute closed substrings

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