Efficient coarse grained data distributions and string pattern matching

MaRDI QIDQ2934448zbMATH OpenFDO

Authors Laurence Boxer, Russ Miller

Publication date 12 December 2014

zbMATH Keywords

coarse grained parallel computerscalable parallel algorithmspanning treestring matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• String search in coarse-grained parallel computers
• On the theory of interconnection networks for parallel computers
• The FX distribution method for parallel processing of partial match queries
• Derivation of a parallel string matching algorithm
• Coarse grained gather and scatter operations with applications

Cited in

(1)

• Computing Burrows-Wheeler similarity distributions for string collections

This page was built for publication: Efficient coarse grained data distributions and string pattern matching

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