Finding approximate palindromes in strings

Pattern Recognition

Volumn 35, Issue 11, 2002, Pages 2581-2591

  Porto, Alexandre H L ^a   Barbosa, Valmir C ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Approximate palindromes; Approximate pattern matching; String editing

Indexed keywords

ALGORITHMS; ERRORS; PATTERN MATCHING;

PALINDROMES;

PATTERN RECOGNITION;

PATTERN RECOGNITION;

EID: 0036833277     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(01)00179-0     Document Type: Article

References (23)

1. Fast pattern matching in strings
2. A new linear-time on-line algorithm for finding the smallest initial palindrome of a string
3. Optimal parallel algorithms for periods, palindromes and squares
4. Parallel detection of all palidromes in a string
5. Finding all periods and initial palindromes of a string in parallel
6. Optimal parallel algorithms for string matching
7. Origin and evolution of Alu repetitive elements
8. Binary codes capable of correcting insertions and reversals
9. Introducing efficient parallelism into approximate string maching and a new serial algorithm
10. Fast parallel and serial approximate string maching
11. An O(nd) difference algorithm and its variations
12. Algorithms for approximate string matching
13. Faster approximate string matching
14. Theoretical and empirical comparisons of approximate string matching algorithms
15. Approximate string maching: A simpler faster algorithm
16. Finding approximate patterns in strings
17. Fast text searching allowing errors
18. Efficient string maching with k mismatches