Results 11 to 20 of about 1,070,371 (211)
, 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 +5 more sources
Practical Compressed Suffix Trees [PDF]
Algorithms, 2013 The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for
Gonzalo Navarro +2 more
doaj +4 more sources
The suffix tree of a tree and minimizing sequential transducers [PDF]
Theoretical Computer Science, 1995 This paper gives a linear-time algorithm for the construction of the<br />suffix tree of a tree. The suffix tree of a tree is used to obtain an efficient<br />algorithm for the minimization of sequential transducers.
Breslauer, Dany
core +7 more sources
On updating suffix tree labels [PDF]
Theoretical Computer Science, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FERRAGINA, PAOLO +2 more
openaire +4 more sources
Faster suffix tree construction with missing suffix links [PDF]
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000 Summary: 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. These trees also have the property that the node degrees may be large.
Cole, Richard, Hariharan, Ramesh
core +5 more sources
The suffix binary search tree and suffix AVL tree
, 2000 Suffix trees and suffix arrays are classical data structures that are used to represent the set of suffixes of a given string, and thereby facilitate the efficient solution of various string processing problems --- in particular online string searching ...
Love, L., Irving, R.
core +9 more sources
The Computer Journal, 2017 Accepted to The Computer Journal.
Andrea Farruggia +4 more
openaire +6 more sources
RANCANG BANGUN APLIKASI PENCARIAN DOKUMEN BERBASIS WEB MENGGUNAKAN METODE SUFFIX CACTUS CLUSTERING
JUTI: Jurnal Ilmiah Teknologi Informasi, 2003 Salah satu bagian dari temu kembali (retrieval) informasi adalah menyajikan data hasil pencarian dengan cara mengelompokkan (clustering) seluruh dokumen hasil pencarian sesuai dengan kemiripan antar dokumen.
F. X. Arunanto, Agus Widodo
doaj +1 more source
IEEE Access, 2020 In order to achieve content-based binocular stereoscopic image or video retrieval efficiently, a feature indexing algorithm based on hybrid grid multiple suffix tree and hierarchical clustering is proposed.
Fengfeng Duan, Qicong Zhang
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