Counting distinct palindromes in a word in linear time
From MaRDI portal
Publication:407601
DOI10.1016/J.IPL.2010.07.018zbMATH Open1234.68329DBLPjournals/ipl/GroultPR10OpenAlexW1972084722WikidataQ96738845 ScholiaQ96738845MaRDI QIDQ407601FDOQ407601
Richard Groult, Élise Prieur, Gwénaël Richomme
Publication date: 27 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.07.018
Cites Work
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- Palindromic richness
- Sturmian words: structure, combinatorics, and their arithmetics
- Palindrome complexity.
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Episturmian words and some constructions of de Luca and Rauzy
- Finding all periods and initial palindromes of a string in parallel
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Episturmian words: a survey
- Burrows-Wheeler transform and palindromic richness
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Computing longest previous factor in linear time and applications
- Palindrome recognition in real time by a multitape Turing machine
- Parallel detection of all palindromes in a string
Cited In (19)
- Palindrome pattern matching
- Longest substring palindrome after edit
- Enumeration of two dimensional palindromes
- An efficient algorithm for the longest common palindromic subsequence problem
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes
- Algorithms and combinatorial properties on shortest unique palindromic substrings
- Improved estimates for the number of privileged words
- Greedy Palindromic Lengths
- Internal dictionary matching
- Title not available (Why is that?)
- Computing longest palindromic substring after single-character or block-wise edits
- Tight bound for the number of distinct palindromes in a tree
- Palindrome Pattern Matching
- Counting Palindromes in Substrings
- Faster queries for longest substring palindrome after block edit
- Palindromic trees for a sliding window and its applications
- Finding top-\(k\) longest palindromes in substrings
- On longest common property preserved substring queries
- EERTREE: an efficient data structure for processing palindromes in strings
This page was built for publication: Counting distinct palindromes in a word in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q407601)
