scientific article; zbMATH DE number 742990

MaRDI QIDQ4763430zbMATH OpenFDO

Authors Wojciech Szpankowski

Publication date 11 April 1995

zbMATH Keywords

string matchingstring rulersuffix tree

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• On suffix extensions in suffix trees
• scientific article; zbMATH DE number 1984548
• The average profile of suffix trees
• Random suffix search trees
• scientific article; zbMATH DE number 503334
• An estimation of the size of non-compact suffix trees
• On suffix tree breadth
• A Note on the Height of Suffix Trees

Cited in

(5)

• scientific article; zbMATH DE number 2127733 (Why is no real title available?)
• A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
• Asymptotic properties of data compression and suffix trees
• Top-\(k\) document retrieval in optimal time and linear space
• Optimal encoding of non-stationary sources

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 Q4763430)