Index structures like the suffix tree or the suffix array are of utmost importance in stringology, most notably in exact string matching.
In this paper, we show that the Super-Cartesian tree of the LCP-array (with which the suffix array is enhanced) very naturally explains the child table. More ...
Aug 26, 2009 · New (very simple) compressed suffix tree, called cst sct, which supports the child operation in O(log|Σ|) time (i.e. pattern matching in m ...
This paper shows that the Super-Cartesian tree of the LCP-array (with which the suffix array is enhanced) very naturally explains the child table, ...
May 24, 2017 · Enno Ohlebusch, Simon Gog: A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE 2009: 51-62. manage site settings.
People also ask
What is the fastest suffix array algorithm?
What is a compressed trie for all the suffixes of a text string called?
What is a suffix array in Python?
What is an lcp array?
"A compressed enhanced suffix array supporting fast string matching." String Processing and Information Retrieval. Springer Berlin Heidelberg, 2009 ...
A Compressed Enhanced Suffix Array Supporting Fast String Matching ; String Processing and Information Retrieval, 16th International Symposium, SPIRE 2009, ...
By these methods, one can construct compressed suffix trees supporting the pattern search in O(m′ |Σ|) time where m′ = m logε n, m is the length of a pattern, ...
Oct 22, 2024 · Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching (Extended Abstract). March 2000; SIAM Journal ...
Missing: Enhanced | Show results with:Enhanced
A new compressed suffix tree supporting O(m′ log|Σ|)-time pattern search and its construction algorithm using optimal working space is presented and a new ...