Results 31 to 40 of about 58,659 (213)
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 +5 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
Shortest Unique Substring Query Revisited [PDF]
, 2014 We revisit the problem of finding shortest unique substring (SUS) proposed recently by [6]. We propose an optimal $O(n)$ time and space algorithm that can find an SUS for every location of a string of size $n$. Our algorithm significantly improves the $O(
İleri, Atalay Mert +2 more
core +3 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
Efficient Data Structures for Range Shortest Unique Substring Queries
Algorithms, 2020 Let T[1,n] be a string of length n and T[i,j] be the substring of T starting at position i and ending at position j. A substring T[i,j] of T is a repeat if it occurs more than once in T; otherwise, it is a unique substring of T.
Paniz Abedin +3 more
doaj +1 more source
CGAP-align: a high performance DNA short read alignment tool. [PDF]
PLoS ONE, 2013 Next generation sequencing platforms have greatly reduced sequencing costs, leading to the production of unprecedented amounts of sequence data. BWA is one of the most popular alignment tools due to its relatively high accuracy.
Yaoliang Chen +7 more
doaj +1 more source
Privacy-preserving string search on encrypted genomic data using a generalized suffix tree
Informatics in Medicine Unlocked, 2021 Background and objective: Efficient sequencing technologies generate a plethora of genomic data and make it available to researchers. To compute a massive genomic dataset, outsourcing the data to the cloud is often required.
Md Safiur Rahman Mahdi +3 more
doaj +1 more source
Computing Lempel-Ziv Factorization Online [PDF]
, 2012 We present an algorithm which computes the Lempel-Ziv factorization of a word $W$ of length $n$ on an alphabet $\Sigma$ of size $\sigma$ online in the following sense: it reads $W$ starting from the left, and, after reading each $r = O(\log_{\sigma} n ...
Starikovskaya, Tatiana
core +1 more source
BuST-Bundled Suffix Trees [PDF]
, 2006 We introduce a data structure, the Bundled Suffix Tree (BUST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BUST, constructed over a text α of length n, not only the positions of the exact occurrences of β in
BORTOLUSSI, LUCA +2 more
openaire +2 more sources
A Gray Box for Visualizing Instruction Sequence Based on Improved Suffix Tree
IEEE Access, 2020 Gray box is a kind of device in which the working process of a program or system is locally recognized. Gray box testing, also known as gray box analysis, is a software debugging method based on the limited cognition of the internal details of the ...
Donglin Wang, Jiandong Fang
doaj +1 more source