N-cube string matching algorithm with long texts

DOI10.1007/3-540-61576-8_93MaRDI QIDQ6567693zbMATH OpenFDO

Authors Fouzia Moussouni, Christian Lavault

Publication date 5 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61576-8_93

Mathematics Subject Classification ID

Distributed algorithms (68W15) Algorithms on strings (68W32)

Recommendations

• Optimal parallel string matching algorithm on body centered hypercube
• scientific article; zbMATH DE number 3911754
• Parallel Suffix–Prefix-Matching Algorithm and Applications
• Optimal parallel pattern matching in strings
• A string-matching algorithm for the CREW PRAM

Cites work

• Deterministic Sampling–A New Technique for Fast Pattern Matching
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• Time-space-optimal string matching
• Two-way string-matching

This page was built for publication: \(N\)-cube string matching algorithm with long texts

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