On updating suffix tree labels
From MaRDI portal
Publication:1129015
DOI10.1016/S0304-3975(97)00243-0zbMath0912.68059OpenAlexW1994876904MaRDI QIDQ1129015
Roberto Grossi, Manuela Montangero, Paolo Ferragina
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00243-0
Related Items (5)
Efficiency issues in the KBMAG procedure ⋮ Position heaps: a simple and dynamic text indexing data structure ⋮ Online Suffix Tree Construction for Streaming Sequences ⋮ Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure ⋮ IN-PLACE UPDATE OF SUFFIX ARRAY WHILE RECODING WORDS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The design of dynamic data structures
- Structural properties of the string statistics problem
- Fast string matching with k differences
- The suffix tree of a tree and minimizing sequential transducers
- Optimal off-line detection of repetitions in a string
- An efficient algorithm for the all pairs suffix-prefix problem
- Dynamic dictionary matching with failure functions
- Sublinear approximate string matching and biological applications
- Dynamic dictionary matching
- Improved dynamic dictionary matching
- Dynamic Text Indexing under String Updates
- A locally adaptive data compression scheme
- Data compression via textual substitution
- Efficient string matching
- A Space-Economical Suffix Tree Construction Algorithm
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Fast parallel and serial approximate string matching
- Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries
- A Generalization of the Suffix Tree to Square Matrices, with Applications
- A theory of parameterized pattern matching
This page was built for publication: On updating suffix tree labels
