super string problem and data compression.The fault tolerant version of the suffix tree presented in the literature uses complex techniques of encodable and decodable error-correcting codes,blocked data structures and fault-resistant tries.In this work,we use the natural approach of data replication ...
The linear-size suffix tries (LSTries) (Crochemore et al. in Theor Comput Sci 638:171–178, 2016) are a version of suffix trees in which the edge labels are single characters, yet are able to perform pattern matching queries in optimal time. Instead of explicitly storing the input text,...
implementations and usage of Trie data structures. If you want to find out more about the theory behind the data structure itself Google will be probably your best friend. In fact most of popular books on data structures and algorithms describe tries (see.: Advanced Data Structures by Peter ...
Succinct data structure是我(本文作者)接触不久的方向. 我对其兴趣起源于SIGMOD'18的一篇paper: surf: practical range query filtering with fast succinct tries. 现在想把发展一个研究课题. 因相关背景知识不足,便开始阅读相关papers开始survey工作. 但"Tell me and I forget; Teach me and I may remember; I...
Incomputer science, asuffix tree(also calledPAT treeor, in an earlier form,position tree) is a certain data structure that presents thesuffixesof a givenstringin a way that allows for a particularly fast implementation of many important string operations. ...
A probabilistic analysis of the height of tries and of the complexity if triesort. Acta Informatica, 21:229-232, 1984. [ll] S. Golumb. Shift Register Sequences. Aegean Park Press, 1982. [12] G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Strucfures. Addison-Wesley...
(Manber and Myers 1993) occupy 9 bytes for each input symbol • level compressed tries (Anderson and Nilson 1993) take 12 bytes for each input character • suffix cactuses (Kärkkäinnen 1995) require 10n bytes Kurtz (1999) proposes a data structure that requires 10.1 bytes per input...
binarytries,andintroduce compactdatastructuresforsuffixarraysandsuffixtrees. 2MoreonBinaryTries Notethataleafinabalanced-parenthesisrepresentationofabinarytrieisthestring()).Asshown inapaperbyMunro,Raman,andRao[1],thefollowingqueriesonleavescanbeimplementedin constanttimeusingasuccinctdatastructure. leaf-rank(...
expected length of the shortest feedback register to generate a sequence of lengthnis less than 2 logpn+o(1), and also give several other statistics of interest for distinguishing random strings. The proof is based on relating the maximum order complexity to a data structure known as a ...
Abstract Binary De Bruijn sequences are studied in this work, by means of analysing the properties of their suffix arrays. More precisely, specific properties that are present in the suffix array of any binary De Bruijn sequence are proved; by this way, it is shown that building an appropriat...