An exploration and implementation of palindromic trees’, EERTREEs', whose construction is linear space. This structure provides fast access to all subpalindromes of a string or set of strings. Some applications include palindromic factorization problems, rich string enumeration, and identification of WatsonCrick (WK) palindromes.
Term paper for the Algorithms course at Appalachian State Univerisy.
Team: Abdel Issa, Brady Adcock, Luke Patterson, Hayden Fravel
Original paper: https://arxiv.org/pdf/1506.04862.pdf