Pattern Kits
Travis Gagie, Kalle Karhu, Juha K\"arkk\"ainen, Veli, M\"akinen, Leena Salmela

TL;DR
This paper introduces a space- and time-efficient data structure for managing a dynamic library of patterns in self-indexes, enabling efficient concatenation searches and pattern manipulations.
Contribution
It presents a novel data structure that efficiently supports pattern concatenation and manipulation within self-indexes, improving over previous methods.
Findings
Supports efficient concatenation of patterns in self-indexes
Compatible with many existing self-indexes
Offers space and time efficiency improvements
Abstract
Suppose we have just performed searches in a self-index for two patterns and and now we want to search for their concatenation \A B); how can we best make use of our previous computations? In this paper we consider this problem and, more generally, how we can store a dynamic library of patterns that we can easily manipulate in interesting ways. We give a space- and time-efficient data structure for this problem that is compatible with many of the best self-indexes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Data Mining Algorithms and Applications · Evolutionary Algorithms and Applications
