On longest common property preserved substring queries

DOI10.1007/978-3-030-32686-9_12zbMATH Open1539.6838MaRDI QIDQ6536252

Tomasz Kociumaka, Kazuki Kai, Masayuki Takeda, Yuto Nakashima, Hideo Bannai, Shunsuke Inenaga

Publication date: 19 April 2024

zbMATH Keywords

squaresLyndon wordspalindromesperiodic substrings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Counting distinct palindromes in a word in linear time
• The level ancestor problem simplified
• How many squares can a string contain?
• On finding a longest common palindromic subsequence
• On-line construction of suffix trees
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Algorithms on Strings, Trees and Sequences
• Uniqueness Theorems for Periodic Functions
• Minimal Suffix and Rotation of a Substring in Optimal Time
• On the sorting-complexity of suffix tree construction
• On Burnside's Problem
• Episturmian words and some constructions of de Luca and Rauzy
• Longest property-preserved common factor

This page was built for publication: On longest common property preserved substring queries