On longest common property preserved substring queries

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

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

Publication date: 19 April 2024

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

zbMATH Keywords

Lyndon wordspalindromessquaresperiodic substrings

Mathematics Subject Classification ID

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

Cites Work

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

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)