Pages that link to "Item:Q1796839"
From MaRDI portal
The following pages link to Parallel computation for the all-pairs suffix-prefix problem (Q1796839):
Displaying 7 items.
- An efficient algorithm for the all pairs suffix-prefix problem (Q1190509) (← links)
- The complexity of parallel prefix problems on small domains (Q1373137) (← links)
- Parallel biological sequence comparison using prefix computations. (Q1402116) (← links)
- A fast algorithm for the all-pairs suffix-prefix problem (Q1676303) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- All-pairs suffix/prefix in optimal time using Aho-Corasick space (Q2169425) (← links)
- Approximate All-Pairs Suffix/Prefix Overlaps (Q3575238) (← links)