Finding approximate palindromes in strings
type: Item
instance of: scholarly article
title: Finding approximate palindromes in strings
zbMATH Open document ID: 1006.68910
DOI: 10.1016/S0031-3203(01)00179-0
author: Alexandre H. L. Porto
author: Valmir C. Barbosa
published in: Pattern Recognition
publication date: 2003-02-20T00:00:00Z
Mathematics Subject Classification ID: 68U99
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 1872316
zbMATH Keywords: approximate palindromes
zbMATH Keywords: string editing
zbMATH Keywords: approximate pattern matching
MaRDI profile type: Publication
cites work: Fast Pattern Matching in Strings
cites work: A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
cites work: Optimal parallel algorithms for periods, palindromes and squares
cites work: Parallel detection of all palindromes in a string
cites work: Finding all periods and initial palindromes of a string in parallel
cites work: Optimal parallel algorithms for string matching
cites work: Algorithms on Strings, Trees and Sequences
cites work: Fast parallel and serial approximate string matching
cites work: An \(O(ND)\) difference algorithm and its variations
cites work: Algorithms for approximate string matching
cites work: Faster approximate string matching
cites work: Q4250214
cites work: Q4859180
cites work: Finding approximate patterns in strings
cites work: Efficient string matching with k mismatches
cites work: Q5422499
description: scientific article; zbMATH DE number 1872316