Most Recent Match Queries in On-Line Suffix Trees
From MaRDI portal
Abstract: 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.
Recommendations
- On-line construction of suffix trees
- scientific article; zbMATH DE number 2079422
- Suffix Arrays: A New Method for On-Line String Searches
- On-line suffix tree construction with reduced branching
- On-line construction of parameterized suffix trees for large alphabets
- Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version)
- A fast suffix automata based algorithm for exact online string matching
- The exact online string matching problem: a review of the most recent results
Cited in
(5)
This page was built for publication: Most Recent Match Queries in On-Line Suffix Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5165611)
