Parallel computation for the all-pairs suffix-prefix problem

DOI10.1007/978-3-319-46049-9_12MaRDI QIDQ1796839zbMATH OpenOpenAlexFDO

Authors Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles

Publication date 17 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-46049-9_12

zbMATH Keywords

parallel algorithmLCP arraysuffix arraymultithreadingsuffix-prefix matching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• A fast algorithm for the all-pairs suffix-prefix problem
• Algorithm engineering for all-pairs suffix-prefix matching
• Optimal parallel algorithms for Prefix Matching
• Parallel Suffix–Prefix-Matching Algorithm and Applications
• An improved algorithm for the all-pairs suffix-prefix problem

Cited in

(9)

• The complexity of parallel prefix problems on small domains
• Parallel biological sequence comparison using prefix computations.
• An efficient algorithm for the all pairs suffix-prefix problem
• The exact multiple pattern matching problem solved by a reference tree approach
• A fast algorithm for the all-pairs suffix-prefix problem
• scientific article; zbMATH DE number 2166160 (Why is no real title available?)
• Algorithm engineering for all-pairs suffix-prefix matching
• All-pairs suffix/prefix in optimal time using Aho-Corasick space
• Approximate All-Pairs Suffix/Prefix Overlaps

This page was built for publication: Parallel computation for the all-pairs suffix-prefix problem

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