### Abstract

Original language | English |
---|---|

Title of host publication | arXiv |

Place of Publication | arXiv:1011.3491v2 |

Publication date | 2010 |

Publication status | Submitted - 2010 |

MoE publication type | B2 Book chapter |

### Fields of Science

- cs.DS

### Cite this

*arXiv*arXiv:1011.3491v2.

}

*arXiv.*arXiv:1011.3491v2.

**Pattern Kits.** / Gagie, Travis; Karhu, Kalle; Kärkkäinen, Juha; Mäkinen, Veli; Salmela, Leena.

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Scientific

TY - CHAP

T1 - Pattern Kits

AU - Gagie, Travis

AU - Karhu, Kalle

AU - Kärkkäinen, Juha

AU - Mäkinen, Veli

AU - Salmela, Leena

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - cs.DS

M3 - Chapter

BT - arXiv

CY - arXiv:1011.3491v2

ER -