scientific article; zbMATH DE number 5050583

zbMATH Open1104.68034MaRDI QIDQ5485317FDOQ5485317

Authors: Mark Daniel Ward, Wojciech Szpankowski 

Publication date: 29 August 2006

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2127733
• scientific article; zbMATH DE number 2079422
• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• On suffix extensions in suffix trees
• scientific article; zbMATH DE number 503334
• Analysis of the average depth in a suffix tree under a Markov model
• An estimation of the size of non-compact suffix trees
• Variance of the internal profile in suffix trees
• scientific article; zbMATH DE number 1984548

zbMATH Keywords

combinatorics on wordsdata compressionpattern matchingsuffix treesautocorrelation polynomialcomplex asymptotics

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics on words (68R15)

Cited In (3)

• A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm
• On the shape of the fringe of various types of random trees
• Title not available (Why is that?)

This page was built for publication:

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