A fast algorithm for the all-pairs suffix-prefix problem
From MaRDI portal
Publication:1676303
DOI10.1016/j.tcs.2017.07.013zbMath1380.68479OpenAlexW2738126475MaRDI QIDQ1676303
Publication date: 6 November 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.07.013
Related Items
Uses Software
Cites Work
- Replacing suffix trees with enhanced suffix arrays
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- An efficient algorithm for the all pairs suffix-prefix problem
- Fast practical multi-pattern matching
- Parallel computation for the all-pairs suffix-prefix problem
- An improved algorithm for the all-pairs suffix-prefix problem
- A fast string searching algorithm
- Suffix Arrays: A New Method for On-Line String Searches
- Efficient string matching
- Algorithms on Strings, Trees and Sequences