The algorithm firstly indexes each sub-sequence of length n, where n is a parameter around 4-6 base pairs, in each promoter, so they can be looked up efficiently.
To efficiently search, the algorithm indexes each sub-sequence of length n within promoters, with n being a parameter between 4 and 6 base pairs.