Pattern Kits

Details Pattern Kits Pattern Kits

2010-11-15

arxiv.org/abs/1011.3491v2

Computer Science

Data Structures and Algorithms

Scientific paper

Suppose we have just performed searches in a self-index for two patterns $A$ and $B$ 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.

Affiliated with

Also associated with

No associations

Rating

Pattern Kits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern Kits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern Kits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462761