Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
From MaRDI portal
Publication:2354764
DOI10.1016/j.tcs.2015.06.013zbMath1328.68048OpenAlexW628376345MaRDI QIDQ2354764
Luciana Vitale, Álvaro Martín, Gadiel Seroussi
Publication date: 24 July 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.013
Related Items
A compressed dynamic self-index for highly repetitive text collections, Small-space LCE data structure with constant-time queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing longest previous factor in linear time and applications
- Estimating the dimension of a model
- Sublinear approximate string matching and biological applications
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- Truncated suffix trees and their application to data compression.
- The consistency of the BIC Markov order estimator.
- On-line construction of suffix trees
- Context tree estimation for not necessarily finite memory processes, via BIC and MDL
- Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure
- Consistency of the Unlimited BIC Context Tree Estimator
- On Finite Memory Universal Data Compression and Classification of Individual Sequences
- The performance of universal encoding
- A Space-Economical Suffix Tree Construction Algorithm
- A universal algorithm for sequential data compression
- Algorithms on Strings, Trees and Sequences
- A universal predictor based on pattern matching
- Large-scale typicality of Markov sample paths and consistency of MDL order estimators
- Twice-Universal Simulation of Markov Sources and Individual Sequences
