Online timestamped text indexing

Information Processing Letters

Volumn 82, Issue 5, 2002, Pages 253-259

  Amir, Amihood ^a   Landau, Gad M ^b,c   Ukkonen, Esko ^d  

^a BAR ILAN UNIVERSITY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

^c POLYTECHNIC UNIVERSITY   (United States)

^d UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Analysis of algorithms; Pattern recognition; Suffix trees

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; PATTERN RECOGNITION; PROBLEM SOLVING; QUEUEING THEORY; TREES (MATHEMATICS);

SUFFIX TREES;

INDEXING (OF INFORMATION);

EID: 0037097073     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00275-7     Document Type: Article

References (17)

1. A lower bound for finding predecessors in Yao's cell probe model
2. Recursive star-tree parallel data-structure
3. Algorithms for dynamic closest pair and n-body potential fields
4. Efficient and elegant subword tree construction
5. Dynamic LCA queries in trees
6. Optimal suffix tree construction with large alphabets
7. Optimal on-line search and sublinear time update in string matching
8. Scaling and related techniques for geometry problems
9. Fast algorithms for finding nearest common ancestor
10. Adaptive pattern recognition
11. A space-economical suffix tree construction algorithm
12. Efficient approximate and dynamic matching of patterns using a labeling paradigm
13. On finding lowest common ancestors: Simplification and parallelization
14. On-line construction of suffix trees
15. Linear pattern matching algorithm
16. Adding range restriction capability to dynamic data structures