Pages that link to "Item:Q4277536"
From MaRDI portal
The following pages link to A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors (Q4277536):
Displaying 15 items.
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees (Q672989) (← links)
- On average sequence complexity (Q703547) (← links)
- On the entropy of a hidden Markov process (Q932317) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter (Q1202935) (← links)
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
- Optimal data compression algorithm (Q1816650) (← links)
- Context Trees, Variable Length Markov Chains and Dynamical Sources (Q2906153) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- The longest common substring problem (Q2971067) (← links)
- On the construction of classes of suffix trees for square matrices: Algorithms and applications (Q4645171) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- Practical Compact Indexes for Top-<i>k</i>Document Retrieval (Q5270942) (← links)
- Universal Data Compression Algorithm Based on Approximate String Matching (Q5485382) (← links)
- Return-time -spectrum for equilibrium states with potentials of summable variation (Q6172720) (← links)
