Finding approximate palindromes in strings
Data Structures and Algorithms
2007-05-23 v1
Abstract
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 errors. Our definition is based on the usual edit operations of approximate pattern matching, and the algorithm we give, for a string of size on a fixed alphabet, runs in 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.
Cite
@article{arxiv.cs/0309043,
title = {Finding approximate palindromes in strings},
author = {A. H. L. Porto and V. C. Barbosa},
journal= {arXiv preprint arXiv:cs/0309043},
year = {2007}
}