Most Recent Match Queries in On-Line Suffix Trees

N. Jesper Larsson

Publikation: Artikel i tidsskrift og konference artikel i tidsskriftTidsskriftartikelForskningpeer review

Abstrakt

A suffix tree is able to efficiently locate a pattern in an indexed string, but not in general the most recent copy of the pattern in an online stream, which is desirable in some applications. We study the most general version of the problem of locating a most recent match: supporting queries for arbitrary patterns, at each step of processing an online stream. We present augmentations to Ukkonen's suffix tree construction algorithm for optimal-time queries, maintaining indexing time within a logarithmic factor in the size of the indexed string. We show that the algorithm is applicable to sliding-window indexing, and sketch a possible optimization for use in the special case of Lempel-Ziv compression.
OriginalsprogEngelsk
BogserieLecture Notes in Computer Science
Vol/bind8486
Sider (fra-til)252-261
Antal sider10
ISSN0302-9743
DOI
StatusUdgivet - 2014
Begivenhed25th Annual Symposium on Combinatorial Pattern Matching - Moscow, Rusland
Varighed: 16 jun. 201418 jun. 2014
Konferencens nummer: 25
http://cpm2014.hse.ru/

Konference

Konference25th Annual Symposium on Combinatorial Pattern Matching
Nummer25
Land/OmrådeRusland
ByMoscow
Periode16/06/201418/06/2014
Internetadresse

Fingeraftryk

Dyk ned i forskningsemnerne om 'Most Recent Match Queries in On-Line Suffix Trees'. Sammen danner de et unikt fingeraftryk.

Citationsformater