Fast Multiple String Matching Using Streaming
SIMD Extensions TechnologySimone Faro M. Oğuzhan Külekcifaro@dmi.unict.it oguzhan.kulekci@tubitak.gov.trUniversity of Catania, Department of TÜBİTAK – National ResearchMathematics and Computer Science Institute of Electronics and CryptologyPrague Stringology ConferencePrague, Czech Republic, Sep. 1–4, 2013Multiple Exact String Matching◮ Text T = t0t1t2 . . . tn−1, |T | = n◮ Finite alphabet Σ = {ǫ0, ǫ1, . . . , ǫσ−1}, |Σ| = σ◮ Pattern set P = {P0,