Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (Q2354764): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.06.013 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truncated suffix trees and their application to data compression. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Universal Coding and Time Reversal of Tree Sources Via FSM Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal predictor based on pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finite Memory Universal Data Compression and Classification of Individual Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of the Unlimited BIC Context Tree Estimator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The performance of universal encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale typicality of Markov sample paths and consistency of MDL order estimators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The consistency of the BIC Markov order estimator. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the dimension of a model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twice-Universal Simulation of Markov Sources and Individual Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context tree estimation for not necessarily finite memory processes, via BIC and MDL / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing longest previous factor in linear time and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear approximate string matching and biological applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.06.013 / rank
 
Normal rank

Latest revision as of 04:12, 18 December 2024

scientific article
Language Label Description Also known as
English
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
scientific article

    Statements

    Space-efficient representation of truncated suffix trees, with applications to Markov order estimation (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2015
    0 references
    suffix tree
    0 references
    truncated suffix tree
    0 references
    Markov order estimation
    0 references

    Identifiers