Multi-view pattern matching

TL;DR

This paper introduces multi-view pattern matching, a new problem where texts have multiple views with disjoint alphabets, and presents an extended Horspool algorithm that significantly improves matching efficiency.

Contribution

It defines the multi-view pattern matching problem and extends the Horspool algorithm to efficiently handle multiple views with disjoint alphabets.

Findings

3x speedup over naive baseline in synthetic data experiments

Effective extension of Horspool algorithm for multi-view scenarios

Potential for improved pattern matching in multi-view data

Abstract

We introduce the \textit{multi-view pattern matching} problem, where a text can have multiple views. Each view is a string of the same size and drawn from disjoint alphabets. The pattern is drawn from the union of all alphabets. The algorithm we present is an extension of the Horspool algorithm, and in our experiments on synthetic data it shows an $3 \times$ improvement over the naive baseline.