On longest common property preserved substring queries

DOI10.1007/978-3-030-32686-9_12MaRDI QIDQ6536252zbMATH OpenFDO

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

Publication date 19 April 2024

zbMATH Keywords

Lyndon wordspalindromessquaresperiodic substrings

Mathematics Subject Classification ID

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

Recommendations

• Longest property-preserved common factor
• Longest property-preserved common factor: a new string-processing framework
• Dynamic and internal longest common substring
• Longest common extensions in sublinear space
• Linear time algorithms for generalizations of the longest common substring problem

Cites work

• Algorithms on Strings, Trees and Sequences
• Computing all distinct squares in linear time for integer alphabets
• Computing longest common square subsequences
• Counting distinct palindromes in a word in linear time
• Episturmian words and some constructions of de Luca and Rauzy
• How many squares can a string contain?
• Longest property-preserved common factor
• Minimal suffix and rotation of a substring in optimal time
• On Burnside's Problem
• On finding a longest common palindromic subsequence
• On the sorting-complexity of suffix tree construction
• On-line construction of suffix trees
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• The level ancestor problem simplified
• Uniqueness Theorems for Periodic Functions

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

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