String matching with up to \(k\) swaps and mismatches

DOI10.1016/j.ic.2010.04.001zbMath1209.68466OpenAlexW2069447851MaRDI QIDQ1959438

Asaf Tzur, Ely Porat, B. Riva Shalom, Ohad Lipsky, Benny Porat

Publication date: 7 October 2010

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2010.04.001

zbMATH Keywords

pattern matchingswap

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (1)

Counting (Watson-Crick) palindromes in Watson-Crick conjugates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The approximate swap and mismatch edit distance
• Efficient string matching with k mismatches
• Overlap matching.
• Approximate swapped matching.
• Swap and mismatch edit distance
• Verifying candidate matches in sparse and wildcard matching
• Dictionary matching and indexing with errors and don't cares
• Pattern matching with address errors
• An Extension of the String-to-String Correction Problem
• Pattern Matching with Swaps
• Faster algorithms for string matching with k mismatches
• Algorithms – ESA 2004

This page was built for publication: String matching with up to \(k\) swaps and mismatches