The max-shift algorithm for approximate string matching

DOI10.1007/3-540-44688-5_2MaRDI QIDQ4788550zbMATH OpenFDO

Authors Costas S. Iliopoulos, L. Mouchard, Yoan Pinzón

Publication date 29 January 2003

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

Full work available at URL https://doi.org/10.1007/3-540-44688-5_2

zbMATH Keywords

approximate string matchingdynamic programmingedit-distancestring algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Faster bit-parallel approximate string matching
• scientific article; zbMATH DE number 4119620
• SOFSEM 2005: Theory and Practice of Computer Science
• Faster approximate string matching

Cited in

(3)

• Accurate and efficient methods to improve multiple circular sequence alignment
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: The max-shift algorithm for approximate string matching

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