Faster and simpler online computation of string net frequency

DOI10.1016/J.IPL.2026.106620MaRDI QIDQ7227481zbMATH OpenFDO

Authors Shunsuke Inenaga

Publication date 10 April 2026

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2026.106620

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Complete inverted files for efficient text retrieval and analysis
• Exploiting new properties of string net frequency for efficient computation
• Fast incremental planarity testing
• scientific article; zbMATH DE number 1947389 (Why is no real title available?)
• Maintaining order in a generalized linked list
• On suffix extensions in suffix trees
• On the sorting-complexity of suffix tree construction
• On-line construction of suffix trees
• Suffix Arrays: A New Method for On-Line String Searches
• The smallest automaton recognizing the subwords of a text
• Toward a Definitive Compressibility Measure for Repetitive Sequences

This page was built for publication: Faster and simpler online computation of string net frequency

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