Bit-parallel approximate string matching algorithms with transposition.

DOI10.1007/B14038MaRDI QIDQ5897134zbMATH OpenOpenAlexFDO

Authors Heikki Hyyrö

Publication date 9 February 2010

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

Full work available at URL https://doi.org/10.1007/b14038

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Bit-parallel approximate string matching algorithms with transposition
• scientific article; zbMATH DE number 2052917
• scientific article; zbMATH DE number 2087055
• scientific article; zbMATH DE number 3845091
• String Processing and Information Retrieval

Cited in

(9)

• Bit-parallel witnesses and their applications to approximate string matching
• Bit-parallel approximate string matching algorithms with transposition
• scientific article; zbMATH DE number 2052917 (Why is no real title available?)
• Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
• A Bit-Parallel Exact String Matching Algorithm for Small Alphabet
• String Processing and Information Retrieval
• Experimental and Efficient Algorithms
• Tighter Packed Bit-Parallel NFA for Approximate String Matching
• String Processing and Information Retrieval

This page was built for publication: Bit-parallel approximate string matching algorithms with transposition.

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