Approximate swapped matching

DOI10.1007/3-540-44450-5_24MaRDI QIDQ4472453zbMATH OpenFDO

Authors Amihood Amir, Ely Porat, Moshe Lewenstein

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1974/19740302.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Analysis of algorithms (68W40)

Recommendations

• Approximate swapped matching.
• Pattern Matching with Swaps
• Pattern matching with swaps in practice
• Efficient special cases of pattern matching with swaps
• Pattern Matching with Swaps for Short Patterns in Linear Time

Cited in

(8)

• Efficient algorithms for approximate string matching with swaps
• Overlap matching.
• Approximate swapped matching.
• String matching with up to k swaps and mismatches
• Efficient special cases of pattern matching with swaps
• Using swaps and deletes to make strings match
• A simple algorithm for approximating the text-to-pattern Hamming distance
• Approximate String Matching with Swap and Mismatch

This page was built for publication: Approximate swapped matching

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