Sept. 13, 2015, 10:33 p.m. by Rosalind Team

In “Construct the Suffix Array of a String”, we introduced the suffix array. In this problem, we will let you use the suffix array to solve the Multiple Pattern Matching Problem (introduced in “Construct a Trie from a Collection of Patterns”).

Given: A string *Text* and a collection of strings *Patterns*.

Return: All starting positions in *Text* where a string from *Patterns* appears as a substring.

AATCGGGTTCAATCGGGGT ATCG GGGT

1 4 11 15