Experimental and Efficient Algorithms

DOI10.1007/B136461MaRDI QIDQ5710037zbMATH OpenOpenAlexFDO

Authors Heikki Hyyrö, Yoan Pinzón, Ayumi Shinohara

Publication date 30 November 2005

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

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• SOFSEM 2005: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 2087055
• String Processing and Information Retrieval
• Bit-parallel approximate string matching algorithms with transposition.
• Bit-parallel approximate string matching algorithms with transposition

Cited in

(2)

• SOFSEM 2005: Theory and Practice of Computer Science
• Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching

This page was built for publication: Experimental and Efficient Algorithms

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