Finding approximate palindromes in strings

DOI10.1016/S0031-3203(01)00179-0zbMath1006.68910MaRDI QIDQ1860243

Valmir C. Barbosa, Alexandre H. L. Porto

Publication date: 20 February 2003

Published in: Pattern Recognition (Search for Journal in Brave)

zbMATH Keywords

approximate pattern matchingstring editingapproximate palindromes

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Related Items (10)

Palindromic subsequence automata and longest common palindromic subsequence ⋮ An efficient algorithm for the longest common palindromic subsequence problem ⋮ Searching for Gapped Palindromes ⋮ Efficient retrieval of approximate palindromes in a run-length encoded string ⋮ Palindromic Decompositions with Gaps and Errors ⋮ Computing longest palindromic substring after single-character or block-wise edits ⋮ FINDING ALL APPROXIMATE GAPPED PALINDROMES ⋮ Faster queries for longest substring palindrome after block edit ⋮ Searching for gapped palindromes ⋮ Longest substring palindrome after edit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel detection of all palindromes in a string
• Efficient string matching with k mismatches
• An \(O(ND)\) difference algorithm and its variations
• Faster approximate string matching
• Finding all periods and initial palindromes of a string in parallel
• Finding approximate patterns in strings
• Algorithms for approximate string matching
• Optimal parallel algorithms for string matching
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• Algorithms on Strings, Trees and Sequences
• Optimal parallel algorithms for periods, palindromes and squares

This page was built for publication: Finding approximate palindromes in strings