Parallel computation for the all-pairs suffix-prefix problem

DOI10.1007/978-3-319-46049-9_12zbMath1397.68243OpenAlexW2523562247MaRDI QIDQ1796839

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

Publication date: 17 October 2018

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

zbMATH Keywords

parallel algorithmmultithreadingsuffix arrayLCP arraysuffix-prefix matching

Mathematics Subject Classification ID

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

Related Items (3)

All-pairs suffix/prefix in optimal time using Aho-Corasick space ⋮ A fast algorithm for the all-pairs suffix-prefix problem ⋮ The exact multiple pattern matching problem solved by a reference tree approach

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