Online timestamped text indexing

DOI10.1016/S0020-0190(01)00275-7zbMath1338.68276WikidataQ126557005 ScholiaQ126557005MaRDI QIDQ294884

Gad M. Landau, Amihood Amir, Esko Ukkonen

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019001002757?np=y

zbMATH Keywords

analysis of algorithmssuffix trees

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items

Unnamed Item ⋮ Lempel-Ziv-like parsing in small space ⋮ Note on the greedy parsing optimality for dictionary-based text compression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for finding predecessors in Yao's cell probe model
• On-line construction of suffix trees
• Fast Algorithms for Finding Nearest Common Ancestors
• Adding range restriction capability to dynamic data structures
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• Recursive Star-Tree Parallel Data Structure
• A Space-Economical Suffix Tree Construction Algorithm
• Optimal On-Line Search and Sublinear Time Update in String Matching