The approximate swap and mismatch edit distance
type: Item
instance of: scholarly article
title: The approximate swap and mismatch edit distance
zbMATH Open document ID: 1206.68106
author: Yair Dombb
author: Ohad Lipsky
author: Benny Porat
author: Ely Porat
author: Asaf Tsur
published in: Theoretical Computer Science
publication date: 2010-11-11T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5815223
zbMATH Keywords: pattern matching
zbMATH Keywords: swap
zbMATH Keywords: edit operations
zbMATH Keywords: mismatch
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.06.004
OpenAlex ID: W2052231302
cites work: Generalized String Matching
cites work: A randomized algorithm for approximate string matching
cites work: Overlap matching.
cites work: Algorithms – ESA 2004
cites work: Approximate swapped matching.
cites work: Faster algorithms for string matching with k mismatches
cites work: Q4250214
cites work: Q4055156
cites work: Fast algorithms for approximately counting mismatches
cites work: Q5528329
cites work: Efficient string matching with k mismatches
cites work: Fast parallel and serial approximate string matching
cites work: An Extension of the String-to-String Correction Problem
cites work: Q4133128
DOI: 10.1016/J.TCS.2010.06.004
description: scientific article; zbMATH DE number 5815223