Online timestamped text indexing
DOI10.1016/S0020-0190(01)00275-7zbMATH Open1338.68276WikidataQ126557005 ScholiaQ126557005MaRDI QIDQ294884FDOQ294884
Authors: Amihood Amir, Gad M. Landau, 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
Recommendations
Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
- Recursive Star-Tree Parallel Data Structure
- Adding range restriction capability to dynamic data structures
- A Space-Economical Suffix Tree Construction Algorithm
- 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
- Title not available (Why is that?)
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Title not available (Why is that?)
- Optimal On-Line Search and Sublinear Time Update in String Matching
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: Online timestamped text indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294884)