Most Recent Match Queries in On-Line Suffix Trees

N. Jesper Larsson

Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review


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.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Pages (from-to)252-261
Number of pages10
Publication statusPublished - 2014
Event25th Annual Symposium on Combinatorial Pattern Matching - Moscow, Russian Federation
Duration: 16 Jun 201418 Jun 2014
Conference number: 25


Conference25th Annual Symposium on Combinatorial Pattern Matching
Country/TerritoryRussian Federation
Internet address


Dive into the research topics of 'Most Recent Match Queries in On-Line Suffix Trees'. Together they form a unique fingerprint.

Cite this