Dynamic Text Indexing under String Updates

DOI10.1006/JAGM.1996.0814MaRDI QIDQ3128197zbMATH OpenOpenAlexFDO

Authors Paolo Ferragina

Publication date 18 November 1997

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0814

zbMATH Keywords

dynamic text indexing problemdynamic tree matching problem

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Searching and sorting (68P10)

Recommendations

• Improved Dynamic Text Indexing
• scientific article; zbMATH DE number 1003303

Cited in

(13)

• Longest common substring made fully dynamic
• A linear time lower bound on McCreight and general updating algorithms for suffix trees
• On updating suffix tree labels
• Searching for a modified pattern in a changing text
• Dynamic suffix tree and two-dimensional texts management
• Online timestamped text indexing
• A randomized numerical aligner (rNA)
• Dynamic text and static pattern matching.
• Dynamic and internal longest common substring
• Orthogonal range searching for text indexing
• Generalized substring compression
• Repetition Detection in a Dynamic String
• Managing unbounded-length keys in comparison-driven data structures with applications to online indexing

This page was built for publication: Dynamic Text Indexing under String Updates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128197)