Finding approximate palindromes in strings
<|reference_start|>Finding approximate palindromes in strings: We introduce a novel definition of approximate palindromes in strings, and provide an algorithm to find all maximal approximate palindromes in a string with up to $k$ errors. Our definition is based on the usual edit operations of approximate pattern matching, and the algorithm we give, for a string of size $n$ on a fixed alphabet, runs in $O(k^2 n)$ time. We also discuss two implementation-related improvements to the algorithm, and demonstrate their efficacy in practice by means of both experiments and an average-case analysis.<|reference_end|>
@article{porto2003finding,
    title={Finding approximate palindromes in strings},
    author={A. H. L. Porto, V. C. Barbosa},
    journal={Pattern Recognition 35 (2002), 2581-2591},
    year={2003},
    doi={10.1016/S0031-3203(01)00179-0},
    archivePrefix={arXiv},
    eprint={cs/0309043},
    primaryClass={cs.DS}
}