[boost] [algorithm] Longest palindromic substring in Boost.Algorithm

Hello I want to add to Boost.Algorithm algorithm for finding all palindromes in a sequence in O(N). https://en.wikipedia.org/wiki/Longest_palindromic_substring Is it useful algorithm for Boost? Have you any suggestions? --  Best regards, Alexander Zaitsev