Space-efficient online computation of string net occurrences

DOI10.4230/LIPICS.CPM.2025.23MaRDI QIDQ7299458zbMATH OpenFDO

Authors Takuya Mieno, Shunsuke Inenaga

Publication date 17 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2025.23

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• Complete inverted files for efficient text retrieval and analysis
• Composite repetition-aware data structures
• Computing minimal absent words and extended bispecial factors with CDAWG space
• Computing minimal unique substrings for a sliding window
• Exploiting new properties of string net frequency for efficient computation
• scientific article; zbMATH DE number 7696007 (Why is no real title available?)
• Minimum unique substrings and maximum repeats
• On suffix extensions in suffix trees
• On the structure of compacted subword graphs of Thue-Morse words and their applications
• On-line construction of compact directed acyclic word graphs
• On-line construction of suffix trees
• Suffix Arrays: A New Method for On-Line String Searches
• The structure of subword graphs and suffix trees of Fibonacci words

Cited in

(1)

• Net occurrences in Fibonacci and Thue-Morse words

This page was built for publication: Space-efficient online computation of string net occurrences

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