Improved linear systolic algorithms for substring statistics

DOI10.1016/S0020-0190(97)00025-2MaRDI QIDQ287010zbMATHOpenAlexFDO

Authors Jean Frédéric Myoupo, Ahmad Wabbi

Publication date 26 May 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(97)00025-2

zbMATH Keywords

parallel computationparallel algorithmspattern matchingparallel processingrepetition in a stringstatistics of a stringsystolic architectures

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• A faster linear systolic algorithm for recovering a longest common subsequence
• Publication:3355232
• Publication:4545597
• A systolic array for the longest common subsequence problem
• An efficient systolic algorithm for the longest common subsequence problem

Cites work

• scientific article; zbMATH DE number 3793440 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3246281 (Why is no real title available?)
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• Systolic Algorithms for String Manipulations

Cited in

(4)

• A coarse-grained multicomputer algorithm for the detection of repetitions
• New linear systolic arrays for the string comparison algorithm
• scientific article; zbMATH DE number 139810 (Why is no real title available?)
• Generalized substring selectivity estimation

This page was built for publication: Improved linear systolic algorithms for substring statistics

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