Results 11 to 20 of about 40,875 (196)
A suffix tree or not a suffix tree? [PDF]
Journal of Discrete Algorithms, 2014 In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and suffix links of its internal nodes, we ask the question ”Is τ a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure ...
A Apostolico +17 more
core +9 more sources
Weighted ancestors in suffix trees [PDF]
, 2014 The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees, a.k.a.
D.E. Willard +6 more
core +3 more sources
Wavelet Trees Meet Suffix Trees [PDF]
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015 We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings.
Babenko, Maxim +3 more
core +5 more sources
PFP Compressed Suffix Trees. [PDF]
Proc Worksh Algorithm Eng Exp, 2021 Prefix-free parsing (PFP) was introduced by Boucher et al. (2019) as a preprocessing step to ease the computation of Burrows-Wheeler Transforms (BWTs) of genomic databases. Given a string S, it produces a dictionary D and a parse P of overlapping phrases such that BWT(S) can be computed from D and P in time and workspace bounded in terms of their ...
Boucher C +6 more
europepmc +4 more sources
Intent Arabic text categorisation based on different machine learning and term frequency
IET Networks, EarlyView., 2022 Abstract The complexity of Internet network configurations has made managing networks a complicated undertaking. Intent‐Based Networking (IBN) is a potential solution to this issue. In contrast to conventional networks, where a concrete description of the settings typically conveys a network administrator's goal kept on each device, an administrator's ...
Mohammad Fadhil Mahdi +1 more
wiley +1 more source
Algorithms, 2018 We consider a sliding window W over a stream of characters from some alphabet of constant size. We want to look up a pattern in the current sliding window content and obtain all positions of the matches. We present an indexed version of the sliding window, based on a suffix tree.
Andrej Brodnik, Matevž Jekovec
openaire +3 more sources
On the Number of 2-Protected Nodes in Tries and Suffix Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We use probabilistic and combinatorial tools on strings to discover the average number of 2-protected nodes in tries and in suffix trees. Our analysis covers both the uniform and non-uniform cases.
Jeffrey Gaither +3 more
doaj +1 more source
On Suffix Extensions in Suffix Trees
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Breslauer D, Italiano G
openaire +6 more sources
On-line construction of position heaps [PDF]
, 2011 We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it considers the ...
A. Blumer +10 more
core +8 more sources