Results 231 to 240 of about 39,701 (283)
Replacing suffix trees with enhanced suffix arrays [PDF]
Journal of Discrete Algorithms, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan Kurtz, Enno Ohlebusch
exaly +3 more sources
A suffix tree or not a suffix tree? [PDF]
Journal of Discrete Algorithms, 2015 Full version.
Tatiana Starikovskaya +1 more
exaly +8 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Theoretical Computer Science, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amihood Amir +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amihood Amir +2 more
openaire +1 more source
2022
This handbook chapter treats phenomena from the domain of Romance evaluative suffixes which are of potential interest to general linguists.
Fortin, Antonio, Rainer, Franz
openaire +1 more source
This handbook chapter treats phenomena from the domain of Romance evaluative suffixes which are of potential interest to general linguists.
Fortin, Antonio, Rainer, Franz
openaire +1 more source
From Suffix Trees to Suffix Vectors
International Journal of Foundations of Computer Science, 2006We present a first formal setting for suffix vectors that are space economical alternative data structures to suffix trees. We give two linear algorithms for converting a suffix tree into a suffix vector and conversely. We enrich suffix vectors with formulas for counting the number of occurrences of repeated substrings.
Élise Prieur, Thierry Lecroq
openaire +5 more sources
Faster Suffix Tree Construction with Missing Suffix Links
SIAM Journal on Computing, 2003 We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for two-dimensional arrays.
Richard J. Cole, Hariharan Ramesh
exaly +1 more source
Computing suffix links for suffix trees and arrays
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 more sources
International Journal of Foundations of Computer Science, 2009
We introduce the VST (virtual suffix tree), an efficient data structure for suffix trees and suffix arrays. Starting from the suffix array, we construct the suffix tree, from which we derive the virtual suffix tree. Later, we remove the intermediate step of suffix tree construction, and build the VST directly from the suffix array. The VST provides the
Jie Lin +2 more
openaire +1 more source
We introduce the VST (virtual suffix tree), an efficient data structure for suffix trees and suffix arrays. Starting from the suffix array, we construct the suffix tree, from which we derive the virtual suffix tree. Later, we remove the intermediate step of suffix tree construction, and build the VST directly from the suffix array. The VST provides the
Jie Lin +2 more
openaire +1 more source