Approximate String Matching with Swap and Mismatch

DOI10.1007/978-3-540-77120-3_75MaRDI QIDQ5387821zbMATH OpenOpenAlexFDO

Authors Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tzur, B. R. Shalom

Publication date 27 May 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77120-3_75

Mathematics Subject Classification ID

Algorithms on strings (68W32) Analysis of algorithms (68W40)

Recommendations

• String matching with up to k swaps and mismatches
• Algorithms – ESA 2004
• Swap and mismatch edit distance
• scientific article; zbMATH DE number 2080211
• The approximate swap and mismatch edit distance

Cited in

(6)

• String matching with up to k swaps and mismatches
• Alignment with non-overlapping inversions and translocations on two strings
• Pattern matching with swaps in practice
• On the hardness of optimal vertex relabeling and restricted vertex relabeling
• Non-overlapping inversion on strings and languages
• Multiple approximate string matching

This page was built for publication: Approximate String Matching with Swap and Mismatch

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387821)