Results 21 to 30 of about 679,088 (213)
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 +8 more sources
Suffix-Sorting via Shannon-Fano-Elias Codes
Algorithms, 2010 Given a sequence T = t0t1 . . . tn-1 of size n = |T|, with symbols from a fixed alphabet Σ, (|Σ| ≤ n), the suffix array provides a listing of all the suffixes of T in a lexicographic order.
Donald Adjeroh, Fei Nan
doaj +1 more source
Fast Hybrid Data Structure for a Large Alphabet K-Mers Indexing for Whole Genome Alignment
IEEE Access, 2021 The most common index data structures used by whole genome aligners (WGA) are based on suffix trees (ST), suffix arrays, and FM-indexes. These data structures show good performance results as WGA works with sequences of letters over small alphabets; for ...
Rostislav Hrivnak +2 more
doaj +1 more source
Optimal Prefix and Suffix Queries on Texts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied by Mäkinen and Navarro [Position-Restricted Substring Searching, LATIN 2006].
Maxime Crochemore +2 more
doaj +1 more source
Subpath Queries on Compressed Graphs: A Survey
Algorithms, 2021 Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time ...
Nicola Prezza
doaj +1 more source
The suffix binary search tree and suffix AVL tree
Journal of Discrete Algorithms, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert W. Irving, Lorna Love
openaire +1 more source
, 2017 The suffix tree—the compacted trie of all the suffixes of a string—is the most important and widely-used data structure in string processing. We consider a natural combinatorial question about suffix trees: for a string S of length n, how many nodes νS(d) can there be at (string) depth d in its suffix tree? We prove ν(n,d)=maxS∈ΣnνS(d) is O((n/d)logn) ,
Golnaz Badkobeh +3 more
openaire +3 more sources
On An Improved Parallel Construction Of Suffix Arrays For Low Bandwidth Pc-Cluster. [PDF]
, 2003 An algorithm for the parallel construction of suffix arrays generation for any texts with larger alphabet size on distributed memory architecture is ...
Md. Ali, Norhashidah +3 more
core +1 more source
Reflexes of a Hurrian Word in Armenian: A Theonym, a Dendronym, an Anthroponym
Вопросы ономастики, 2021 In Old Armenian, saws means ‘proud, luxurious, great,’ ‘some (bright) color,’ and saws and sawsi mean ‘oriental plane tree’. The word has no etymology. Hurrian has the word šauša [sausa] ‘big, great’ and the theonym Šauša / Šauška for the local version ...
Armen Ye. Petrosyan
doaj +1 more source