A fast algorithm for the all-pairs suffix-prefix problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 826056
- An efficient algorithm for the all pairs suffix-prefix problem
- An improved algorithm for the all-pairs suffix-prefix problem
- All-pairs suffix/prefix in optimal time using Aho-Corasick space
- Parallel computation for the all-pairs suffix-prefix problem
- Algorithm engineering for all-pairs suffix-prefix matching
- A Fast Suffix-Sorting Algorithm
- Parallel Suffix–Prefix-Matching Algorithm and Applications
- An elegant algorithm for the construction of suffix arrays
Cites work
- A fast string searching algorithm
- Algorithms on Strings, Trees and Sequences
- An efficient algorithm for the all pairs suffix-prefix problem
- An improved algorithm for the all-pairs suffix-prefix problem
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- Efficient string matching
- Fast practical multi-pattern matching
- Parallel computation for the all-pairs suffix-prefix problem
- Replacing suffix trees with enhanced suffix arrays
- Suffix Arrays: A New Method for On-Line String Searches
Cited in
(9)- An efficient algorithm for the all pairs suffix-prefix problem
- Parallel computation for the all-pairs suffix-prefix problem
- All-pairs suffix/prefix in optimal time using Aho-Corasick space
- Hierarchical overlap graph
- An improved algorithm for the all-pairs suffix-prefix problem
- Approximate All-Pairs Suffix/Prefix Overlaps
- Algorithm engineering for all-pairs suffix-prefix matching
- scientific article; zbMATH DE number 826056 (Why is no real title available?)
- Counting overlapping pairs of words
This page was built for publication: A fast algorithm 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 Q1676303)