The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It also introduces properties for palindrome predicates, and shows which predicates satisfy which properties. The paper connects the properties for palindrome predicates to two algorithms for finding palindromes in strings, and shows how we can extend some of the predicates to satisfy the properties that allow us to use an algorithm for finding palindromes. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Jeuring, J. (2013). Finding palindromes: Variants and algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8106, pp. 258–272). Springer Verlag. https://doi.org/10.1007/978-3-642-40355-2_18
Mendeley helps you to discover research relevant for your work.