Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems

Laurentius Leonard, Ken Tanaka

Given two strings $T$ and $S$ and a set of strings $P$, for each string $p\in P$, consider the unique substrings of $T$ that have $p$ as their prefix and $S$ as their suffix. Two…