Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,295 papers from all fields of science
Search
Sign In
Create Free Account
Longest palindromic substring
In computer science, the longest palindromic substring or longest symmetric factor problem is the problem of finding a maximum-length contiguous…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Computer science
Journal of the ACM
Longest common substring problem
Optimal substructure
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
An Efficient Implementation of Manacher's Algorithm
Shoupu Wan
arXiv.org
2020
Corpus ID: 213005150
Manacher's algorithm has been shown to be optimal to the longest palindromic substring problem. Many of the existing…
Expand
2020
2020
A New Implementation of Manacher's Algorithm
Shoupu Wan
2020
Corpus ID: 212747815
Manacher’s algorithm is optimal for the longest palindromic substring problem. The implementation of this algorithm traditionally…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE