Abstract
An efficient method to index a text stream on-line was presented. The method allowed at any point of time to find the longest suffix that appeared previously and the closest time in which it appeared. The algorithm developed allowed efficient answers to the queries.
| Original language | English |
|---|---|
| Pages (from-to) | 253-259 |
| Number of pages | 7 |
| Journal | Information Processing Letters |
| Volume | 82 |
| Issue number | 5 |
| DOIs | |
| State | Published - 15 Jun 2002 |
Bibliographical note
Funding Information:✩This research was conducted while the first two authors were visiting the University of Helsinki as part of an Israel–Finland exchange scientist grant funded by the Israel Ministry of Science and CIMO in Finland.
Funding Information:
*Corresponding author. Partially supported by NSF grants CCR-9610238 and CCR-0104307, by NATO Science Programme grant PST.CLG.977017, by an Israel–Finland exchange scientist grant, by the Israel Science Foundation (grants 173/98 and 282/01), by the FIRST Foundation of the Israel Academy of Science and Humanities, and by IBM Faculty Partnership Award. E-mail addresses: [email protected] (A. Amir), [email protected] (G.M. Landau), [email protected] (E. Ukkonen).
Funding Information:
1 Partially supported by NSF grant CCR-96-10170, BSF grant 96-00509, and an Israel–Finland exchange scientist grant. 2Supported by the Academy of Finland under grant 22584.
Keywords
- Analysis of algorithms
- Pattern recognition
- Suffix trees
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications