Computing Longest Single-arm-gapped Palindromes in a String

DOI10.1007/978-3-319-51963-0_29zbMath1444.68310MaRDI QIDQ2971149

Ayumi Shinohara, Shintaro Narisada, Diptarama, Shunsuke Inenaga, Kazuyuki Narisawa

Publication date: 4 April 2017

Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_29

Mathematics Subject Classification ID

68R15: Combinatorics on words

68W32: Algorithms on strings

Related Items

Small-space LCE data structure with constant-time queries, Longest substring palindrome after edit, Computing longest palindromic substring after single-character or block-wise edits, Efficient computation of longest single-arm-gapped palindromes in a string

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel detection of all palindromes in a string
• Palindromic richness
• Searching for gapped palindromes
• Log-logarithmic worst-case range queries are possible in space theta(N)
• Palindromes and Sturmian words
• Finding Gapped Palindromes Online
• FINDING ALL APPROXIMATE GAPPED PALINDROMES
• Suffix Arrays: A New Method for On-Line String Searches
• Linear work suffix array construction
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Algorithms on Strings, Trees and Sequences
• Efficiently Finding All Maximal alpha-gapped Repeats
• On the sorting-complexity of suffix tree construction