|
|||||
|
|
Online timestamped text indexing |
|
| Authors: | Amihood Amir Gad M Landau Esko Ukkonen |
| Affiliation: | a Department of Mathematics and Computer Science, Bar-Ilan University, 52900 Ramat-Gan, Israel b Department of Computer Science, Haifa University, Haifa 31905, Israel c Department of Computer and Information Science, Polytechnic University, Six MetroTech Center, Brooklyn, NY 11201-3840, USA d Department of Computer Science, P.O. Box 26, FIN-00014 University of Helsinki, Finland |
| Abstract: | In this paper we present an efficient method to index a text stream on-line in a fashion that allows, at any point in time, to find the longest suffix of the text that has appeared previously, and the closest (farthest) times in which it has appeared. Our algorithms allow efficient answers to these queries. |
| Keywords: | Analysis of algorithms Suffix trees Pattern recognition |
| 本文献已被 ScienceDirect 等数据库收录！ | |