# Dynamic Palindrome Detection

## TL;DR

This paper introduces a method for maintaining the longest palindrome substring in a dynamic string efficiently, with updates handled in poly-logarithmic time per edit, advancing dynamic string matching techniques.

## Contribution

It presents the first data structure capable of maintaining the longest palindrome substring in poly-logarithmic time per update in a dynamic setting.

## Key findings

- Longest palindrome can be maintained efficiently in dynamic strings.
- Poly-logarithmic update time achieved for palindrome detection.
- Advances dynamic string matching algorithms.

## Abstract

Lately, there is a growing interest in dynamic string matching problems. Specifically, the dynamic Longest Common Factor problem has been researched and some interesting results has been reached. In this paper we examine another classic string problem in a dynamic setting - finding the longest palindrome substring of a given string. We show that the longest palindrome can be maintained in poly-logarithmic time per symbol edit.