A fast VLSI solution for approximate string matching

DOI10.1016/0167-9260(92)90005-JMaRDI QIDQ4015539zbMATH OpenFDO

Authors Roberto Grossi

Publication date 12 January 1993

Published in Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-9260(92)90005-J

zbMATH Keywords

dynamic programmingapproximate string matchingVLSI implementationmesh-of-trees

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Fast and practical approximate string matching
• scientific article; zbMATH DE number 2087055
• scientific article; zbMATH DE number 975393
• Fast parallel and serial approximate string matching
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• A programmable array processor architecture for flexible approximate string matching algorithms
• scientific article; zbMATH DE number 1303588
• Approximate String Matching: A Simpler Faster Algorithm

Cited in

(3)

• A programmable array processor architecture for flexible approximate string matching algorithms
• New linear systolic arrays for the string comparison algorithm
• A VLSI algorithm for sorting variable-length character strings

This page was built for publication: A fast VLSI solution for approximate string matching

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