Computing longest single-arm-gapped palindromes in a string
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 1786458 (Why is no real title available?)
- 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 -gapped repeats
- FINDING ALL APPROXIMATE GAPPED PALINDROMES
- Finding gapped palindromes online
- Linear work suffix array construction
- Log-logarithmic worst-case range queries are possible in space theta(N)
- On the sorting-complexity of suffix tree construction
- Palindromes and Sturmian words
- Palindromic richness
- Parallel detection of all palindromes in a string
- Searching for gapped palindromes
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(7)- Longest substring palindrome after edit
- Finding gapped palindromes online
- Computing longest palindromic substring after single-character or block-wise edits
- scientific article; zbMATH DE number 7696009 (Why is no real title available?)
- Small-space LCE data structure with constant-time queries
- Efficient computation of longest single-arm-gapped palindromes in a string
- FINDING ALL APPROXIMATE GAPPED PALINDROMES
This page was built for publication: Computing longest single-arm-gapped palindromes in a string
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971149)