A coarse-grained multicomputer algorithm for the detection of repetitions

DOI10.1016/J.IPL.2004.12.004MaRDI QIDQ835058zbMATH OpenOpenAlexFDO

Authors Thierry Garcia, David Semé

Publication date 27 August 2009

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

Full work available at URL https://doi.org/10.1016/j.ipl.2004.12.004

zbMATH Keywords

dynamic programmingparallel algorithmsstring matchingcoarse-grained multicomputers

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 3976360
• Large-scale detection of repetitions
• Optimal Parallel Searching an Array for Certain Repetitions
• On the complexity of computing the order of repetition of a string
• Repetitions detection on a linear array with reconfigurable pipelined bus system

Cites work

• scientific article; zbMATH DE number 47903 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 1142294 (Why is no real title available?)
• scientific article; zbMATH DE number 3350192 (Why is no real title available?)
• A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers
• An optimal algorithm for computing the repetitions in a word
• Fast Pattern Matching in Strings
• Improved linear systolic algorithms for substring statistics
• On the computational power of pushdown automata
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
• Uniqueness Theorems for Periodic Functions

Cited in

(2)

• A fast algorithm for finding the positions of all squares in a run-length encoded string
• Efficient on-line repetition detection

This page was built for publication: A coarse-grained multicomputer algorithm for the detection of repetitions

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