arXiv Open Access 2016

Multi-view pattern matching

Matthias Galle

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DS

Penulis (1)

Matthias Galle

Format Sitasi

APA MLA BibTeX

Galle, M. (2016). Multi-view pattern matching. https://arxiv.org/abs/1607.05157

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓