Frequency-constrained substring complexity

DOI10.1007/978-3-031-43980-3_28MaRDI QIDQ6545444

Chang Liu, Solon P. Pissis, Grigorios Loukides, Michael Shekelyan

Publication date: 29 May 2024

zbMATH Keywords

suffix treepredecessor searchsubstring complexity

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Preserving order in a forest in less than logarithmic time and linear space
• Complexity of sequences and dynamical systems
• Sublinear approximate string matching and biological applications
• Infinite words with linear subword complexity
• Subword complexity and power avoidance
• Sublinear algorithms for approximating string compressibility
• Dynamic text and static pattern matching
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Algorithms on Strings, Trees and Sequences
• Algorithms on Strings
• Bidirectional String Anchors: A New String Sampling Mechanism
• Toward a Definitive Compressibility Measure for Repetitive Sequences
• On Repetitiveness Measures of Thue-Morse Words

This page was built for publication: Frequency-constrained substring complexity

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