Improved linear systolic algorithms for substring statistics

DOI10.1016/S0020-0190(97)00025-2zbMATH Open1336.68080OpenAlexW1997469653MaRDI QIDQ287010FDOQ287010

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

Recommendations

• A faster linear systolic algorithm for recovering a longest common subsequence
• scientific article; zbMATH DE number 4205980
• scientific article; zbMATH DE number 1782360
• A systolic array for the longest common subsequence problem
• An efficient systolic algorithm for the longest common subsequence problem

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)

Cites Work

• Title not available (Why is that?)
• An optimal algorithm for computing the repetitions in a word
• Optimal off-line detection of repetitions in a string
• Systolic Algorithms for String Manipulations
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• A coarse-grained multicomputer algorithm for the detection of repetitions
• Generalized substring selectivity estimation
• Title not available (Why is that?)
• New linear systolic arrays for the string comparison algorithm

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)