Sciweavers

Share
PR
2002

Finding approximate palindromes in strings

11 years 11 months ago
Finding approximate palindromes in strings
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de nition is based on the usual edit operations of approximate pattern matching, and the algorithm we give, for a string of size n on a xed alphabet, runs in Ok2n time. We also discuss two implementationrelated improvements to the algorithm, and demonstrate their e cacy in practice by means of both experiments and an average-case analysis.
Alexandre H. L. Porto, Valmir C. Barbosa
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where PR
Authors Alexandre H. L. Porto, Valmir C. Barbosa
Comments (0)
books